I had around 1 year and 9 months of experience. And applied for SDE1
First Round (F2F):
1. What are data structures in which you are most uncomfortable.
2. What is your favorite sorting algorithm. Give a dry run.
3. Heap sort, dry run, Complexity of building heap, prove it.
4. Lowest Common Ancestor in a Binary Tree , extended for n-array tree.
5. Sort an array of 0s, 1s and 2s ( in single scan)
Second Round (F2F):
1. Tell me about yourself.
2. What is the most challenging project you have done, your contribution.
3. Convert a given tree to its Sum Tree
4. Longest K unique characters substring
Third Round (F2F):
1. Tell me about yourself.
2. Most challenging project, why it was challenging, your role in it.
3. Implement a LRU cache, extended for LRU with ttl at each block.
4. k largest(or smallest) elements in an array
5. Full working code of Dijastra Algorithm and a dry run.
Fourth Round: Hiring Manager (Telephonic)
1 Tell me about yourself, company role and responsibility and many behavioral questions.
- Your current Group/Team structure.
- Promotion criteria in your group.
- Situation when you helped your colleague
- Situation when you needed help from a colleague.
- If one of team member is not working or working very slow, how will you handle the situation.
- When you have trained any colleague.
- Technology suggested by you in your team.
