| Questions | Link |
|---|---|
| Maximum Depth of Binary Tree | solution |
| Linked List Random Node | solution |
| Increasing Order Search Tree | solution |
| The kth Factor of n | solution |
| Can place flowers | solution |
| Populating Next Right Pointers in Each Node II | solution |
| Spiral Matrix II | solution |
| Pairs of Songs With Total Durations Divisible by 60 | solution |
| Binary Search Tree Iterator | solution |
| Valid Mountain Array | solution |
| Remove Duplicates from Sorted Array II | solution |
| Smallest Subtree with all the Deepest Nodes | solution |
| Burst Balloons* | solution |
| Palindrome Partitioning* | solution |
| Squares of a Sorted Array | solution |
| Validate Binary Search Tree | solution |
| 4Sum II* | solution |
| Increasing Triplet Subsequence | solution |
| Cherry Pickup II* | solution |
| Decoding String at Index* | solution |
| Smallest Range II* | solution |
| Balanced Binary Tree | solution |
| Next Greater Element III* | solution |
| Swap Nodes in Pairs | solution |
| Diagonal Traverse* | solution |
| Decode Ways* | solution |
| Reach a number* | solution |
| Questions | Link |
|---|---|
| Distribute Candies | solution |
| Set Mismatch* | solution |
| Missing Number | solution |
| Intersection of Two Linked Lists* | solution |
| Average of Levels in Binary Tree* | solution |