Round 1
Questions: Leetcode question number: 959 - Region cut by slashes
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: Leetcode question number: 3049 - Earliest second to mark indices
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: Leetcode question number: 2407 - Longest increasing subsequence 2
Candidate's Approach
The candidate solved the problem in O(n^2) time complexity, but the interviewer expected a solution in O(n log n) time.
Interviewer's Feedback
No feedback provided.