| Title | Acceptance | Level |
|---|---|---|
| Univalued Binary Tree | 67.7% | Easy |
| Reformat Date | 60.5% | Easy |
| Two Sum | 45.6% | Easy |
| Implement Stack using Queues | 45.1% | Easy |
| Valid Parentheses | 39.0% | Easy |
| Longest Common Prefix | 35.4% | Easy |
| K-diff Pairs in an Array | 31.6% | Easy |
| Group Anagrams | 56.9% | Medium |
| Subarray Sums Divisible by K | 48.9% | Medium |
| Insert Delete GetRandom O(1) | 47.5% | Medium |
| Letter Combinations of a Phone Number | 46.8% | Medium |
| Knight Dialer | 45.2% | Medium |
| Subarray Sum Equals K | 43.9% | Medium |
| Word Break | 40.1% | Medium |
| Reconstruct Itinerary | 36.7% | Medium |
| LRU Cache | 33.2% | Medium |
| Text Justification | 27.7% | Hard |