Tip 1 : Time yourself while solving: 10min for easy, 20 for medium and 35 for Hards
Tip 2 : Review solved questions to get accustomed to patterns
Tip 3 : Never ever memorise solutions
Tip 1 : Mention achievement metrics for projects you worked on
Tip 2 : limit to single page and don’t have graphs
Good environment, asked 2 DS questions of easy difficulty. Solved within time limit



The given linked lists may or may not be null.
If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL
The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
1. Have 2 pointers, one for each list.
2. Compare values and update to new list accordingly.



Input: Let the binary tree be:

Output: YES
Explanation: As we can see in the image, the original tree is the same as the mirrored tree.
Traverse tree recursively and compare nodes, return early if values are mismatch
Afternoon interview.
Interview was open ended thus needed to clarify a lot to get proper requirements
Design a database for a subscription system with tiers for Unacademy.
Tip 1 : Ask questions to get clear requirements
Tip 2 : never assume, always ask or be clear you are making the assumption I.e Assume that all users are from India
Tip 3 : Be sure to use indices, know if SQL or NoSQL is applicable
Afternoon time
Interview was good
Nice environment
Design a real-time ranking for a live exam.
Tip 1 : Clear up requirements with many questions
Tip 2 : come up with a basic solution and then build on it
Tip 3 : practicing and read many articles for system design
Afternoon to evening
Interview was easy
Project Discussion.
Asked about my salary expectations.
Am I ready to relocate?
Tip 1 : Be confident
Tip 2 : Understand ESOP/RSUs and negotiate then as these can’t be changed for 4 years
Tip 3 : Research salary ranges and maintain above median

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