Tip 1 : Practice competitive programming, attempt 2 questions daily
Tip 2 : never leave the basics of your coding skills behind
Tip 3 : should know in-out of your projects
Tip 1 : never lie on your resume
Tip 2 : should know in & out of your listed projects
Interviewer had good knowledge asked many questions.



We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
Data base design for book my show
Tip 1 : get your doubts clear before attempting
Tip 2 : keep the round interactive.




1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.
I first clarified the doubts since the question was too vague in start.
Then I told that this problem can be solved with iterative or recursive approach, Interviewer told me to go ahead and code the recursive one.
We discussed time complexity.
Then I implemented iterative one too.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the purpose of the return keyword?