Round 1
Questions:
- Subarrays with K Different Integers
- Product of Array Except Self
- Top K Frequent Elements
- Data Stream as Disjoint Intervals
- Valid Parentheses
- Convert Sorted Array to Binary Search Tree
- Group Anagrams
- Subarray Sum Equals K
- Confusing Number II
- Strobogrammatic Number III
- Two Sum
- House Robber
- First Missing Positive
- Design Search Autocomplete System
- Merge K Sorted Lists
- Word Break
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree
- Path Sum III
- Find Median from Data Stream
- N-ary Tree Level Order Traversal
- Linked List Cycle
- Linked List Cycle II
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Additional Questions
Questions:
- Sort doubly linked list with log(n) time
- Implement a queue data structure using dynamic array
- Cherry Pickup
- Problem List
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.