Round 1
Questions:
Test Cases for Question 1:
- Input: [3, 2, 1, 5, 6, 4], k = 2
- Output: 5
Test Cases for Question 2:
- Input: "lee(t(c)o)de)"
- Output: "lee(t(c)o)de"
Candidate's Approach
- For the first question, the candidate used a min-heap to store the top K elements.
- For the second question, the candidate initially used a Stack but realized that a count approach would have been more efficient for checking open and closed brackets.
Interviewer's Feedback
No feedback provided.