Tip 1 : Be good at SDA. Practice around 150(30 easy, 20 hard, 100 medium)
Tip 2 : Try to build solution and explain it well
Tip 3 : know your project very well
Tip 1 : Atleast 2 Good Projects
Tip 2 : 1 Page resume with most relevant sections on the top.
Afternoon.
Virtual round
Interviewer was good.



For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5
First fried with queue.
Interviewer waa expecting stack. Able to give him approach.
Afternoon
Virtual
Interviewer was helpful.
Asked to build class diagram of BookMyShow
Tip 1 : gather the requirements
Tip 2 : speak out loud
Tip 3 : talk about tradeoff
Afternoon
Virtual
Design jwt token like library
Tip 1: be good at design patterns
Tip 2: use design pattern and oops
Tip 3: learn the above principles
Evening.
Virtual



In the given linked list, there is a cycle, hence we return true.

First tried with hashmap
Then tried turtle and tortoise approach

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?