Round 1: Technical Interview
Questions:
Given a tree and some target nodes. The tree is undirected and need not be binary. Each edge length is 1.
Task: Starting from the root, find the minimum cost to traverse all target nodes and return to the root.
Follow-up Question:
What if you can start from any node instead of the root?
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Interview
Questions:
Given a list of servers, each server has a cost associated with it. The servers are represented as an array of N integers.
If you choose server i, then i servers ahead of it are automatically selected.
You may skip selecting those servers, but sometimes it might be beneficial to select them as well.
Task: Find the min cost to cover all servers.
Candidate's Approach
- Started with an O(n log n) solution.
- Later optimized it to O(n).
Interviewer's Feedback
No feedback provided.
Round 3: Hiring Manager Round
Questions:
Focused on behavioral questions and past internship experiences.
Questions based on teamwork, problem-solving approach, and decision-making in challenging situations.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.