Contains Duplicate
EasyArrays & HashingStart your algorithmic training with this foundational problem.
Overall Progress0 / 75 Solved (0%)
Category Mastery
Arrays & Hashing0/8
Two Pointers0/3
Sliding Window0/4
Stack0/1
Binary Search0/2
Linked List0/6
Trees0/11
Tries0/3
Heap / Priority Queue0/1
Backtracking0/2
Graphs0/6
Advanced Graphs0/1
1-D Dynamic Programming0/10
2-D Dynamic Programming0/2
Greedy0/2
Intervals0/5
Math & Geometry0/3
Bit Manipulation0/5
Syllabus Table(75 problems)
| # | Title | Category | Difficulty | Status | Action |
|---|---|---|---|---|---|
| 1 | Contains Duplicate | Arrays & Hashing | Easy | Unstarted | Open |
| 2 | Valid Anagram | Arrays & Hashing | Easy | Unstarted | Open |
| 3 | Two Sum | Arrays & Hashing | Easy | Unstarted | Open |
| 4 | Group Anagrams | Arrays & Hashing | Medium | Unstarted | Open |
| 5 | Top K Frequent Elements | Arrays & Hashing | Medium | Unstarted | Open |
| 6 | Encode and Decode Strings | Arrays & Hashing | Medium | Unstarted | Open |
| 7 | Product of Array Except Self | Arrays & Hashing | Medium | Unstarted | Open |
| 8 | Longest Consecutive Sequence | Arrays & Hashing | Medium | Unstarted | Open |
| 9 | Valid Palindrome | Two Pointers | Easy | Unstarted | Open |
| 10 | 3Sum | Two Pointers | Medium | Unstarted | Open |
| 11 | Container With Most Water | Two Pointers | Medium | Unstarted | Open |
| 12 | Best Time to Buy And Sell Stock | Sliding Window | Easy | Unstarted | Open |
| 13 | Longest Substring Without Repeating Characters | Sliding Window | Medium | Unstarted | Open |
| 14 | Longest Repeating Character Replacement | Sliding Window | Medium | Unstarted | Open |
| 15 | Minimum Window Substring | Sliding Window | Hard | Unstarted | Open |
| 16 | Valid Parentheses | Stack | Easy | Unstarted | Open |
| 17 | Find Minimum In Rotated Sorted Array | Binary Search | Medium | Unstarted | Open |
| 18 | Search In Rotated Sorted Array | Binary Search | Medium | Unstarted | Open |
| 19 | Reverse Linked List | Linked List | Easy | Unstarted | Open |
| 20 | Merge Two Sorted Lists | Linked List | Easy | Unstarted | Open |
| 21 | Linked List Cycle | Linked List | Easy | Unstarted | Open |
| 22 | Reorder List | Linked List | Medium | Unstarted | Open |
| 23 | Remove Nth Node From End of List | Linked List | Medium | Unstarted | Open |
| 24 | Merge K Sorted Lists | Linked List | Hard | Unstarted | Open |
| 25 | Invert Binary Tree | Trees | Easy | Unstarted | Open |
| 26 | Maximum Depth of Binary Tree | Trees | Easy | Unstarted | Open |
| 27 | Same Tree | Trees | Easy | Unstarted | Open |
| 28 | Subtree of Another Tree | Trees | Easy | Unstarted | Open |
| 29 | Lowest Common Ancestor of a Binary Search Tree | Trees | Medium | Unstarted | Open |
| 30 | Binary Tree Level Order Traversal | Trees | Medium | Unstarted | Open |
| 31 | Validate Binary Search Tree | Trees | Medium | Unstarted | Open |
| 32 | Kth Smallest Element In a Bst | Trees | Medium | Unstarted | Open |
| 33 | Construct Binary Tree From Preorder And Inorder Traversal | Trees | Medium | Unstarted | Open |
| 34 | Binary Tree Maximum Path Sum | Trees | Hard | Unstarted | Open |
| 35 | Serialize And Deserialize Binary Tree | Trees | Hard | Unstarted | Open |
| 36 | Find Median From Data Stream | Heap / Priority Queue | Hard | Unstarted | Open |
| 37 | Combination Sum | Backtracking | Medium | Unstarted | Open |
| 38 | Word Search | Backtracking | Medium | Unstarted | Open |
| 39 | Implement Trie Prefix Tree | Tries | Medium | Unstarted | Open |
| 40 | Design Add And Search Words Data Structure | Tries | Medium | Unstarted | Open |
| 41 | Word Search II | Tries | Hard | Unstarted | Open |
| 42 | Number of Islands | Graphs | Medium | Unstarted | Open |
| 43 | Clone Graph | Graphs | Medium | Unstarted | Open |
| 44 | Pacific Atlantic Water Flow | Graphs | Medium | Unstarted | Open |
| 45 | Course Schedule | Graphs | Medium | Unstarted | Open |
| 46 | Graph Valid Tree | Graphs | Medium | Unstarted | Open |
| 47 | Number of Connected Components In An Undirected Graph | Graphs | Medium | Unstarted | Open |
| 48 | Alien Dictionary | Advanced Graphs | Hard | Unstarted | Open |
| 49 | Climbing Stairs | 1-D Dynamic Programming | Easy | Unstarted | Open |
| 50 | House Robber | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 51 | House Robber II | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 52 | Longest Palindromic Substring | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 53 | Palindromic Substrings | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 54 | Decode Ways | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 55 | Coin Change | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 56 | Maximum Product Subarray | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 57 | Word Break | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 58 | Longest Increasing Subsequence | 1-D Dynamic Programming | Medium | Unstarted | Open |
| 59 | Unique Paths | 2-D Dynamic Programming | Medium | Unstarted | Open |
| 60 | Longest Common Subsequence | 2-D Dynamic Programming | Medium | Unstarted | Open |
| 61 | Maximum Subarray | Greedy | Medium | Unstarted | Open |
| 62 | Jump Game | Greedy | Medium | Unstarted | Open |
| 63 | Insert Interval | Intervals | Medium | Unstarted | Open |
| 64 | Merge Intervals | Intervals | Medium | Unstarted | Open |
| 65 | Non Overlapping Intervals | Intervals | Medium | Unstarted | Open |
| 66 | Meeting Rooms | Intervals | Easy | Unstarted | Open |
| 67 | Meeting Rooms II | Intervals | Medium | Unstarted | Open |
| 68 | Rotate Image | Math & Geometry | Medium | Unstarted | Open |
| 69 | Spiral Matrix | Math & Geometry | Medium | Unstarted | Open |
| 70 | Set Matrix Zeroes | Math & Geometry | Medium | Unstarted | Open |
| 71 | Number of 1 Bits | Bit Manipulation | Easy | Unstarted | Open |
| 72 | Counting Bits | Bit Manipulation | Easy | Unstarted | Open |
| 73 | Reverse Bits | Bit Manipulation | Easy | Unstarted | Open |
| 74 | Missing Number | Bit Manipulation | Easy | Unstarted | Open |
| 75 | Sum of Two Integers | Bit Manipulation | Medium | Unstarted | Open |