Round 1
Questions:
-
680. Valid Palindrome 2
Follow up question: Instead of 1 character removal, how would I deal with k character removal? -
543. Diameter of Binary Tree
- Answered using DFS. No follow-ups.
-
1249. Minimum Remove to Make Valid Parentheses
- Only thought process. No code provided.
Candidate's Approach
- For the first question, the candidate answered but fumbled with the follow-up regarding k character removal.
- For the second question, the candidate utilized a depth-first search (DFS) approach.
- The third question was discussed only in terms of thought process without any coding.
Interviewer's Feedback
No feedback provided.