I am too Lazy to update about me.
Can you please explain a bit. I am not able to understand how to approach this kind of problem.
Thank you ma'am
Thank you so much.
All A, B, C seems to be correct answer.
in case of linked list to perform concatination we only need some pointer assignments. This can be done in O(1).
I did not get it sir, why heap data structure can't/should't be userd for searching?
The above answer by Digvijay is correct as per my knowledge. While constructing DFA or PDA for the complement of a language we change non final state to final state and vice versa.