Round 1
Questions:
- "Nested List Weight Sum" (LeetCode 339)
- "986. Interval List Intersections" but instead of finding intersections, we need to merge two sorted, non-overlapping interval lists into a single unioned interval list.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.