Tip 1 : Know your projects in depth so you can answer any questions related to them.
Tip 2 : Be consistent with your practice of DSA. Make it a habit and solve questions from different topics. Try your approach before looking for hints. Keep revising the topics and techniques to keep them fresh in your mind.
Tip 1 : Use a simple well formatted resume. The spacing and fonts should be consistent.
Tip 2 : Quantify the impact that you made on a project or at a place. Add meaningful numbers wherever possible.
Design & Implement a service which allows users to get Lucky Draw Raffle tickets and use one lucky draw raffle ticket to participate in a lucky draw raffle.
- Design an API which allows users to get the raffle tickets. This API can be consumed in a lot of ways like We can call this API after the user has placed an Order.
- Design an API which shows the next Lucky Draw Event timing & the corresponding reward. For example - Lucky Draw can run everyday at 8AM. Reward on say 10th Feb is Phone, 11th Feb is Washing Machine etc
- Design an API which allows users to participate in the game. Once a user has participated with a raffle ticket, she shouldn’t be able to participate again in the same event.
- Design an API which lists all the winners of all the events in the last one week. - Compute the winner for the event and announce the winner.
Tip 1: Keep your code modular.
Tip 2: Never miss the documentation. It helps the panel clearly understand your approach.
The interview round was scheduled for 1-3 PM over Google Meet. The coding question was solved over VSCode and the problem was later shared on Pastebin.
The interviewer was very welcoming. He focused on DSA as well as overall development concepts. He explained the questions very concisely. I remember only one DSA Question which was asked.



The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

1. Traverse the lists to find their lengths
2. Simply traverse the longer list and skip its initial elements till the number of elements left is equal to the length of the second list.
3 Loop through both the lists and compare if the current nodes are equal.
4. Return the node which occurs in both the lists.

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