Round 1: Technical Phone Screen
Questions:
- Introductions
- Question: Time Taken to Cross the Door (variation of this)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Onsite Round I
Questions:
- Question: Maximum Beauty of an Array After Applying Operation (variation where m is given maximum paint operation with favorite color c that you can apply to block. The operation should be in a way to maximize the length of continuous blocks or beautiful path for the color c)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Onsite Round II
Questions:
- Given string s, substring one can be in range i, j and substring two can be in range j+1, k, find the number of all such substring pairs such that distinct characters present in both substrings are the same. Example: For "ababac", pairs: [ab ab], [ab aba], [aba ba], [ba ba]. Output: 4
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4: Onsite Round III
Questions:
- You are given an undirected tree and can apply at most k operations on it. In one operation, remove a leaf vertex and its adjacent edge. A leaf vertex is a vertex that is connected to exactly one other vertex. Minimize the tree's diameter by applying the operation as many as k times. Use the following assumptions: "The distance between two vertices is the number of edges in their shortest path. The diameter of a tree is the maximum distance among all pairs of vertices in the tree." Return the minimum possible diameter after applying at most k operations.
Example:
5 → tree size n = 5 1 → number of operations k = 1 4 → edges[] rows n-1 = 4 2 → edges[] cols = 2 1 2 → edges = [[1, 2], [1, 3], [1, 4], [3, 5]] 1 3 1 4 3 5 Output: 2
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Final Outcome
- Recruiter called and informed about the decision: Lean Hire, No Hire, Lean Hire. So not proceeding further.