| Two Sum | Easy | Arrays | 1 |
| Contains Duplicate | Easy | Arrays | 1 |
| Best Time to Buy and Sell Stock | Easy | Arrays | 1 |
| Maximum Subarray | Easy | Arrays | 1 |
| Product of Array Except Self | Medium | Arrays | 1 |
| Move Zeroes | Easy | Arrays | 1 |
| Majority Element | Easy | Arrays | 1 |
| Can Place Flowers | Easy | Arrays | 1 |
| Concatenation of Array | Easy | Arrays | 1 |
| Find Pivot Index | Easy | Arrays | 1 |
| Find All Numbers Disappeared in An Array | Easy | Arrays | 1 |
| Is Subsequence | Easy | Arrays | 1 |
| Remove Element | Easy | Arrays | 1 |
| Find the Difference of Two Arrays | Easy | Arrays | 1 |
| Find The Index of The First Occurrence in a String | Easy | Arrays | 1 |
| Design HashSet | Easy | Arrays | 1 |
| Design HashMap | Easy | Arrays | 1 |
| Design Parking System | Easy | Arrays | 1 |
| Length of Last Word | Easy | Arrays | 1 |
| Isomorphic Strings | Easy | Arrays | 1 |
| Word Pattern | Easy | Arrays | 1 |
| Maximum Number of Balloons | Easy | Arrays | 1 |
| Sign of An Array | Easy | Arrays | 1 |
| Replace Elements With Greatest Element On Right Side | Easy | Arrays | 1 |
| Range Sum Query - Immutable | Easy | Arrays | 1 |
| Unique Email Addresses | Easy | Arrays | 1 |
| Pascals Triangle | Easy | Arrays | 1 |
| Pascal's Triangle | Easy | Arrays | 1 |
| Best Time to Buy And Sell Stock II | Medium | Arrays | 1 |
| Find Duplicate Number | Medium | Arrays | 1 |
| Maximum Product Subarray | Medium | Arrays | 1 |
| Longest Consecutive Sequence | Medium | Arrays | 1 |
| Rotate Array | Medium | Arrays | 1 |
| Sort Colors | Medium | Arrays | 1 |
| Majority Element II | Medium | Arrays | 1 |
| Continuous Subarray Sum | Medium | Arrays | 1 |
| Merge Intervals | Medium | Arrays | 1 |
| Insert Interval | Medium | Arrays | 1 |
| Subarray Sum Equals K | Medium | Arrays | 1 |
| Top K Frequent Elements | Medium | Arrays | 1 |
| Sort an Array | Medium | Arrays | 1 |
| Wiggle Sort | Medium | Arrays | 1 |
| Non Decreasing Array | Medium | Arrays | 1 |
| Number of Zero-Filled Subarrays | Medium | Arrays | 1 |
| Grid Game | Medium | Arrays | 1 |
| Repeated DNA Sequences | Medium | Arrays | 1 |
| Valid Sudoku | Medium | Arrays | 1 |
| Minimum Penalty for a Shop | Medium | Arrays | 1 |
| Next Permutation | Medium | Arrays | 1 |
| Find All Anagrams in a String | Medium | Arrays | 1 |
| Optimal Partition of String | Medium | Arrays | 1 |
| Number of Pairs of Interchangeable Rectangles | Medium | Arrays | 1 |
| Brick Wall | Medium | Arrays | 1 |
| Check if a String Contains all Binary Codes of Size K | Medium | Arrays | 1 |
| Minimum Number of Swaps to Make The String Balanced | Medium | Arrays | 1 |
| Insert Delete Get Random O(1) | Medium | Arrays | 1 |
| Encode and Decode TinyURL | Medium | Arrays | 1 |
| Design Underground System | Medium | Arrays | 1 |
| Unique Length 3 Palindromic Subsequences | Medium | Arrays | 1 |
| Maximum Product of The Length of Two Palindromic Subsequences | Medium | Arrays | 1 |
| Push Dominoes | Medium | Arrays | 1 |
| Range Sum Query 2D Immutable | Medium | Arrays | 1 |
| First Missing Positive | Hard | Arrays | 1 |
| Text Justification | Hard | Arrays | 1 |
| Naming a Company | Hard | Arrays | 1 |
| Find Minimum in Rotated Sorted Array | Medium | Binary Search | 1 |
| Search in Rotated Sorted Array | Medium | Binary Search | 1 |
| 3Sum | Medium | Two Pointers | 1 |
| Container With Most Water | Medium | Two Pointers | 1 |
| Valid Anagram | Easy | Strings | 1 |
| Group Anagrams | Medium | Strings | 1 |
| Valid Parentheses | Easy | Stack & Queue | 1 |
| Valid Palindrome | Easy | Two Pointers | 1 |
| Longest Substring Without Repeating Characters | Medium | Sliding Window | 1 |
| Rotate Image | Medium | Matrix | 1 |
| Spiral Matrix | Medium | Matrix | 1 |
| Search a 2D Matrix | Medium | Binary Search | 1 |
| Longest Palindromic Substring | Medium | Strings | 1 |
| Trapping Rain Water | Hard | Two Pointers | 1 |
| Minimum Window Substring | Hard | Sliding Window | 1 |
| Generate Parentheses | Medium | Stack & Queue | 1 |
| Min Stack | Medium | Stack & Queue | 1 |
| Reverse Linked List | Easy | Linked List | 1 |
| Merge Two Sorted Lists | Easy | Linked List | 1 |
| Add Two Numbers | Medium | Linked List | 1 |
| Copy List with Random Pointer | Medium | Linked List | 1 |
| LRU Cache | Medium | Linked List | 1 |
| Merge k Sorted Lists | Hard | Linked List | 1 |
| Subsets | Medium | Backtracking | 1 |
| Combination Sum | Medium | Backtracking | 1 |
| Permutations | Medium | Backtracking | 1 |
| Word Search | Medium | Backtracking | 1 |
| Letter Combinations of a Phone Number | Medium | Backtracking | 1 |
| Binary Tree Level Order Traversal | Medium | Binary Trees | 1 |
| Binary Tree Maximum Path Sum | Hard | Binary Trees | 1 |
| Lowest Common Ancestor of a BST | Medium | BST | 1 |
| Implement Trie (Prefix Tree) | Medium | Tries | 1 |
| Number of Islands | Medium | Graphs | 1 |
| Clone Graph | Medium | Graphs | 1 |
| Course Schedule | Medium | Graphs | 1 |
| Climbing Stairs | Easy | Dynamic Programming | 1 |
| House Robber | Medium | Dynamic Programming | 1 |
| Coin Change | Medium | Dynamic Programming | 1 |
| Word Break | Medium | Dynamic Programming | 1 |
| Longest Increasing Subsequence | Medium | Dynamic Programming | 1 |
| Longest Common Subsequence | Medium | Dynamic Programming | 1 |
| Unique Paths | Medium | Dynamic Programming | 1 |
| Maximal Square | Medium | Dynamic Programming | 1 |
| Jump Game | Medium | Greedy | 1 |
| Gas Station | Medium | Greedy | 1 |
| Meeting Rooms II | Medium | Greedy | 1 |
| Missing Number | Easy | Bit Manipulation | 1 |
| Single Number | Easy | Bit Manipulation | 1 |
| Number of 1 Bits | Easy | Bit Manipulation | 1 |
| Counting Bits | Easy | Bit Manipulation | 1 |
| Sum of Two Integers | Medium | Bit Manipulation | 1 |
| Pow(x, n) | Medium | Math | 1 |
| Linked List Cycle | Easy | Linked List | 1 |
| Remove Nth Node From End of List | Medium | Linked List | 1 |
| Reorder List | Medium | Linked List | 1 |
| Reverse Nodes in k-Group | Hard | Linked List | 1 |
| Invert Binary Tree | Easy | Binary Trees | 1 |
| Maximum Depth of Binary Tree | Easy | Binary Trees | 1 |
| Same Tree | Easy | Binary Trees | 1 |
| Balanced Binary Tree | Easy | Binary Trees | 1 |
| Validate Binary Search Tree | Medium | BST | 1 |
| Kth Smallest Element in a BST | Medium | BST | 1 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Binary Trees | 1 |
| Populating Next Right Pointers in Each Node | Medium | Binary Trees | 1 |
| Serialize and Deserialize Binary Tree | Hard | Binary Trees | 1 |
| Set Matrix Zeroes | Medium | Matrix | 1 |
| Encode and Decode Strings | Medium | Strings | 1 |
| Palindromic Substrings | Medium | Strings | 1 |
| Longest Repeating Character Replacement | Medium | Sliding Window | 1 |
| Permutation in String | Medium | Sliding Window | 1 |
| Sliding Window Maximum | Hard | Sliding Window | 1 |
| Evaluate Reverse Polish Notation | Medium | Stack & Queue | 1 |
| Largest Rectangle in Histogram | Hard | Stack & Queue | 1 |
| Find Median from Data Stream | Hard | Heaps | 1 |
| Design Add and Search Words Data Structure | Medium | Tries | 1 |
| Word Search II | Hard | Tries | 1 |
| Word Ladder | Hard | Graphs | 1 |
| Alien Dictionary | Hard | Graphs | 1 |
| Decode Ways | Medium | Dynamic Programming | 1 |
| Edit Distance | Medium | Dynamic Programming | 1 |
| Longest Increasing Path in a Matrix | Hard | Dynamic Programming | 1 |
| Best Time to Buy and Sell Stock III | Hard | Dynamic Programming | 1 |
| Regular Expression Matching | Hard | Dynamic Programming | 1 |
| Meeting Rooms | Easy | Greedy | 1 |
| Median of Two Sorted Arrays | Hard | Binary Search | 1 |