| Title | Acceptance | Level |
|---|---|---|
| Intersection of Two Arrays II | 51.4% | Easy |
| Convert Binary Search Tree to Sorted Doubly Linked List | 59.1% | Medium |
| Time Based Key-Value Store | 53.1% | Medium |
| Flatten Binary Tree to Linked List | 49.3% | Medium |
| Insert Delete GetRandom O(1) | 47.5% | Medium |
| Web Crawler Multithreaded | 45.9% | Medium |
| Binary Tree Vertical Order Traversal | 45.3% | Medium |
| Closest Leaf in a Binary Tree | 43.6% | Medium |
| Vertical Order Traversal of a Binary Tree | 36.6% | Medium |
| Remove Comments | 34.6% | Medium |
| Second Degree Follower | 30.3% | Medium |
| Decode Ways | 24.7% | Medium |
| Trapping Rain Water | 48.9% | Hard |
| Sliding Window Maximum | 43.0% | Hard |
| The Skyline Problem | 34.6% | Hard |
| Insert Delete GetRandom O(1) - Duplicates allowed | 34.1% | Hard |
| First Missing Positive | 32.0% | Hard |
| Regular Expression Matching | 26.8% | Hard |