Giving back to the leetcode community.
I appeared for the Hiring Drive in Feb 2025.
1st Round - DS/Algo (Working solution was expected)
There was a dependency graph given for tasks based on execution. I had to print out right order of execution of tasks for a given task.
2nd Round - DS/Algo (Working solution was expected)
Modified number of island problem
3rd Round - LLD (Working solution was expected)
Design a task scheduling system. Task should have some executable which should be run when it is excuted.
4th Round - HLD
Get nearest restaurants for a customer.
The interviewer focused only on how to store the restaturant data in DB and get the nearest restaurants for a customer. The emphasis was on DB schema and APIs.
Further questions -
- What will happen if there are hot spots
- What will happen if there are no nearby restaurants.
I designed the system using cassandra with co-rodinate hash as partitioning and clustering key.
No discussion on scale happened. I had to specifically talk about scale and fail safes.
5th Round - HM
Typical manegerial questions- 30 mins
Complicated design problem which I solved - 30 mins
