Phone Screen
Questions:
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Onsite Loop
Coding Round 1
Questions:
- Continuous Subarray Sum
- Sparse multiplication of a matrix, pretty different from Sparse Matrix Multiplication. Provided just the row and cols and values of the 2 matrices containing non-zero elements.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Coding Round 2
Questions:
- Candy Crush 1 similar to Remove All Adjacent Duplicates in String but there wasn't any limitation on count. You need to keep on bursting the similar characters.
- Input: "aaabbbc"
- Output: "c"
- Explanation:
- Remove 3 'a': "aaabbbbc" => "bbbbc"
- Remove 4 'b': "bbbbc" => "c"
- Lowest Common Ancestor of a Binary Tree II
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Coding Round 3
Questions:
- Clone Graph
- Top K Frequent Elements
- For question 1, I used DFS approach. For Question 2, I told him 3 approaches: Priority Queue, Quick Sort, and Count Sort. He didn't have Count Sort in his mind, so asked me to implement Count Sort one.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Behavioral Round
Questions:
- Critical feedback from manager
- Most complicated project
- Conflict with a teammate
- Tight deadline
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
System Design
Description:
- Online Coding Judge: LeetCode
- Primary Functionality: Multiple competitions running at the same time, generate score for each user participating in the competition and show real-time ranking board.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Additional Notes:
- Got an additional coding round since feedback of one of my coding rounds was not submitted on time.
- Passed for E4. Couldn't get E5 since in my behavioral round, my previous work scope was limited and didn't align with E5.