Round 1
Questions:
-
Find the k-th Missing Number
- Example:
- Input:
arr = [2, 4, 6, 7, 8], k = 2
- Output:
3
- Input:
- Example:
-
Find the Longest Path in a Binary Tree
- Example (Root-to-Leaf Path):
- Input:
1 / \ 2 3 / \ 4 5
- Output: `[1, 2, 4, 6]`
- Input:
- Example (Tree Diameter):
- Input:
1 / \ 2 3 / \ \ 4 5 6
- Output: `5`
- Input:
- Example (Root-to-Leaf Path):
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.