| | Remove Duplicates from Sorted Array | ArraysTwo Pointers | easy | 58% |
| | Best Time to Buy and Sell Stock | ArraysSliding Window | easy | 61% |
| | Two Sum | Arrays | easy | 57% |
| | Valid Palindrome | StringsTwo Pointers | easy | 56% |
| | Merge Sorted Array | ArraysTwo Pointers | easy | 55% |
| | Move Zeroes | ArraysTwo Pointers | easy | 67% |
| | Product of Array Except Self | Arrays | medium | 55% |
| | Container With Most Water | ArraysTwo Pointers | medium | 47% |
| | 3Sum | ArraysTwo Pointers | medium | 43% |
| | Longest Substring Without Repeating Characters | StringsSliding Window | medium | 42% |
| | Group Anagrams | StringsArrays | medium | 55% |
| | Longest Palindromic Substring | StringsTwo Pointers | medium | 42% |
| | Minimum Size Subarray Sum | ArraysSliding Window | medium | 48% |
| | String to Integer (atoi) | Strings | medium | 41% |
| | Zigzag Conversion | Strings | medium | 50% |
| | Find All Anagrams in a String | StringsSliding Window | medium | 52% |
| | Rotate Array | Arrays | medium | 43% |
| | Longest Repeating Character Replacement | StringsSliding Window | medium | 44% |
| | Permutation in String | StringsSliding Window | medium | 50% |
| | Next Permutation | ArraysTwo Pointers | medium | 44% |
| | Maximum Subarray | Arrays | medium | 52% |
| | Minimum Window Substring | StringsSliding Window | hard | 40% |
| | Substring with Concatenation of All Words | StringsSliding Window | hard | 36% |
| | First Missing Positive | Arrays | hard | 38% |
| | Sliding Window Maximum | ArraysSliding Window | hard | 42% |
| | Median of Two Sorted Arrays | ArraysTwo Pointers | hard | 37% |
| | Longest Valid Parentheses | StringsTwo Pointers | hard | 36% |
| | Smallest Window Containing All Characters | StringsSliding Window | hard | 38% |
| | Reverse Linked List | Linked List | easy | 69% |
| | Linked List Cycle | Linked List | easy | 59% |
| | Maximum Depth of Binary Tree | Binary Tree | easy | 70% |
| | Invert Binary Tree | Binary Tree | easy | 68% |
| | Palindrome Linked List | Linked List | easy | 56% |
| | Merge Two Sorted Lists | Linked List | medium | 52% |
| | Remove Nth Node From End of List | Linked List | medium | 46% |
| | Linked List Cycle II | Linked List | medium | 48% |
| | Add Two Numbers | Linked List | medium | 45% |
| | Validate Binary Search Tree | BSTBinary Tree | medium | 42% |
| | Lowest Common Ancestor of a Binary Tree | Binary Tree | medium | 53% |
| | Binary Tree Level Order Traversal | Binary Tree | medium | 55% |
| | Binary Tree Zigzag Level Order Traversal | Binary Tree | medium | 46% |
| | Path Sum II | Binary Tree | medium | 50% |
| | Kth Smallest Element in a BST | BST | medium | 49% |
| | Construct Binary Tree from Preorder and Inorder Traversal | Binary Tree | medium | 54% |
| | Flatten Binary Tree to Linked List | Binary TreeLinked List | medium | 54% |
| | Copy List with Random Pointer | Linked List | hard | 43% |
| | Lowest Common Ancestor of a BST | BST | medium | 51% |
| | Sort List | Linked List | hard | 40% |
| | Binary Tree Right Side View | Binary Tree | medium | 52% |
| | Swap Nodes in Pairs | Linked List | medium | 52% |
| | Binary Tree Maximum Path Sum | Binary Tree | hard | 37% |
| | Serialize and Deserialize Binary Tree | Binary Tree | hard | 44% |
| | Reverse Nodes in k-Group | Linked List | hard | 43% |
| | Binary Tree Cameras | Binary Tree | hard | 38% |
| | Recover Binary Search Tree | BSTBinary Tree | hard | 40% |
| | House Robber | Dynamic Programming | medium | 48% |
| | Climbing Stairs | Dynamic Programming | easy | 62% |
| | Longest Increasing Subsequence | Dynamic ProgrammingBinary Search | medium | 47% |
| | Word Break | Dynamic Programming | medium | 45% |
| | Edit Distance | Dynamic Programming | hard | 43% |
| | Unique Paths | Dynamic Programming | medium | 55% |
| | Jump Game | Dynamic Programming | medium | 43% |
| | Decode Ways | Dynamic Programming | hard | 36% |
| | Longest Common Subsequence | Dynamic Programming | medium | 51% |
| | Coin Change | Dynamic Programming | medium | 43% |
| | Palindrome Partitioning II | Dynamic Programming | hard | 36% |
| | Burst Balloons | Dynamic Programming | hard | 43% |
| | Regular Expression Matching | Dynamic Programming | hard | 36% |
| | Longest Palindromic Subsequence | Dynamic Programming | medium | 51% |
| | Maximum Product Subarray | Dynamic Programming | hard | 37% |
| | Partition Equal Subset Sum | Dynamic Programming | medium | 47% |
| | Wildcard Matching | Dynamic Programming | hard | 36% |
| | Min Cost Climbing Stairs | Dynamic Programming | easy | 60% |
| | Search in Rotated Sorted Array | Binary Search | medium | 42% |
| | Find Peak Element | Binary Search | medium | 47% |
| | Koko Eating Bananas | Binary Search | medium | 49% |
| | Split Array Largest Sum | Binary SearchDynamic Programming | hard | 44% |
| | Find Minimum in Rotated Sorted Array | Binary Search | medium | 48% |
| | Search a 2D Matrix | Binary Search | easy | 57% |
| | Capacity To Ship Packages Within D Days | Binary Search | medium | 54% |
| | Find First and Last Position of Element in Sorted Array | Binary Search | easy | 56% |
| | Interleaving String | Dynamic Programming | hard | 39% |
| | Clone Graph | GraphsBFS+1 | medium | 50% |
| | Pacific Atlantic Water Flow | GraphsBFS+1 | medium | 49% |
| | Rotting Oranges | GraphsBFS | medium | 51% |
| | Walls and Gates | GraphsBFS | medium | 53% |
| | Shortest Path in Binary Matrix | GraphsBFS | medium | 44% |
| | Open the Lock | GraphsBFS | hard | 41% |
| | Network Delay Time | GraphsBFS | medium | 50% |
| | Cheapest Flights Within K Stops | GraphsBFS+1 | hard | 40% |
| | Word Ladder | GraphsBFS | hard | 38% |
| | Surrounded Regions | GraphsDFS+1 | medium | 42% |
| | Graph Valid Tree | GraphsUnion Find+1 | medium | 46% |
| | Number of Connected Components in an Undirected Graph | GraphsUnion Find+1 | easy | 60% |
| | Accounts Merge | GraphsUnion Find+1 | medium | 49% |
| | Redundant Connection | GraphsUnion Find | medium | 53% |
| | Course Schedule | GraphsTopological Sort+1 | medium | 47% |
| | Course Schedule II | GraphsTopological Sort+1 | medium | 46% |
| | Reconstruct Itinerary | GraphsDFS | hard | 40% |
| | Critical Connections in a Network | GraphsDFS | hard | 44% |
| | Swim in Rising Water | GraphsBFS+1 | hard | 43% |
| | Find Eventual Safe States | GraphsDFS+1 | easy | 58% |
| | Alien Dictionary | GraphsTopological Sort | hard | 37% |
| | Longest Increasing Path in a Matrix | GraphsDFS+1 | hard | 42% |
| | Min Stack | StackDesign | medium | 48% |
| | Valid Parentheses | StackString | easy | 58% |
| | Evaluate Reverse Polish Notation | StackMath | medium | 46% |
| | Daily Temperatures | StackMonotonic Stack+1 | medium | 50% |
| | Next Greater Element I | StackMonotonic Stack+1 | easy | 60% |
| | Asteroid Collision | StackArray+1 | medium | 47% |
| | Decode String | StackString+1 | medium | 49% |
| | Online Stock Span | StackMonotonic Stack+1 | medium | 52% |
| | Basic Calculator | StackMath+1 | hard | 38% |
| | Largest Rectangle in Histogram | StackMonotonic Stack+1 | hard | 40% |
| | Trapping Rain Water | StackMonotonic Stack+1 | hard | 43% |
| | Implement Queue using Stacks | StackQueue+1 | easy | 63% |
| | Top K Frequent Elements | HeapHash Table+1 | medium | 50% |
| | Kth Largest Element in an Array | HeapSorting+1 | medium | 48% |
| | Merge K Sorted Lists | HeapLinked List+1 | hard | 41% |
| | Task Scheduler | HeapGreedy+1 | medium | 44% |
| | Reorganize String | HeapGreedy+1 | medium | 42% |
| | Find Median from Data Stream | HeapDesign+1 | hard | 39% |
| | Implement Trie (Prefix Tree) | TrieDesign+1 | medium | 53% |
| | Design Add and Search Words Data Structure | TrieDFS+2 | hard | 40% |
| | Word Search II | TrieBacktracking+1 | hard | 37% |
| | Map Sum Pairs | TrieHash Table+1 | medium | 47% |
| | Implement Stack using Queues | StackQueue+1 | easy | 57% |
| | Next Greater Element II | StackMonotonic Stack+1 | medium | 48% |
| | Subsets | BacktrackingArrays | medium | 54% |
| | Permutations | BacktrackingArrays | medium | 53% |
| | Combination Sum | BacktrackingArrays | medium | 51% |
| | N-Queens | BacktrackingMatrix | hard | 44% |
| | Letter Combinations of a Phone Number | BacktrackingStrings | medium | 48% |
| | Palindrome Partitioning | BacktrackingStrings | hard | 42% |
| | Generate Parentheses | BacktrackingStrings | medium | 52% |
| | Sort Colors | SortingArrays+1 | medium | 48% |
| | Merge Sort - Count Inversions | SortingDivide and Conquer | hard | 38% |
| | Meeting Rooms II | IntervalsSorting+1 | medium | 45% |
| | Non-overlapping Intervals | IntervalsGreedy+1 | medium | 43% |
| | Insert Interval | IntervalsArrays | hard | 36% |
| | Single Number | Bit ManipulationArrays | easy | 67% |
| | Counting Bits | Bit ManipulationDynamic Programming | easy | 65% |
| | Reverse Bits | Bit Manipulation | easy | 55% |
| | Number of 1 Bits | Bit Manipulation | easy | 62% |
| | Power of Two | Bit ManipulationMath | medium | 43% |
| | Missing Number | Bit ManipulationMath+1 | medium | 44% |
| | Gas Station | GreedyArrays | medium | 43% |
| | Jump Game II | GreedyArrays | hard | 37% |
| | Partition Labels | GreedyStrings+1 | medium | 54% |
| | Candy | GreedyArrays | hard | 36% |
| | Merge Intervals | IntervalsSorting+1 | hard | 41% |