Round 1
Questions:
- Variation of Topological Sort
- Variation of Target Sum
Both questions were solved correctly.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- A story was given, and the catch was to find out that DFS will work here.
This question was solved correctly. Additionally, project-related questions were asked.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- High-level design discussion (not too deep).
- A standard backtracking problem, one of the top 5 in the same area.
This round went well.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4 (Final)
Questions:
- Explain the architecture and what was done in the last project (30 min).
- DSA question: LC easy medium on sliding window + max heap.
The coding question was solved correctly, and tests were run on Codility, handling boundary cases. However, there was a mistake in explaining the time complexity regarding the removal from a heap, which was incorrectly stated as O(logn).
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.