Bloomberg LeetCode Questions
1200 questions all-time · 395 easy · 645 medium · 160 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Two Sum Array, Hash Table | Easy | 100 | 0.6% |
| 2 | Merge Intervals Array, Sorting | Medium | 87 | 0.5% |
| 3 | Add Two Numbers Linked List, Math, Recursion | Medium | 85 | 0.5% |
| 4 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 85 | 0.4% |
| 5 | Valid Parentheses String, Stack | Easy | 85 | 0.4% |
| 6 | Insert Delete GetRandom O(1) Array, Hash Table, Math, Design, Randomized | Medium | 85 | 0.6% |
| 7 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 84 | 0.6% |
| 8 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 84 | 0.6% |
| 9 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 81 | 0.7% |
| 10 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 80 | 0.4% |
| 11 | 3Sum Array, Two Pointers, Sorting | Medium | 79 | 0.4% |
| 12 | Invalid Transactions Array, Hash Table, String, Sorting | Medium | 79 | 0.3% |
| 13 | Longest Common Prefix Array, String, Trie | Easy | 79 | 0.5% |
| 14 | Flatten a Multilevel Doubly Linked List Linked List, Depth-First Search, Doubly-Linked List | Medium | 79 | 0.6% |
| 15 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 78 | 0.5% |
| 16 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 77 | 0.5% |
| 17 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 76 | 0.7% |
| 18 | Reverse Integer Math | Medium | 76 | 0.3% |
| 19 | Container With Most Water Array, Two Pointers, Greedy | Medium | 76 | 0.6% |
| 20 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 75 | 0.6% |
| 21 | Decode String String, Stack, Recursion | Medium | 75 | 0.6% |
| 22 | Valid Anagram Hash Table, String, Sorting | Easy | 75 | 0.7% |
| 23 | Remove Duplicates from Sorted Array Array, Two Pointers | Easy | 73 | 0.6% |
| 24 | Palindrome Number Math | Easy | 73 | 0.6% |
| 25 | Merge Two Sorted Lists Linked List, Recursion | Easy | 72 | 0.7% |
| 26 | Roman to Integer Hash Table, Math, String | Easy | 72 | 0.7% |
| 27 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 72 | 0.5% |
| 28 | Longest Consecutive Sequence Array, Hash Table, Union-Find | Medium | 72 | 0.5% |
| 29 | Subarray Sum Equals K Array, Hash Table, Prefix Sum | Medium | 72 | 0.5% |
| 30 | Design Underground System Hash Table, String, Design | Medium | 72 | 0.7% |
| 31 | Search in Rotated Sorted Array Array, Binary Search | Medium | 71 | 0.5% |
| 32 | Min Stack Stack, Design | Medium | 71 | 0.6% |
| 33 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 71 | 0.5% |
| 34 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 70 | 0.7% |
| 35 | Subsets Array, Backtracking, Bit Manipulation | Medium | 70 | 0.8% |
| 36 | Next Permutation Array, Two Pointers | Medium | 69 | 0.5% |
| 37 | Move Zeroes Array, Two Pointers | Easy | 68 | 0.6% |
| 38 | First Unique Character in a String Hash Table, String, Queue, Counting | Easy | 68 | 0.7% |
| 39 | Rotate Image Array, Math, Matrix | Medium | 67 | 0.8% |
| 40 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 66 | 0.8% |
| 41 | Climbing Stairs Math, Dynamic Programming, Memoization | Easy | 66 | 0.5% |
| 42 | Rotate Array Array, Math, Two Pointers | Medium | 66 | 0.5% |
| 43 | Validate Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 65 | 0.4% |
| 44 | Find Peak Element Array, Binary Search | Medium | 65 | 0.5% |
| 45 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 65 | 0.5% |
| 46 | Reverse Linked List Linked List, Recursion | Easy | 65 | 0.8% |
| 47 | Number of Ships in a Rectangle Array, Divide and Conquer, Interactive | Hard | 65 | 0.7% |
| 48 | Word Break II Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization | Hard | 64 | 0.6% |
| 49 | Create Hello World Function | Easy | 64 | 0.8% |
| 50 | Valid Palindrome Two Pointers, String | Easy | 63 | 0.5% |
| 51 | Koko Eating Bananas Array, Binary Search | Medium | 63 | 0.5% |
| 52 | String to Integer (atoi) String | Medium | 63 | 0.2% |
| 53 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 63 | 0.5% |
| 54 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 63 | 0.5% |
| 55 | Sqrt(x) Math, Binary Search | Easy | 63 | 0.4% |
| 56 | Pascal's Triangle Array, Dynamic Programming | Easy | 63 | 0.8% |
| 57 | Single Number Array, Bit Manipulation | Easy | 63 | 0.8% |
| 58 | Longest Repeating Character Replacement Hash Table, String, Sliding Window | Medium | 63 | 0.6% |
| 59 | 4Sum Array, Two Pointers, Sorting | Medium | 62 | 0.4% |
| 60 | Jump Game Array, Dynamic Programming, Greedy | Medium | 62 | 0.4% |
| 61 | Contains Duplicate Array, Hash Table, Sorting | Easy | 62 | 0.6% |
| 62 | Sort Integers by The Power Value Dynamic Programming, Memoization, Sorting | Medium | 62 | 0.7% |
| 63 | Pow(x, n) Math, Recursion | Medium | 62 | 0.4% |
| 64 | Sort Colors Array, Two Pointers, Sorting | Medium | 61 | 0.7% |
| 65 | Remove Element Array, Two Pointers | Easy | 61 | 0.6% |
| 66 | Single Element in a Sorted Array Array, Binary Search | Medium | 61 | 0.6% |
| 67 | All Paths From Source to Target Backtracking, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 61 | 0.8% |
| 68 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path | Medium | 60 | 0.6% |
| 69 | Check if Array Is Sorted and Rotated Array | Easy | 60 | 0.6% |
| 70 | Plus One Array, Math | Easy | 60 | 0.5% |
| 71 | Remove All Adjacent Duplicates in String II String, Stack | Medium | 60 | 0.6% |
| 72 | Spiral Matrix Array, Matrix, Simulation | Medium | 59 | 0.6% |
| 73 | Palindrome Partitioning String, Dynamic Programming, Backtracking | Medium | 59 | 0.7% |
| 74 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 59 | 0.5% |
| 75 | House Robber Array, Dynamic Programming | Medium | 59 | 0.5% |
| 76 | Product of Array Except Self Array, Prefix Sum | Medium | 59 | 0.7% |
| 77 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 58 | 0.6% |
| 78 | Find the Index of the First Occurrence in a String Two Pointers, String, String Matching | Easy | 58 | 0.5% |
| 79 | Binary Tree Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 58 | 0.7% |
| 80 | Two City Scheduling Array, Greedy, Sorting | Medium | 58 | 0.7% |
| 81 | Remove Letter To Equalize Frequency Hash Table, String, Counting | Easy | 58 | 0.2% |
| 82 | Search Insert Position Array, Binary Search | Easy | 58 | 0.5% |
| 83 | Design an Ordered Stream Array, Hash Table, Design, Data Stream | Easy | 58 | 0.8% |
| 84 | Combine Two Tables Database | Easy | 57 | 0.8% |
| 85 | Palindrome Linked List Linked List, Two Pointers, Stack, Recursion | Easy | 57 | 0.6% |
| 86 | Binary Tree Vertical Order Traversal Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Medium | 57 | 0.6% |
| 87 | Max Consecutive Ones Array | Easy | 57 | 0.7% |
| 88 | Minimum Remove to Make Valid Parentheses String, Stack | Medium | 57 | 0.7% |
| 89 | Set Matrix Zeroes Array, Hash Table, Matrix | Medium | 57 | 0.6% |
| 90 | Reverse Words in a String Two Pointers, String | Medium | 57 | 0.6% |
| 91 | Next Greater Element I Array, Hash Table, Stack, Monotonic Stack | Easy | 57 | 0.8% |
| 92 | Zigzag Conversion String | Medium | 56 | 0.5% |
| 93 | 3Sum Closest Array, Two Pointers, Sorting | Medium | 56 | 0.5% |
| 94 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 55 | 0.7% |
| 95 | Copy List with Random Pointer Hash Table, Linked List | Medium | 55 | 0.6% |
| 96 | Linked List Cycle Hash Table, Linked List, Two Pointers | Easy | 55 | 0.5% |
| 97 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 55 | 0.7% |
| 98 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 55 | 0.6% |
| 99 | Recyclable and Low Fat Products Database | Easy | 55 | 0.9% |
| 100 | Unique Paths Math, Dynamic Programming, Combinatorics | Medium | 55 | 0.7% |
| 101 | Search a 2D Matrix Array, Binary Search, Matrix | Medium | 55 | 0.5% |
| 102 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 55 | 0.5% |
| 103 | Symmetric Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 55 | 0.6% |
| 104 | Balanced Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 55 | 0.6% |
| 105 | Isomorphic Strings Hash Table, String | Easy | 55 | 0.5% |
| 106 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 55 | 0.7% |
| 107 | Vertical Order Traversal of a Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Hard | 55 | 0.5% |
| 108 | N-Queens Array, Backtracking | Hard | 54 | 0.8% |
| 109 | Rotate List Linked List, Two Pointers | Medium | 54 | 0.4% |
| 110 | Gas Station Array, Greedy | Medium | 54 | 0.5% |
| 111 | Candy Array, Greedy | Hard | 54 | 0.5% |
| 112 | Reorder List Linked List, Two Pointers, Stack, Recursion | Medium | 54 | 0.7% |
| 113 | String Compression Two Pointers, String | Medium | 54 | 0.6% |
| 114 | Number of Provinces Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 54 | 0.7% |
| 115 | Valid Triangle Number Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 54 | 0.6% |
| 116 | Binary Search Array, Binary Search | Easy | 54 | 0.6% |
| 117 | Letter Combinations of a Phone Number Hash Table, String, Backtracking | Medium | 54 | 0.7% |
| 118 | Valid Sudoku Array, Hash Table, Matrix | Medium | 54 | 0.6% |
| 119 | Contains Duplicate II Array, Hash Table, Sliding Window | Easy | 54 | 0.5% |
| 120 | Missing Number Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | Easy | 54 | 0.7% |
| 121 | Managers with at Least 5 Direct Reports Database | Medium | 54 | 0.5% |
| 122 | Combination Sum Array, Backtracking | Medium | 53 | 0.8% |
| 123 | Add Binary Math, String, Bit Manipulation, Simulation | Easy | 53 | 0.6% |
| 124 | Construct Binary Tree from Preorder and Inorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 53 | 0.7% |
| 125 | Count Unhappy Friends Array, Simulation | Medium | 53 | 0.6% |
| 126 | Merge Strings Alternately Two Pointers, String | Easy | 53 | 0.8% |
| 127 | Swap Nodes in Pairs Linked List, Recursion | Medium | 52 | 0.7% |
| 128 | Length of Last Word String | Easy | 52 | 0.6% |
| 129 | Same Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 52 | 0.7% |
| 130 | Populating Next Right Pointers in Each Node Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 52 | 0.7% |
| 131 | Maximum Product Subarray Array, Dynamic Programming | Medium | 52 | 0.4% |
| 132 | Find the Duplicate Number Array, Two Pointers, Binary Search, Bit Manipulation | Medium | 52 | 0.6% |
| 133 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 52 | 0.6% |
| 134 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 52 | 0.7% |
| 135 | Intersection of Two Arrays Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 52 | 0.8% |
| 136 | Add Two Numbers II Linked List, Math, Stack | Medium | 52 | 0.6% |
| 137 | Design A Leaderboard Hash Table, Design, Sorting | Medium | 52 | 0.7% |
| 138 | Frequency of the Most Frequent Element Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 52 | 0.4% |
| 139 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 51 | 0.5% |
| 140 | Reverse String Two Pointers, String | Easy | 51 | 0.8% |
| 141 | Lexicographical Numbers Depth-First Search, Trie | Medium | 51 | 0.8% |
| 142 | Number of Recent Calls Design, Queue, Data Stream | Easy | 51 | 0.8% |
| 143 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 51 | 0.3% |
| 144 | Integer to Roman Hash Table, Math, String | Medium | 51 | 0.7% |
| 145 | Remove Nth Node From End of List Linked List, Two Pointers | Medium | 51 | 0.5% |
| 146 | Binary Tree Zigzag Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 51 | 0.6% |
| 147 | Kth Smallest Element in a BST Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 51 | 0.8% |
| 148 | Find the Winner of the Circular Game Array, Math, Recursion, Queue, Simulation | Medium | 51 | 0.8% |
| 149 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 50 | 0.4% |
| 150 | Permutations Array, Backtracking | Medium | 50 | 0.8% |
| 151 | Unique Paths II Array, Dynamic Programming, Matrix | Medium | 50 | 0.4% |
| 152 | Edit Distance String, Dynamic Programming | Medium | 50 | 0.6% |
| 153 | Minimum Size Subarray Sum Array, Binary Search, Sliding Window, Prefix Sum | Medium | 50 | 0.5% |
| 154 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 50 | 0.5% |
| 155 | H-Index Array, Sorting, Counting Sort | Medium | 50 | 0.4% |
| 156 | Next Greater Element II Array, Stack, Monotonic Stack | Medium | 50 | 0.7% |
| 157 | Fibonacci Number Math, Dynamic Programming, Recursion, Memoization | Easy | 50 | 0.7% |
| 158 | Remove Duplicates from Sorted List Linked List | Easy | 49 | 0.6% |
| 159 | Populating Next Right Pointers in Each Node II Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 49 | 0.6% |
| 160 | Two Sum II - Input Array Is Sorted Array, Two Pointers, Binary Search | Medium | 49 | 0.7% |
| 161 | Happy Number Hash Table, Math, Two Pointers | Easy | 49 | 0.6% |
| 162 | Peak Index in a Mountain Array Array, Binary Search | Medium | 49 | 0.7% |
| 163 | Capacity To Ship Packages Within D Days Array, Binary Search | Medium | 49 | 0.7% |
| 164 | Design Browser History Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream | Medium | 49 | 0.8% |
| 165 | Wildcard Matching String, Dynamic Programming, Greedy, Recursion | Hard | 48 | 0.3% |
| 166 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 48 | 0.7% |
| 167 | Lowest Common Ancestor of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 48 | 0.7% |
| 168 | Reverse Vowels of a String Two Pointers, String | Easy | 48 | 0.6% |
| 169 | Rotate String String, String Matching | Easy | 48 | 0.7% |
| 170 | Reverse Nodes in k-Group Linked List, Recursion | Hard | 47 | 0.7% |
| 171 | Subsets II Array, Backtracking, Bit Manipulation | Medium | 47 | 0.6% |
| 172 | Evaluate Reverse Polish Notation Array, Math, Stack | Medium | 47 | 0.6% |
| 173 | Rising Temperature Database | Easy | 47 | 0.5% |
| 174 | Lowest Common Ancestor of a Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 47 | 0.7% |
| 175 | Odd Even Linked List Linked List | Medium | 47 | 0.6% |
| 176 | Partition Equal Subset Sum Array, Dynamic Programming | Medium | 47 | 0.5% |
| 177 | Maximum Nesting Depth of the Parentheses String, Stack | Easy | 47 | 0.8% |
| 178 | Average Time of Process per Machine Database | Easy | 47 | 0.7% |
| 179 | Intersection of Two Linked Lists Hash Table, Linked List, Two Pointers | Easy | 46 | 0.6% |
| 180 | Delete Node in a Linked List Linked List | Medium | 46 | 0.8% |
| 181 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 46 | 0.6% |
| 182 | Top K Frequent Words Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting | Medium | 46 | 0.6% |
| 183 | Online Stock Span Stack, Design, Monotonic Stack, Data Stream | Medium | 46 | 0.7% |
| 184 | Sort an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sort | Medium | 46 | 0.6% |
| 185 | Minimum Number of Steps to Make Two Strings Anagram Hash Table, String, Counting | Medium | 46 | 0.8% |
| 186 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 45 | 0.7% |
| 187 | Maximum Depth of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 45 | 0.8% |
| 188 | Triangle Array, Dynamic Programming | Medium | 45 | 0.6% |
| 189 | Factorial Trailing Zeroes Math | Medium | 45 | 0.5% |
| 190 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 45 | 0.5% |
| 191 | Majority Element II Array, Hash Table, Sorting, Counting | Medium | 45 | 0.6% |
| 192 | Power of Two Math, Bit Manipulation, Recursion | Easy | 45 | 0.5% |
| 193 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 45 | 0.6% |
| 194 | Diameter of Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 45 | 0.7% |
| 195 | Big Countries Database | Easy | 45 | 0.7% |
| 196 | Article Views I Database | Easy | 45 | 0.8% |
| 197 | Second Highest Salary Database | Medium | 45 | 0.5% |
| 198 | Find Missing and Repeated Values Array, Hash Table, Math, Matrix | Easy | 45 | 0.8% |
| 199 | Divide Two Integers Math, Bit Manipulation | Medium | 44 | 0.2% |
| 200 | Combination Sum II Array, Backtracking | Medium | 44 | 0.6% |
| 201 | Search in Rotated Sorted Array II Array, Binary Search | Medium | 44 | 0.4% |
| 202 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 44 | 0.4% |
| 203 | Reverse Pairs Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 44 | 0.3% |
| 204 | Max Consecutive Ones III Array, Binary Search, Sliding Window, Prefix Sum | Medium | 44 | 0.7% |
| 205 | Monthly Transactions I Database | Medium | 44 | 0.6% |
| 206 | Fruit Into Baskets Array, Hash Table, Sliding Window | Medium | 44 | 0.5% |
| 207 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 43 | 0.4% |
| 208 | Remove Duplicates from Sorted Array II Array, Two Pointers | Medium | 43 | 0.6% |
| 209 | Largest Number Array, String, Greedy, Sorting | Medium | 43 | 0.4% |
| 210 | Employees Earning More Than Their Managers Database | Easy | 43 | 0.7% |
| 211 | Remove Linked List Elements Linked List, Recursion | Easy | 43 | 0.5% |
| 212 | Implement Queue using Stacks Stack, Design, Queue | Easy | 43 | 0.7% |
| 213 | Maximum Average Subarray I Array, Sliding Window | Easy | 43 | 0.5% |
| 214 | Implement Magic Dictionary Hash Table, String, Depth-First Search, Design, Trie | Medium | 43 | 0.6% |
| 215 | Middle of the Linked List Linked List, Two Pointers | Easy | 43 | 0.8% |
| 216 | Squares of a Sorted Array Array, Two Pointers, Sorting | Easy | 43 | 0.7% |
| 217 | Minimum Number of Days to Make m Bouquets Array, Binary Search | Medium | 43 | 0.6% |
| 218 | Students and Examinations Database | Easy | 43 | 0.6% |
| 219 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 42 | 0.5% |
| 220 | Surrounded Regions Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 42 | 0.5% |
| 221 | Binary Tree Right Side View Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 42 | 0.7% |
| 222 | Count Primes Array, Math, Enumeration, Number Theory | Medium | 42 | 0.4% |
| 223 | Implement Stack using Queues Stack, Design, Queue | Easy | 42 | 0.7% |
| 224 | Search a 2D Matrix II Array, Binary Search, Divide and Conquer, Matrix | Medium | 42 | 0.6% |
| 225 | Add Digits Math, Simulation, Number Theory | Easy | 42 | 0.7% |
| 226 | Sort Characters By Frequency Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting | Medium | 42 | 0.8% |
| 227 | Next Greater Element III Math, Two Pointers, String | Medium | 42 | 0.4% |
| 228 | Binary Subarrays With Sum Array, Hash Table, Sliding Window, Prefix Sum | Medium | 42 | 0.7% |
| 229 | Minimum Absolute Difference Array, Sorting | Easy | 42 | 0.8% |
| 230 | Average Selling Price Database | Easy | 42 | 0.4% |
| 231 | Concatenation of Array Array, Simulation | Easy | 42 | 0.9% |
| 232 | Rearrange Array Elements by Sign Array, Two Pointers, Simulation | Medium | 42 | 0.8% |
| 233 | First Missing Positive Array, Hash Table | Hard | 40 | 0.4% |
| 234 | Remove Duplicates from Sorted List II Linked List, Two Pointers | Medium | 40 | 0.5% |
| 235 | Maximal Rectangle Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Hard | 40 | 0.6% |
| 236 | Binary Tree Inorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 40 | 0.8% |
| 237 | Sort List Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort | Medium | 40 | 0.6% |
| 238 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 40 | 0.6% |
| 239 | House Robber II Array, Dynamic Programming | Medium | 40 | 0.5% |
| 240 | Remove K Digits String, Stack, Greedy, Monotonic Stack | Medium | 40 | 0.4% |
| 241 | Arranging Coins Math, Binary Search | Easy | 40 | 0.5% |
| 242 | Permutation in String Hash Table, Two Pointers, String, Sliding Window | Medium | 40 | 0.5% |
| 243 | Kill Process Array, Hash Table, Tree, Depth-First Search, Breadth-First Search | Medium | 40 | 0.7% |
| 244 | Asteroid Collision Array, Stack, Simulation | Medium | 40 | 0.5% |
| 245 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 40 | 0.5% |
| 246 | Sort Array by Increasing Frequency Array, Hash Table, Sorting | Easy | 40 | 0.8% |
| 247 | Flatten Binary Tree to Linked List Linked List, Stack, Tree, Depth-First Search, Binary Tree | Medium | 40 | 0.7% |
| 248 | Diagonal Traverse Array, Matrix, Simulation | Medium | 40 | 0.7% |
| 249 | Path Sum II Backtracking, Tree, Depth-First Search, Binary Tree | Medium | 39 | 0.6% |
| 250 | Linked List Cycle II Hash Table, Linked List, Two Pointers | Medium | 39 | 0.6% |
| 251 | Perfect Squares Math, Dynamic Programming, Breadth-First Search | Medium | 39 | 0.6% |
| 252 | Ransom Note Hash Table, String, Counting | Easy | 39 | 0.7% |
| 253 | Fizz Buzz Math, String, Simulation | Easy | 39 | 0.8% |
| 254 | Non-overlapping Intervals Array, Dynamic Programming, Greedy, Sorting | Medium | 39 | 0.6% |
| 255 | Contiguous Array Array, Hash Table, Prefix Sum | Medium | 39 | 0.5% |
| 256 | Best Time to Buy and Sell Stock with Transaction Fee Array, Dynamic Programming, Greedy | Medium | 39 | 0.7% |
| 257 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 39 | 0.6% |
| 258 | Sum of Subarray Minimums Array, Dynamic Programming, Stack, Monotonic Stack | Medium | 39 | 0.4% |
| 259 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 39 | 0.5% |
| 260 | Kth Missing Positive Number Array, Binary Search | Easy | 39 | 0.6% |
| 261 | Add Two Integers Math | Easy | 39 | 0.9% |
| 262 | Number of Digit One Math, Dynamic Programming, Recursion | Hard | 39 | 0.4% |
| 263 | Simplify Path String, Stack | Medium | 38 | 0.5% |
| 264 | Single Number II Array, Bit Manipulation | Medium | 38 | 0.7% |
| 265 | Basic Calculator Math, String, Stack, Recursion | Hard | 38 | 0.5% |
| 266 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 38 | 0.5% |
| 267 | Increasing Triplet Subsequence Array, Greedy | Medium | 38 | 0.4% |
| 268 | Reverse String II Two Pointers, String | Easy | 38 | 0.5% |
| 269 | Employee Bonus Database | Easy | 38 | 0.8% |
| 270 | Trim a Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 38 | 0.7% |
| 271 | Subarray Sums Divisible by K Array, Hash Table, Prefix Sum | Medium | 38 | 0.6% |
| 272 | Cousins in Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 38 | 0.6% |
| 273 | Immediate Food Delivery II Database | Medium | 38 | 0.6% |
| 274 | Even Odd Tree Tree, Breadth-First Search, Binary Tree | Medium | 38 | 0.7% |
| 275 | Shortest Palindrome String, Rolling Hash, String Matching, Hash Function | Hard | 38 | 0.4% |
| 276 | Find All Anagrams in a String Hash Table, String, Sliding Window | Medium | 38 | 0.5% |
| 277 | Maximum Sum of Distinct Subarrays With Length K Array, Hash Table, Sliding Window | Medium | 38 | 0.4% |
| 278 | Reordered Power of 2 Hash Table, Math, Sorting, Counting, Enumeration | Medium | 38 | 0.7% |
| 279 | Count and Say String | Medium | 36 | 0.6% |
| 280 | Reverse Linked List II Linked List | Medium | 36 | 0.5% |
| 281 | Minimum Depth of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 36 | 0.5% |
| 282 | Find Minimum in Rotated Sorted Array Array, Binary Search | Medium | 36 | 0.5% |
| 283 | Consecutive Numbers Database | Medium | 36 | 0.5% |
| 284 | First Bad Version Binary Search, Interactive | Easy | 36 | 0.5% |
| 285 | Design Hit Counter Array, Binary Search, Design, Queue, Data Stream | Medium | 36 | 0.7% |
| 286 | Is Subsequence Two Pointers, String, Dynamic Programming | Easy | 36 | 0.5% |
| 287 | Assign Cookies Array, Two Pointers, Greedy, Sorting | Easy | 36 | 0.6% |
| 288 | Target Sum Array, Dynamic Programming, Backtracking | Medium | 36 | 0.5% |
| 289 | Shortest Path to Get Food Array, Breadth-First Search, Matrix | Medium | 36 | 0.6% |
| 290 | Find Customer Referee Database | Easy | 36 | 0.7% |
| 291 | Remove Outermost Parentheses String, Stack | Easy | 36 | 0.9% |
| 292 | Find in Mountain Array Array, Binary Search, Interactive | Hard | 36 | 0.4% |
| 293 | Queries Quality and Percentage Database | Easy | 36 | 0.5% |
| 294 | Replace Employee ID With The Unique Identifier Database | Easy | 36 | 0.8% |
| 295 | Dot Product of Two Sparse Vectors Array, Hash Table, Two Pointers, Design | Medium | 36 | 0.9% |
| 296 | Count Good Numbers Math, Recursion | Medium | 36 | 0.6% |
| 297 | Confirmation Rate Database | Medium | 36 | 0.6% |
| 298 | Partition Array Into Two Arrays to Minimize Sum Difference Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask | Hard | 36 | 0.2% |
| 299 | Product Price at a Given Date Database | Medium | 36 | 0.6% |
| 300 | Maximum Swap Math, Greedy | Medium | 36 | 0.5% |
| 301 | Substring with Concatenation of All Words Hash Table, String, Sliding Window | Hard | 34 | 0.3% |
| 302 | Permutations II Array, Backtracking, Sorting | Medium | 34 | 0.6% |
| 303 | Combinations Backtracking | Medium | 34 | 0.7% |
| 304 | Partition List Linked List, Two Pointers | Medium | 34 | 0.6% |
| 305 | Read N Characters Given read4 II - Call Multiple Times Array, Simulation, Interactive | Hard | 34 | 0.4% |
| 306 | Customers Who Never Order Database | Easy | 34 | 0.7% |
| 307 | Repeated DNA Sequences Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function | Medium | 34 | 0.5% |
| 308 | Basic Calculator II Math, String, Stack | Medium | 34 | 0.5% |
| 309 | Summary Ranges Array | Easy | 34 | 0.5% |
| 310 | Palindrome Permutation Hash Table, String, Bit Manipulation | Easy | 34 | 0.7% |
| 311 | Range Sum Query - Immutable Array, Design, Prefix Sum | Easy | 34 | 0.7% |
| 312 | Sparse Matrix Multiplication Array, Hash Table, Matrix | Medium | 34 | 0.7% |
| 313 | Find the Difference Hash Table, String, Bit Manipulation, Sorting | Easy | 34 | 0.6% |
| 314 | Delete Node in a BST Tree, Binary Search Tree, Binary Tree | Medium | 34 | 0.5% |
| 315 | Exchange Seats Database | Medium | 34 | 0.7% |
| 316 | Maximum Width of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 34 | 0.5% |
| 317 | Valid Parenthesis String String, Dynamic Programming, Stack, Greedy | Medium | 34 | 0.4% |
| 318 | Redundant Connection Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 34 | 0.7% |
| 319 | Flood Fill Array, Depth-First Search, Breadth-First Search, Matrix | Easy | 34 | 0.7% |
| 320 | Contain Virus Array, Depth-First Search, Breadth-First Search, Matrix, Simulation | Hard | 34 | 0.6% |
| 321 | Lemonade Change Array, Greedy | Easy | 34 | 0.6% |
| 322 | Boats to Save People Array, Two Pointers, Greedy, Sorting | Medium | 34 | 0.6% |
| 323 | Path In Zigzag Labelled Binary Tree Math, Tree, Binary Tree | Medium | 34 | 0.8% |
| 324 | Longest Common Subsequence String, Dynamic Programming | Medium | 34 | 0.6% |
| 325 | Unique Number of Occurrences Array, Hash Table | Easy | 34 | 0.8% |
| 326 | Allocate Mailboxes Array, Math, Dynamic Programming, Sorting | Hard | 34 | 0.6% |
| 327 | Truncate Sentence Array, String | Easy | 34 | 0.9% |
| 328 | Maximum Number of Accepted Invitations Array, Depth-First Search, Graph Theory, Matrix | Medium | 34 | 0.5% |
| 329 | Check if All the Integers in a Range Are Covered Array, Hash Table, Prefix Sum | Easy | 34 | 0.5% |
| 330 | Build Array from Permutation Array, Simulation | Easy | 34 | 0.9% |
| 331 | Shortest Distance to Target String in a Circular Array Array, String | Easy | 34 | 0.7% |
| 332 | Power of Three Math, Recursion | Easy | 34 | 0.5% |
| 333 | Interleaving String String, Dynamic Programming | Medium | 34 | 0.4% |
| 334 | Multiply Strings Math, String, Simulation | Medium | 32 | 0.4% |
| 335 | Minimum Path Sum Array, Dynamic Programming, Matrix | Medium | 32 | 0.7% |
| 336 | Invert Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 32 | 0.8% |
| 337 | Different Ways to Add Parentheses Math, String, Dynamic Programming, Recursion, Memoization | Medium | 32 | 0.7% |
| 338 | Remove Duplicate Letters String, Stack, Greedy, Monotonic Stack | Medium | 32 | 0.5% |
| 339 | Sum of Two Integers Math, Bit Manipulation | Medium | 32 | 0.6% |
| 340 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 32 | 0.3% |
| 341 | Continuous Subarray Sum Array, Hash Table, Math, Prefix Sum | Medium | 32 | 0.3% |
| 342 | Design Search Autocomplete System String, Depth-First Search, Design, Trie, Sorting, Heap (Priority Queue), Data Stream | Hard | 32 | 0.5% |
| 343 | Set Mismatch Array, Hash Table, Bit Manipulation, Sorting | Easy | 32 | 0.4% |
| 344 | Find Pivot Index Array, Prefix Sum | Easy | 32 | 0.6% |
| 345 | Find Eventual Safe States Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 32 | 0.7% |
| 346 | Sort Array By Parity Array, Two Pointers, Sorting | Easy | 32 | 0.8% |
| 347 | Greatest Common Divisor of Strings Math, String | Easy | 32 | 0.5% |
| 348 | Number of Substrings Containing All Three Characters Hash Table, String, Sliding Window | Medium | 32 | 0.7% |
| 349 | Running Sum of 1d Array Array, Prefix Sum | Easy | 32 | 0.9% |
| 350 | Find if Path Exists in Graph Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Easy | 32 | 0.6% |
| 351 | How Many Numbers Are Smaller Than the Current Number Array, Hash Table, Sorting, Counting Sort | Easy | 32 | 0.9% |
| 352 | Subarrays with K Different Integers Array, Hash Table, Sliding Window, Counting | Hard | 32 | 0.7% |
| 353 | Letter Tile Possibilities Hash Table, String, Backtracking, Counting | Medium | 32 | 0.8% |
| 354 | Partition Array According to Given Pivot Array, Two Pointers, Simulation | Medium | 32 | 0.9% |
| 355 | Permutation Sequence Math, Recursion | Hard | 32 | 0.5% |
| 356 | Jewels and Stones Hash Table, String | Easy | 32 | 0.9% |
| 357 | Duplicate Emails Database | Easy | 32 | 0.7% |
| 358 | Insert Interval Array | Medium | 30 | 0.5% |
| 359 | Nth Highest Salary Database | Medium | 30 | 0.4% |
| 360 | Ugly Number Math | Easy | 30 | 0.4% |
| 361 | Word Pattern Hash Table, String | Easy | 30 | 0.4% |
| 362 | Largest Divisible Subset Array, Math, Dynamic Programming, Sorting | Medium | 30 | 0.5% |
| 363 | Find All Numbers Disappeared in an Array Array, Hash Table | Easy | 30 | 0.6% |
| 364 | Island Perimeter Array, Depth-First Search, Breadth-First Search, Matrix | Easy | 30 | 0.7% |
| 365 | Can Place Flowers Array, Greedy | Easy | 30 | 0.3% |
| 366 | Sum of Square Numbers Math, Two Pointers, Binary Search | Medium | 30 | 0.4% |
| 367 | Palindromic Substrings Two Pointers, String, Dynamic Programming | Medium | 30 | 0.7% |
| 368 | Subarray Product Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Medium | 30 | 0.5% |
| 369 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 30 | 0.6% |
| 370 | Complement of Base 10 Integer Bit Manipulation | Easy | 30 | 0.6% |
| 371 | Shuffle the Array Array | Easy | 30 | 0.9% |
| 372 | Number of Good Pairs Array, Hash Table, Math, Counting | Easy | 30 | 0.9% |
| 373 | Customer Who Visited but Did Not Make Any Transactions Database | Easy | 30 | 0.7% |
| 374 | Number of Students Unable to Eat Lunch Array, Stack, Queue, Simulation | Easy | 30 | 0.8% |
| 375 | Product Sales Analysis III Database | Medium | 30 | 0.5% |
| 376 | Maximum Width Ramp Array, Two Pointers, Stack, Monotonic Stack | Medium | 30 | 0.6% |
| 377 | Friend Requests II: Who Has the Most Friends Database | Medium | 30 | 0.6% |
| 378 | Find Numbers with Even Number of Digits Array, Math | Easy | 30 | 0.8% |
| 379 | Heaters Array, Two Pointers, Binary Search, Sorting | Medium | 30 | 0.4% |
| 380 | Serialize and Deserialize N-ary Tree String, Tree, Depth-First Search, Breadth-First Search | Hard | 30 | 0.7% |
| 381 | Longest Strictly Increasing or Strictly Decreasing Subarray Array | Easy | 30 | 0.6% |
| 382 | Restaurant Growth Database | Medium | 30 | 0.6% |
| 383 | Text Justification Array, String, Simulation | Hard | 28 | 0.5% |
| 384 | Recover Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 28 | 0.6% |
| 385 | Path Sum Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 28 | 0.6% |
| 386 | Word Ladder II Hash Table, String, Backtracking, Breadth-First Search | Hard | 28 | 0.3% |
| 387 | Clone Graph Hash Table, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 28 | 0.7% |
| 388 | Excel Sheet Column Title Math, String | Easy | 28 | 0.5% |
| 389 | Single Number III Array, Bit Manipulation | Medium | 28 | 0.7% |
| 390 | Count of Smaller Numbers After Self Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 28 | 0.4% |
| 391 | Guess Number Higher or Lower Binary Search, Interactive | Easy | 28 | 0.6% |
| 392 | Elimination Game Math, Recursion | Medium | 28 | 0.5% |
| 393 | Third Maximum Number Array, Sorting | Easy | 28 | 0.4% |
| 394 | Find All Duplicates in an Array Array, Hash Table, Sorting | Medium | 28 | 0.8% |
| 395 | 01 Matrix Array, Dynamic Programming, Breadth-First Search, Matrix | Medium | 28 | 0.5% |
| 396 | Find K Closest Elements Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue) | Medium | 28 | 0.5% |
| 397 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 28 | 0.7% |
| 398 | Candy Crush Array, Two Pointers, Matrix, Simulation | Medium | 28 | 0.8% |
| 399 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 28 | 0.6% |
| 400 | Minimum Add to Make Parentheses Valid String, Stack, Greedy | Medium | 28 | 0.7% |
| 401 | Remove All Adjacent Duplicates In String String, Stack | Easy | 28 | 0.7% |
| 402 | Reverse Substrings Between Each Pair of Parentheses String, Stack | Medium | 28 | 0.7% |
| 403 | The Number of Employees Which Report to Each Employee Database | Easy | 28 | 0.5% |
| 404 | Check if the Sentence Is Pangram Hash Table, String | Easy | 28 | 0.8% |
| 405 | Largest Odd Number in String Math, String, Greedy | Easy | 28 | 0.7% |
| 406 | Counter | Easy | 28 | 0.8% |
| 407 | Insert Delete GetRandom O(1) - Duplicates allowed Array, Hash Table, Math, Design, Randomized | Hard | 28 | 0.4% |
| 408 | Delete Duplicate Emails Database | Easy | 28 | 0.7% |
| 409 | Primary Department for Each Employee Database | Easy | 28 | 0.7% |
| 410 | Tuple with Same Product Array, Hash Table, Counting | Medium | 28 | 0.7% |
| 411 | Max Sum of a Pair With Equal Sum of Digits Array, Hash Table, Sorting, Heap (Priority Queue) | Medium | 28 | 0.7% |
| 412 | Finding 3-Digit Even Numbers Array, Hash Table, Recursion, Sorting, Enumeration | Easy | 28 | 0.8% |
| 413 | Rank Scores Database | Medium | 28 | 0.7% |
| 414 | Perfect Number Math | Easy | 28 | 0.5% |
| 415 | N-Queens II Backtracking | Hard | 25 | 0.8% |
| 416 | Decode Ways String, Dynamic Programming | Medium | 25 | 0.4% |
| 417 | Distinct Subsequences String, Dynamic Programming | Hard | 25 | 0.5% |
| 418 | Best Time to Buy and Sell Stock III Array, Dynamic Programming | Hard | 25 | 0.5% |
| 419 | Binary Tree Preorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 25 | 0.8% |
| 420 | Binary Search Tree Iterator Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator | Medium | 25 | 0.8% |
| 421 | Ugly Number II Hash Table, Math, Dynamic Programming, Heap (Priority Queue) | Medium | 25 | 0.5% |
| 422 | Reconstruct Itinerary Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit | Hard | 25 | 0.4% |
| 423 | Valid Perfect Square Math, Binary Search | Easy | 25 | 0.5% |
| 424 | Longest Palindrome Hash Table, String, Greedy | Easy | 25 | 0.6% |
| 425 | Repeated Substring Pattern String, String Matching | Easy | 25 | 0.5% |
| 426 | Coin Change II Array, Dynamic Programming | Medium | 25 | 0.6% |
| 427 | Array Partition Array, Greedy, Sorting, Counting Sort | Easy | 25 | 0.8% |
| 428 | Not Boring Movies Database | Easy | 25 | 0.8% |
| 429 | Task Scheduler Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 25 | 0.6% |
| 430 | Maximum Product of Three Numbers Array, Math, Sorting | Easy | 25 | 0.5% |
| 431 | Valid Palindrome II Two Pointers, String, Greedy | Easy | 25 | 0.4% |
| 432 | Cheapest Flights Within K Stops Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 25 | 0.4% |
| 433 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 25 | 0.5% |
| 434 | Defanging an IP Address String | Easy | 25 | 0.9% |
| 435 | Critical Connections in a Network Depth-First Search, Graph Theory, Biconnected Component | Hard | 25 | 0.6% |
| 436 | Last Person to Fit in the Bus Database | Medium | 25 | 0.7% |
| 437 | Check If N and Its Double Exist Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 25 | 0.4% |
| 438 | Kids With the Greatest Number of Candies Array | Easy | 25 | 0.9% |
| 439 | Number of Subsequences That Satisfy the Given Sum Condition Array, Two Pointers, Binary Search, Sorting | Medium | 25 | 0.5% |
| 440 | House Robber IV Array, Binary Search, Dynamic Programming, Greedy | Medium | 25 | 0.6% |
| 441 | Create a DataFrame from List | Easy | 25 | 0.8% |
| 442 | Score of a String String | Easy | 25 | 0.9% |
| 443 | Employees Whose Manager Left the Company Database | Easy | 25 | 0.5% |
| 444 | Find K-th Smallest Pair Distance Array, Two Pointers, Binary Search, Sorting | Hard | 25 | 0.5% |
| 445 | Remove All Occurrences of a Substring String, Stack, Simulation | Medium | 25 | 0.8% |
| 446 | Movie Rating Database | Medium | 25 | 0.4% |
| 447 | Array Prototype Last | Easy | 25 | 0.7% |
| 448 | Most Stones Removed with Same Row or Column Hash Table, Depth-First Search, Union-Find, Graph Theory | Medium | 25 | 0.6% |
| 449 | Add to Array-Form of Integer Array, Math | Easy | 25 | 0.5% |
| 450 | Find Closest Number to Zero Array | Easy | 25 | 0.5% |
| 451 | Rank Transform of an Array Array, Hash Table, Sorting | Easy | 25 | 0.7% |
| 452 | Couples Holding Hands Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 25 | 0.6% |
| 453 | Reverse Bits Divide and Conquer, Bit Manipulation | Easy | 25 | 0.7% |
| 454 | Minimum Limit of Balls in a Bag Array, Binary Search | Medium | 25 | 0.7% |
| 455 | Defuse the Bomb Array, Sliding Window | Easy | 25 | 0.8% |
| 456 | Two Sum IV - Input is a BST Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 25 | 0.6% |
| 457 | Check if All Characters Have Equal Number of Occurrences Hash Table, String, Counting | Easy | 25 | 0.8% |
| 458 | Best Sightseeing Pair Array, Dynamic Programming | Medium | 25 | 0.6% |
| 459 | Count the Number of Arrays with K Matching Adjacent Elements Math, Combinatorics | Hard | 25 | 0.6% |
| 460 | Unique Length-3 Palindromic Subsequences Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 25 | 0.7% |
| 461 | Clear Digits String, Stack, Simulation | Easy | 25 | 0.8% |
| 462 | Find the Punishment Number of an Integer Math, Backtracking | Medium | 25 | 0.8% |
| 463 | User Activity for the Past 30 Days I Database | Easy | 25 | 0.5% |
| 464 | Rabbits in Forest Array, Hash Table, Math, Greedy | Medium | 25 | 0.6% |
| 465 | Angle Between Hands of a Clock Math | Medium | 25 | 0.7% |
| 466 | Kth Smallest Product of Two Sorted Arrays Array, Binary Search | Hard | 25 | 0.5% |
| 467 | Maximum Number of Events That Can Be Attended Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 25 | 0.4% |
| 468 | Valid Word String | Easy | 25 | 0.5% |
| 469 | Find Winner on a Tic Tac Toe Game Array, Hash Table, Matrix, Simulation | Easy | 25 | 0.5% |
| 470 | Trips and Users Database | Hard | 25 | 0.4% |
| 471 | Next Greater Numerically Balanced Number Hash Table, Math, Backtracking, Counting, Enumeration | Medium | 25 | 0.6% |
| 472 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 25 | 0.5% |
| 473 | Can Make Arithmetic Progression From Sequence Array, Sorting | Easy | 25 | 0.7% |
| 474 | Count Binary Substrings Two Pointers, String | Easy | 25 | 0.7% |
| 475 | Sum of Root To Leaf Binary Numbers Tree, Depth-First Search, Binary Tree | Easy | 25 | 0.8% |
| 476 | Convert Sorted Array to Binary Search Tree Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Easy | 22 | 0.8% |
| 477 | Sum Root to Leaf Numbers Tree, Depth-First Search, Binary Tree | Medium | 22 | 0.7% |
| 478 | Binary Tree Postorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 22 | 0.8% |
| 479 | Department Top Three Salaries Database | Hard | 22 | 0.6% |
| 480 | Design Add and Search Words Data Structure String, Depth-First Search, Design, Trie | Medium | 22 | 0.5% |
| 481 | Count Complete Tree Nodes Binary Search, Bit Manipulation, Tree, Binary Tree | Easy | 22 | 0.7% |
| 482 | Integer to English Words Math, String, Recursion | Hard | 22 | 0.4% |
| 483 | Range Sum Query 2D - Mutable Array, Design, Binary Indexed Tree, Segment Tree, Matrix | Medium | 22 | 0.5% |
| 484 | Counting Bits Dynamic Programming, Bit Manipulation | Easy | 22 | 0.8% |
| 485 | Intersection of Two Arrays II Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 22 | 0.6% |
| 486 | Convert a Number to Hexadecimal Math, String, Bit Manipulation | Easy | 22 | 0.5% |
| 487 | IPO Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 22 | 0.5% |
| 488 | Relative Ranks Array, Sorting, Heap (Priority Queue) | Easy | 22 | 0.7% |
| 489 | Find Largest Value in Each Tree Row Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 22 | 0.7% |
| 490 | Minimum Time Difference Array, Math, String, Sorting | Medium | 22 | 0.6% |
| 491 | Triangle Judgement Database | Easy | 22 | 0.7% |
| 492 | Min Cost Climbing Stairs Array, Dynamic Programming | Easy | 22 | 0.7% |
| 493 | Car Fleet Array, Stack, Sorting, Monotonic Stack | Medium | 22 | 0.6% |
| 494 | Transpose Matrix Array, Matrix, Simulation | Easy | 22 | 0.8% |
| 495 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 22 | 0.5% |
| 496 | Number of Enclaves Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 22 | 0.7% |
| 497 | Count Number of Nice Subarrays Array, Hash Table, Math, Sliding Window, Prefix Sum | Medium | 22 | 0.8% |
| 498 | Find the Smallest Divisor Given a Threshold Array, Binary Search | Medium | 22 | 0.7% |
| 499 | Count Negative Numbers in a Sorted Matrix Array, Binary Search, Matrix | Easy | 22 | 0.8% |
| 500 | Minimum Cost to Cut a Stick Array, Dynamic Programming, Sorting | Hard | 22 | 0.6% |
| 501 | Max Number of K-Sum Pairs Array, Hash Table, Two Pointers, Sorting | Medium | 22 | 0.6% |
| 502 | Find the Highest Altitude Array, Prefix Sum | Easy | 22 | 0.8% |
| 503 | Find a Peak Element II Array, Binary Search, Matrix | Medium | 22 | 0.6% |
| 504 | Find the Maximum Achievable Number Math | Easy | 22 | 0.9% |
| 505 | Find N Unique Integers Sum up to Zero Array, Math | Easy | 22 | 0.8% |
| 506 | Sum of Subarray Ranges Array, Stack, Monotonic Stack | Medium | 22 | 0.6% |
| 507 | Game Play Analysis IV Database | Medium | 22 | 0.4% |
| 508 | Customers Who Bought All Products Database | Medium | 22 | 0.6% |
| 509 | Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) | Hard | 22 | 0.7% |
| 510 | Invalid Tweets Database | Easy | 22 | 0.9% |
| 511 | Longest Harmonious Subsequence Array, Hash Table, Sliding Window, Sorting, Counting | Easy | 22 | 0.6% |
| 512 | Maximum Points You Can Obtain from Cards Array, Sliding Window, Prefix Sum | Medium | 22 | 0.6% |
| 513 | Car Pooling Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum | Medium | 22 | 0.6% |
| 514 | Count the Number of Fair Pairs Array, Two Pointers, Binary Search, Sorting | Medium | 22 | 0.5% |
| 515 | Shortest Subarray to be Removed to Make Array Sorted Array, Two Pointers, Binary Search, Stack, Monotonic Stack | Medium | 22 | 0.5% |
| 516 | Expression Add Operators Math, String, Backtracking | Hard | 22 | 0.4% |
| 517 | Maximum Subarray Sum With Length Divisible by K Array, Hash Table, Prefix Sum | Medium | 22 | 0.5% |
| 518 | Filter Elements from Array | Easy | 22 | 0.9% |
| 519 | Minimum Number of Operations to Move All Balls to Each Box Array, String, Prefix Sum | Medium | 22 | 0.9% |
| 520 | Minimum Cost For Tickets Array, Dynamic Programming | Medium | 22 | 0.7% |
| 521 | Find the Prefix Common Array of Two Arrays Array, Hash Table, Bit Manipulation | Medium | 22 | 0.9% |
| 522 | Next Greater Node In Linked List Array, Linked List, Stack, Monotonic Stack | Medium | 22 | 0.6% |
| 523 | Sum of Beauty of All Substrings Hash Table, String, Counting | Medium | 22 | 0.7% |
| 524 | The k-th Lexicographical String of All Happy Strings of Length n String, Backtracking | Medium | 22 | 0.9% |
| 525 | Valid Number String | Hard | 22 | 0.2% |
| 526 | Backspace String Compare Two Pointers, String, Stack, Simulation | Easy | 22 | 0.5% |
| 527 | Maximum Candies Allocated to K Children Array, Binary Search | Medium | 22 | 0.5% |
| 528 | Minimum Cost to Move Chips to The Same Position Array, Math, Greedy | Easy | 22 | 0.7% |
| 529 | Longest Nice Subarray Array, Bit Manipulation, Sliding Window | Medium | 22 | 0.6% |
| 530 | Minimum Number of Refueling Stops Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 22 | 0.4% |
| 531 | Detect Capital String | Easy | 22 | 0.6% |
| 532 | Find Root of N-Ary Tree Hash Table, Bit Manipulation, Tree, Depth-First Search | Medium | 22 | 0.8% |
| 533 | Count Symmetric Integers Math, Enumeration | Easy | 22 | 0.8% |
| 534 | All Nodes Distance K in Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 22 | 0.7% |
| 535 | Count the Hidden Sequences Array, Prefix Sum | Medium | 22 | 0.6% |
| 536 | Find the K-th Character in String Game I Math, Bit Manipulation, Recursion, Simulation | Easy | 22 | 0.8% |
| 537 | Push Dominoes Two Pointers, String, Dynamic Programming | Medium | 22 | 0.6% |
| 538 | Longest Palindromic Subsequence String, Dynamic Programming | Medium | 22 | 0.7% |
| 539 | Type of Triangle Array, Math, Sorting | Easy | 22 | 0.4% |
| 540 | Zero Array Transformation I Array, Prefix Sum | Medium | 22 | 0.5% |
| 541 | Find All K-Distant Indices in an Array Array, Two Pointers | Easy | 22 | 0.8% |
| 542 | Number of Matching Subsequences Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sorting | Medium | 22 | 0.5% |
| 543 | Longest Binary Subsequence Less Than or Equal to K String, Dynamic Programming, Greedy, Memoization | Medium | 22 | 0.5% |
| 544 | Find Subsequence of Length K With the Largest Sum Array, Hash Table, Sorting, Heap (Priority Queue) | Easy | 22 | 0.6% |
| 545 | K Closest Points to Origin Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect | Medium | 22 | 0.7% |
| 546 | Consecutive Characters String | Easy | 22 | 0.6% |
| 547 | Bitwise ORs of Subarrays Array, Dynamic Programming, Bit Manipulation | Medium | 22 | 0.6% |
| 548 | Ways to Express an Integer as Sum of Powers Dynamic Programming | Medium | 22 | 0.5% |
| 549 | Robot Return to Origin String, Simulation | Easy | 22 | 0.8% |
| 550 | Count Submatrices With All Ones Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Medium | 22 | 0.7% |
| 551 | Best Time to Buy and Sell Stock with Cooldown Array, Dynamic Programming | Medium | 22 | 0.6% |
| 552 | Find the Minimum Area to Cover All Ones I Array, Matrix | Medium | 22 | 0.8% |
| 553 | Subtree of Another Tree Tree, Depth-First Search, String Matching, Binary Tree, Hash Function | Easy | 22 | 0.5% |
| 554 | Largest Triangle Area Array, Math, Geometry | Easy | 22 | 0.7% |
| 555 | Minimum Time Visiting All Points Array, Math, Geometry | Easy | 22 | 0.8% |
| 556 | Longest Balanced Subarray I Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum | Medium | 22 | 0.7% |
| 557 | Delete Nodes From Linked List Present in Array Array, Hash Table, Linked List | Medium | 22 | 0.7% |
| 558 | Baseball Game Array, Stack, Simulation | Easy | 22 | 0.8% |
| 559 | Divide an Array Into Subarrays With Minimum Cost I Array, Sorting, Enumeration | Easy | 22 | 0.8% |
| 560 | Furthest Point From Origin String, Counting | Easy | 22 | 0.8% |
| 561 | Pascal's Triangle II Array, Dynamic Programming | Easy | 18 | 0.7% |
| 562 | Max Points on a Line Array, Hash Table, Math, Geometry | Hard | 18 | 0.3% |
| 563 | Number of 1 Bits Divide and Conquer, Bit Manipulation | Easy | 18 | 0.8% |
| 564 | Range Sum Query 2D - Immutable Array, Design, Matrix, Prefix Sum | Medium | 18 | 0.6% |
| 565 | Burst Balloons Array, Dynamic Programming | Hard | 18 | 0.6% |
| 566 | Integer Break Math, Dynamic Programming | Medium | 18 | 0.6% |
| 567 | All O`one Data Structure Hash Table, Linked List, Design, Doubly-Linked List | Hard | 18 | 0.4% |
| 568 | Minimum Genetic Mutation Hash Table, String, Breadth-First Search | Medium | 18 | 0.6% |
| 569 | Minimum Number of Arrows to Burst Balloons Array, Greedy, Sorting | Medium | 18 | 0.6% |
| 570 | Find Bottom Left Tree Value Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 18 | 0.7% |
| 571 | Sales Person Database | Easy | 18 | 0.7% |
| 572 | Maximum Length of Repeated Subarray Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function | Medium | 18 | 0.5% |
| 573 | Delete and Earn Array, Hash Table, Dynamic Programming | Medium | 18 | 0.6% |
| 574 | Network Delay Time Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 18 | 0.6% |
| 575 | Find Smallest Letter Greater Than Target Array, Binary Search | Easy | 18 | 0.6% |
| 576 | Partition Labels Hash Table, Two Pointers, String, Greedy | Medium | 18 | 0.8% |
| 577 | Hand of Straights Array, Hash Table, Greedy, Sorting | Medium | 18 | 0.6% |
| 578 | Spiral Matrix III Array, Matrix, Simulation | Medium | 18 | 0.8% |
| 579 | Find the Town Judge Array, Hash Table, Graph Theory | Easy | 18 | 0.5% |
| 580 | Find Common Characters Array, Hash Table, String | Easy | 18 | 0.7% |
| 581 | Construct Binary Search Tree from Preorder Traversal Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree | Medium | 18 | 0.8% |
| 582 | Partition Array for Maximum Sum Array, Dynamic Programming | Medium | 18 | 0.8% |
| 583 | Longest String Chain Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting | Medium | 18 | 0.6% |
| 584 | Project Employees I Database | Easy | 18 | 0.7% |
| 585 | N-th Tribonacci Number Math, Dynamic Programming, Memoization | Easy | 18 | 0.6% |
| 586 | Balance a Binary Search Tree Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 18 | 0.9% |
| 587 | Find Users With Valid E-Mails Database | Easy | 18 | 0.4% |
| 588 | Special Array With X Elements Greater Than or Equal X Array, Binary Search, Sorting | Easy | 18 | 0.7% |
| 589 | Minimum Deletions to Make String Balanced String, Dynamic Programming, Stack | Medium | 18 | 0.7% |
| 590 | Richest Customer Wealth Array, Matrix | Easy | 18 | 0.9% |
| 591 | Delete the Middle Node of a Linked List Linked List, Two Pointers | Medium | 18 | 0.6% |
| 592 | Maximum Twin Sum of a Linked List Linked List, Two Pointers, Stack | Medium | 18 | 0.8% |
| 593 | Left and Right Sum Differences Array, Prefix Sum | Easy | 18 | 0.9% |
| 594 | To Be Or Not To Be | Easy | 18 | 0.6% |
| 595 | Return Length of Arguments Passed | Easy | 18 | 0.9% |
| 596 | Find Common Elements Between Two Arrays Array, Hash Table | Easy | 18 | 0.8% |
| 597 | Final Value of Variable After Performing Operations Array, String, Simulation | Easy | 18 | 0.9% |
| 598 | Range Sum of Sorted Subarray Sums Array, Two Pointers, Binary Search, Sorting, Prefix Sum | Medium | 18 | 0.6% |
| 599 | Guess the Word Array, Math, String, Interactive, Game Theory | Hard | 18 | 0.4% |
| 600 | Strange Printer String, Dynamic Programming | Hard | 18 | 0.6% |
| 601 | Meeting Rooms Array, Sorting | Easy | 18 | 0.6% |
| 602 | Trapping Rain Water II Array, Breadth-First Search, Heap (Priority Queue), Matrix | Hard | 18 | 0.6% |
| 603 | Minimum Bit Flips to Convert Number Bit Manipulation | Easy | 18 | 0.9% |
| 604 | Find the Longest Substring Containing Vowels in Even Counts Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 18 | 0.8% |
| 605 | Search Suggestions System Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue) | Medium | 18 | 0.7% |
| 606 | Count Servers that Communicate Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting | Medium | 18 | 0.7% |
| 607 | Number of Ways to Arrive at Destination Dynamic Programming, Graph Theory, Topological Sort, Shortest Path | Medium | 18 | 0.4% |
| 608 | Design a Todo List Array, Hash Table, String, Design, Sorting | Medium | 18 | 0.6% |
| 609 | Create Maximum Number Array, Two Pointers, Stack, Greedy, Monotonic Stack | Hard | 18 | 0.4% |
| 610 | Minimum Total Distance Traveled Array, Dynamic Programming, Sorting | Hard | 18 | 0.6% |
| 611 | Combination Sum III Array, Backtracking | Medium | 18 | 0.7% |
| 612 | Add Strings Math, String, Simulation | Easy | 18 | 0.5% |
| 613 | Open the Lock Array, Hash Table, String, Breadth-First Search | Medium | 18 | 0.6% |
| 614 | Excel Sheet Column Number Math, String | Easy | 18 | 0.7% |
| 615 | Continuous Subarrays Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Medium | 18 | 0.6% |
| 616 | Game of Life Array, Matrix, Simulation | Medium | 18 | 0.7% |
| 617 | Max Chunks To Make Sorted Array, Stack, Greedy, Sorting, Monotonic Stack | Medium | 18 | 0.6% |
| 618 | Product Sales Analysis I Database | Easy | 18 | 0.9% |
| 619 | Maximum Sum of 3 Non-Overlapping Subarrays Array, Dynamic Programming, Sliding Window, Prefix Sum | Hard | 18 | 0.6% |
| 620 | Random Pick with Weight Array, Math, Binary Search, Prefix Sum, Randomized | Medium | 18 | 0.5% |
| 621 | String Matching in an Array Array, String, String Matching | Easy | 18 | 0.7% |
| 622 | Swap Sex of Employees Database | Easy | 18 | 0.8% |
| 623 | Maximum Score Words Formed by Letters Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmask | Hard | 18 | 0.8% |
| 624 | Restore IP Addresses String, Backtracking | Medium | 18 | 0.6% |
| 625 | Shortest Distance from All Buildings Array, Breadth-First Search, Matrix | Hard | 18 | 0.4% |
| 626 | Remove Zero Sum Consecutive Nodes from Linked List Hash Table, Linked List | Medium | 18 | 0.5% |
| 627 | Find the Number of Distinct Colors Among the Balls Array, Hash Table, Simulation | Medium | 18 | 0.5% |
| 628 | Count Salary Categories Database | Medium | 18 | 0.6% |
| 629 | Distribute Candies Array, Hash Table | Easy | 18 | 0.7% |
| 630 | Check if Number is a Sum of Powers of Three Math | Medium | 18 | 0.8% |
| 631 | Maximum Number of Vowels in a Substring of Given Length String, Sliding Window | Medium | 18 | 0.6% |
| 632 | Zero Array Transformation II Array, Two Pointers, Binary Search, Prefix Sum | Medium | 18 | 0.4% |
| 633 | Divide Array Into Equal Pairs Array, Hash Table, Bit Manipulation, Counting | Easy | 18 | 0.8% |
| 634 | Maximum Population Year Array, Counting, Prefix Sum | Easy | 18 | 0.6% |
| 635 | Check if Grid can be Cut into Sections Array, Sorting | Medium | 18 | 0.7% |
| 636 | Maximum Value of an Ordered Triplet II Array | Medium | 18 | 0.6% |
| 637 | Minimum Number of Operations to Make Elements in Array Distinct Array, Hash Table | Easy | 18 | 0.7% |
| 638 | Count Subarrays Where Max Element Appears at Least K Times Array, Sliding Window | Medium | 18 | 0.6% |
| 639 | Zero Array Transformation III Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 18 | 0.5% |
| 640 | Count the Number of Consistent Strings Array, Hash Table, String, Bit Manipulation, Counting | Easy | 18 | 0.9% |
| 641 | Biggest Single Number Database | Easy | 18 | 0.7% |
| 642 | Make The String Great String, Stack | Easy | 18 | 0.7% |
| 643 | Apply Operations to an Array Array, Two Pointers, Simulation | Easy | 18 | 0.7% |
| 644 | Row With Maximum Ones Array, Matrix | Easy | 18 | 0.7% |
| 645 | Path With Minimum Effort Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Medium | 18 | 0.6% |
| 646 | Maximum Manhattan Distance After K Changes Hash Table, Math, String, Counting | Medium | 18 | 0.5% |
| 647 | Taking Maximum Energy From the Mystic Dungeon Array, Dynamic Programming, Prefix Sum | Medium | 18 | 0.6% |
| 648 | Investments in 2016 Database | Medium | 18 | 0.5% |
| 649 | Maximum Number of Events That Can Be Attended II Array, Binary Search, Dynamic Programming, Sorting | Hard | 18 | 0.6% |
| 650 | Binary Tree Cameras Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 18 | 0.5% |
| 651 | Find the Maximum Length of Valid Subsequence II Array, Dynamic Programming | Medium | 18 | 0.6% |
| 652 | Successful Pairs of Spells and Potions Array, Two Pointers, Binary Search, Sorting | Medium | 18 | 0.5% |
| 653 | Count Hills and Valleys in an Array Array | Easy | 18 | 0.7% |
| 654 | Maximum XOR of Two Numbers in an Array Array, Hash Table, Bit Manipulation, Trie | Medium | 18 | 0.5% |
| 655 | Smallest Subarrays With Maximum Bitwise OR Array, Binary Search, Bit Manipulation, Sliding Window | Medium | 18 | 0.6% |
| 656 | Largest 3-Same-Digit Number in String String | Easy | 18 | 0.7% |
| 657 | Power of Four Math, Bit Manipulation, Recursion | Easy | 18 | 0.5% |
| 658 | New 21 Game Math, Dynamic Programming, Sliding Window, Probability and Statistics | Medium | 18 | 0.5% |
| 659 | Sum of Mutated Array Closest to Target Array, Binary Search, Sorting | Medium | 18 | 0.5% |
| 660 | Minimum Operations to Make the Integer Zero Bit Manipulation, Brainteaser, Enumeration | Medium | 18 | 0.6% |
| 661 | Number of People Aware of a Secret Dynamic Programming, Queue, Simulation | Medium | 18 | 0.6% |
| 662 | Vowel Spellchecker Array, Hash Table, String | Medium | 18 | 0.6% |
| 663 | Design Task Manager Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 18 | 0.5% |
| 664 | Count Elements With Maximum Frequency Array, Hash Table, Counting | Easy | 18 | 0.8% |
| 665 | Contains Duplicate III Array, Sliding Window, Sorting, Bucket Sort, Ordered Set | Hard | 18 | 0.2% |
| 666 | Binary Watch Backtracking, Bit Manipulation | Easy | 18 | 0.7% |
| 667 | Find the Minimum Amount of Time to Brew Potions Array, Simulation, Prefix Sum | Medium | 18 | 0.6% |
| 668 | Rank Teams by Votes Array, Hash Table, String, Sorting, Counting | Medium | 18 | 0.6% |
| 669 | Last Stone Weight Array, Heap (Priority Queue) | Easy | 18 | 0.7% |
| 670 | Minimum Operations to Convert All Elements to Zero Array, Hash Table, Stack, Greedy, Monotonic Stack | Medium | 18 | 0.5% |
| 671 | Ones and Zeroes Array, String, Dynamic Programming | Medium | 18 | 0.5% |
| 672 | Count Special Triplets Array, Hash Table, Counting | Medium | 18 | 0.5% |
| 673 | Magic Squares In Grid Array, Hash Table, Math, Matrix | Medium | 18 | 0.6% |
| 674 | Number of Ways to Paint N × 3 Grid Dynamic Programming | Hard | 18 | 0.8% |
| 675 | Four Divisors Array, Math | Medium | 18 | 0.6% |
| 676 | Maximum Product of Splitted Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 18 | 0.6% |
| 677 | Find the Length of the Longest Common Prefix Array, Hash Table, String, Trie | Medium | 18 | 0.6% |
| 678 | Design Linked List Linked List, Design | Medium | 18 | 0.3% |
| 679 | Minimum Pair Removal to Sort Array I Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set | Easy | 18 | 0.7% |
| 680 | K-diff Pairs in an Array Array, Hash Table, Two Pointers, Binary Search, Sorting | Medium | 18 | 0.5% |
| 681 | Number of Longest Increasing Subsequence Array, Dynamic Programming, Binary Indexed Tree, Segment Tree | Medium | 18 | 0.5% |
| 682 | Minimum Swaps to Arrange a Binary Grid Array, Greedy, Matrix | Medium | 18 | 0.7% |
| 683 | Rotate Function Array, Math, Dynamic Programming | Medium | 18 | 0.5% |
| 684 | Jump Game VII String, Dynamic Programming, Sliding Window, Prefix Sum | Medium | 18 | 0.4% |
| 685 | Total Waviness of Numbers in Range II Math, Dynamic Programming | Hard | 18 | 0.6% |
| 686 | Create Binary Tree From Descriptions Array, Hash Table, Tree, Binary Tree | Medium | 18 | 0.8% |
| 687 | Maximum Building Height Array, Math, Sorting | Hard | 18 | 0.7% |
| 688 | Spiral Matrix II Array, Matrix, Simulation | Medium | 14 | 0.8% |
| 689 | Gray Code Math, Backtracking, Bit Manipulation | Medium | 14 | 0.7% |
| 690 | Unique Binary Search Trees II Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree | Medium | 14 | 0.6% |
| 691 | Construct Binary Tree from Inorder and Postorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 14 | 0.7% |
| 692 | Convert Sorted List to Binary Search Tree Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Medium | 14 | 0.7% |
| 693 | Word Search II Array, String, Backtracking, Trie, Matrix | Hard | 14 | 0.4% |
| 694 | Binary Tree Paths String, Backtracking, Tree, Depth-First Search, Binary Tree | Easy | 14 | 0.7% |
| 695 | Range Sum Query - Mutable Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Tree | Medium | 14 | 0.4% |
| 696 | Design Twitter Hash Table, Linked List, Design, Heap (Priority Queue) | Medium | 14 | 0.4% |
| 697 | Sum of Left Leaves Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 14 | 0.6% |
| 698 | Path Sum III Tree, Depth-First Search, Binary Tree | Medium | 14 | 0.5% |
| 699 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 14 | 0.5% |
| 700 | Predict the Winner Array, Math, Dynamic Programming, Recursion, Game Theory | Medium | 14 | 0.6% |
| 701 | Brick Wall Array, Hash Table | Medium | 14 | 0.6% |
| 702 | 2 Keys Keyboard Math, Dynamic Programming | Medium | 14 | 0.6% |
| 703 | Find Duplicate Subtrees Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 14 | 0.6% |
| 704 | Search in a Binary Search Tree Tree, Binary Search Tree, Binary Tree | Easy | 14 | 0.8% |
| 705 | Kth Largest Element in a Stream Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream | Easy | 14 | 0.6% |
| 706 | K-th Symbol in Grammar Math, Bit Manipulation, Recursion | Medium | 14 | 0.5% |
| 707 | Custom Sort String Hash Table, String, Sorting | Medium | 14 | 0.7% |
| 708 | Design HashSet Array, Hash Table, Linked List, Design, Hash Function | Easy | 14 | 0.7% |
| 709 | Fair Candy Swap Array, Hash Table, Binary Search, Sorting | Easy | 14 | 0.7% |
| 710 | Minimum Falling Path Sum Array, Dynamic Programming, Matrix | Medium | 14 | 0.6% |
| 711 | Knight Dialer Dynamic Programming | Medium | 14 | 0.6% |
| 712 | Reveal Cards In Increasing Order Array, Queue, Sorting, Simulation | Medium | 14 | 0.8% |
| 713 | Unique Paths III Array, Backtracking, Bit Manipulation, Matrix | Hard | 14 | 0.8% |
| 714 | Interval List Intersections Array, Two Pointers, Sweep Line | Medium | 14 | 0.7% |
| 715 | Duplicate Zeros Array, Two Pointers | Easy | 14 | 0.5% |
| 716 | Game Play Analysis I Database | Easy | 14 | 0.8% |
| 717 | Relative Sort Array Array, Hash Table, Sorting, Counting Sort | Easy | 14 | 0.8% |
| 718 | Minimum Cost Tree From Leaf Values Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | Medium | 14 | 0.7% |
| 719 | Three Consecutive Odds Array | Easy | 14 | 0.7% |
| 720 | Percentage of Users Attended a Contest Database | Easy | 14 | 0.6% |
| 721 | Maximum Score From Removing Substrings String, Stack, Greedy | Medium | 14 | 0.7% |
| 722 | Amount of Time for Binary Tree to Be Infected Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 14 | 0.7% |
| 723 | Kth Largest Sum in a Binary Tree Tree, Breadth-First Search, Sorting, Binary Tree | Medium | 14 | 0.6% |
| 724 | Divisor Game Math, Dynamic Programming, Brainteaser, Game Theory | Easy | 14 | 0.7% |
| 725 | Fix Names in a Table Database | Easy | 14 | 0.6% |
| 726 | Create Target Array in the Given Order Array, Simulation | Easy | 14 | 0.9% |
| 727 | Maximum Total Damage With Spell Casting Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting | Medium | 14 | 0.5% |
| 728 | Repeated String Match String, String Matching | Medium | 14 | 0.4% |
| 729 | Monotonic Array Array | Easy | 14 | 0.6% |
| 730 | Minimum Number of Days to Disconnect Island Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component | Hard | 14 | 0.6% |
| 731 | N-ary Tree Postorder Traversal Stack, Tree, Depth-First Search | Easy | 14 | 0.8% |
| 732 | Find the Power of K-Size Subarrays I Array, Sliding Window | Medium | 14 | 0.6% |
| 733 | Longest Subarray With Maximum Bitwise AND Array, Bit Manipulation, Brainteaser | Medium | 14 | 0.7% |
| 734 | My Calendar I Array, Binary Search, Design, Segment Tree, Ordered Set | Medium | 14 | 0.6% |
| 735 | Minimum Number of Swaps to Make the String Balanced Two Pointers, String, Stack, Greedy | Medium | 14 | 0.8% |
| 736 | The Number of the Smallest Unoccupied Chair Array, Hash Table, Heap (Priority Queue) | Medium | 14 | 0.6% |
| 737 | Sort By | Easy | 14 | 0.8% |
| 738 | Find K Pairs with Smallest Sums Array, Heap (Priority Queue) | Medium | 14 | 0.4% |
| 739 | Longest Happy String String, Greedy, Heap (Priority Queue) | Medium | 14 | 0.7% |
| 740 | Find Kth Bit in Nth Binary String String, Recursion, Simulation | Medium | 14 | 0.7% |
| 741 | Parsing A Boolean Expression String, Stack, Recursion | Hard | 14 | 0.7% |
| 742 | Moving Average from Data Stream Array, Design, Queue, Data Stream | Easy | 14 | 0.8% |
| 743 | Final Prices With a Special Discount in a Shop Array, Stack, Monotonic Stack | Easy | 14 | 0.8% |
| 744 | Minimum Number of Removals to Make Mountain Array Array, Binary Search, Dynamic Programming, Greedy | Hard | 14 | 0.5% |
| 745 | Minimum Index Sum of Two Lists Array, Hash Table, String | Easy | 14 | 0.6% |
| 746 | DI String Match Array, Two Pointers, String, Greedy | Easy | 14 | 0.8% |
| 747 | Minimum Number of Changes to Make Binary String Beautiful String | Medium | 14 | 0.8% |
| 748 | Count Good Triplets Array, Enumeration | Easy | 14 | 0.9% |
| 749 | Minimum Array End Bit Manipulation | Medium | 14 | 0.6% |
| 750 | Delete Characters to Make Fancy String String | Easy | 14 | 0.7% |
| 751 | Smallest Even Multiple Math, Number Theory | Easy | 14 | 0.9% |
| 752 | Count Vowel Substrings of a String Hash Table, String | Easy | 14 | 0.7% |
| 753 | Find Score of an Array After Marking All Elements Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Medium | 14 | 0.6% |
| 754 | Maximum Average Pass Ratio Array, Greedy, Heap (Priority Queue) | Medium | 14 | 0.7% |
| 755 | Make Array Elements Equal to Zero Array, Simulation, Prefix Sum | Easy | 14 | 0.7% |
| 756 | Count Beautiful Splits in an Array Array, Dynamic Programming | Medium | 14 | 0.2% |
| 757 | Find Center of Star Graph Graph Theory | Easy | 14 | 0.9% |
| 758 | Number of Ways to Split Array Array, Prefix Sum | Medium | 14 | 0.6% |
| 759 | Count Prefix and Suffix Pairs I Array, String, Trie, Rolling Hash, String Matching, Hash Function | Easy | 14 | 0.8% |
| 760 | Counting Words With a Given Prefix Array, String, String Matching | Easy | 14 | 0.8% |
| 761 | Construct K Palindrome Strings Hash Table, String, Greedy, Counting | Medium | 14 | 0.7% |
| 762 | Maximum Distance in Arrays Array, Greedy | Medium | 14 | 0.5% |
| 763 | Check if a Parentheses String Can Be Valid String, Stack, Greedy | Medium | 14 | 0.5% |
| 764 | Minimum Length of String After Operations Hash Table, String, Counting | Medium | 14 | 0.8% |
| 765 | Merge Two Binary Trees Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 14 | 0.8% |
| 766 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 14 | 0.5% |
| 767 | Find the Difference of Two Arrays Array, Hash Table | Easy | 14 | 0.8% |
| 768 | Shortest Unsorted Continuous Subarray Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack | Medium | 14 | 0.4% |
| 769 | Sort the People Array, Hash Table, String, Sorting | Easy | 14 | 0.8% |
| 770 | Longest Nice Substring Hash Table, String, Divide and Conquer, Bit Manipulation, Sliding Window | Easy | 14 | 0.6% |
| 771 | Product of the Last K Numbers Array, Math, Design, Data Stream, Prefix Sum | Medium | 14 | 0.6% |
| 772 | Minimum Height Trees Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 14 | 0.4% |
| 773 | Recover a Tree From Preorder Traversal String, Tree, Depth-First Search, Binary Tree | Hard | 14 | 0.8% |
| 774 | Construct Binary Tree from Preorder and Postorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 14 | 0.8% |
| 775 | Length of Longest Fibonacci Subsequence Array, Hash Table, Dynamic Programming | Medium | 14 | 0.6% |
| 776 | Maximum Absolute Sum of Any Subarray Array, Dynamic Programming | Medium | 14 | 0.7% |
| 777 | Closest Prime Numbers in Range Math, Number Theory | Medium | 14 | 0.5% |
| 778 | Alternating Groups II Array, Sliding Window | Medium | 14 | 0.6% |
| 779 | Count of Substrings Containing Every Vowel and K Consonants II Hash Table, String, Sliding Window | Medium | 14 | 0.4% |
| 780 | Pacific Atlantic Water Flow Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 14 | 0.6% |
| 781 | Minimum Operations to Make Binary Array Elements Equal to One I Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum | Medium | 14 | 0.8% |
| 782 | Separate Squares I Array, Binary Search | Medium | 14 | 0.6% |
| 783 | Sales Analysis III Database | Easy | 14 | 0.5% |
| 784 | Lowest Common Ancestor of Deepest Leaves Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 14 | 0.8% |
| 785 | Minimum Operations to Make Array Values Equal to K Array, Hash Table | Easy | 14 | 0.7% |
| 786 | Maximum Sum Circular Subarray Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue | Medium | 14 | 0.5% |
| 787 | Count Largest Group Hash Table, Math, Counting | Easy | 14 | 0.7% |
| 788 | Flipping an Image Array, Two Pointers, Bit Manipulation, Matrix, Simulation | Easy | 14 | 0.8% |
| 789 | Most Frequent Even Element Array, Hash Table, Counting | Easy | 14 | 0.5% |
| 790 | Remove Digit From Number to Maximize Result String, Greedy, Enumeration | Easy | 14 | 0.5% |
| 791 | Domino and Tromino Tiling Dynamic Programming | Medium | 14 | 0.5% |
| 792 | Find Minimum Time to Reach Last Room I Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 14 | 0.6% |
| 793 | Dungeon Game Array, Dynamic Programming, Matrix | Hard | 14 | 0.4% |
| 794 | Painting a Grid With Three Different Colors Dynamic Programming | Hard | 14 | 0.8% |
| 795 | Find Greatest Common Divisor of Array Array, Math, Number Theory | Easy | 14 | 0.8% |
| 796 | Divisible and Non-divisible Sums Difference Math | Easy | 14 | 0.9% |
| 797 | Longest Palindrome by Concatenating Two Letter Words Array, Hash Table, String, Greedy, Counting | Medium | 14 | 0.5% |
| 798 | Insert into a Binary Search Tree Tree, Binary Search Tree, Binary Tree | Medium | 14 | 0.7% |
| 799 | Shortest Subarray with Sum at Least K Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue | Hard | 14 | 0.3% |
| 800 | Reverse Prefix of Word Two Pointers, String, Stack | Easy | 14 | 0.9% |
| 801 | Maximum Difference Between Increasing Elements Array | Easy | 14 | 0.7% |
| 802 | Max Difference You Can Get From Changing an Integer Math, Greedy | Medium | 14 | 0.5% |
| 803 | Divide Array Into Arrays With Max Difference Array, Greedy, Sorting | Medium | 14 | 0.8% |
| 804 | Divide a String Into Groups of Size k String, Simulation | Easy | 14 | 0.8% |
| 805 | Minimum Deletions to Make String K-Special Hash Table, String, Greedy, Sorting, Counting | Medium | 14 | 0.7% |
| 806 | Nearest Exit from Entrance in Maze Array, Breadth-First Search, Matrix | Medium | 14 | 0.5% |
| 807 | Find the Original Typed String I String | Easy | 14 | 0.7% |
| 808 | Height Checker Array, Sorting, Counting Sort | Easy | 14 | 0.8% |
| 809 | Find the Middle Index in Array Array, Prefix Sum | Easy | 14 | 0.7% |
| 810 | Find the K-th Character in String Game II Math, Bit Manipulation, Recursion | Hard | 14 | 0.5% |
| 811 | Find Followers Count Database | Easy | 14 | 0.7% |
| 812 | Special Array I Array | Easy | 14 | 0.8% |
| 813 | Find Lucky Integer in an Array Array, Hash Table, Counting | Easy | 14 | 0.8% |
| 814 | Finding Pairs With a Certain Sum Array, Hash Table, Design | Medium | 14 | 0.6% |
| 815 | Reschedule Meetings for Maximum Free Time II Array, Greedy, Enumeration | Medium | 14 | 0.6% |
| 816 | Longest Continuous Increasing Subsequence Array | Easy | 14 | 0.5% |
| 817 | Calculate Amount Paid in Taxes Array, Simulation | Easy | 14 | 0.7% |
| 818 | Maximum Erasure Value Array, Hash Table, Sliding Window | Medium | 14 | 0.6% |
| 819 | Minimum Penalty for a Shop String, Prefix Sum | Medium | 14 | 0.7% |
| 820 | Maximum Unique Subarray Sum After Deletion Array, Hash Table, Greedy | Easy | 14 | 0.4% |
| 821 | Market Analysis I Database | Medium | 14 | 0.6% |
| 822 | Verifying an Alien Dictionary Array, Hash Table, String | Easy | 14 | 0.6% |
| 823 | Fruits Into Baskets III Array, Binary Search, Segment Tree, Ordered Set | Medium | 14 | 0.4% |
| 824 | Find the Maximum Number of Fruits Collected Array, Dynamic Programming, Matrix | Hard | 14 | 0.6% |
| 825 | Shortest Distance to a Character Array, Two Pointers, String | Easy | 14 | 0.7% |
| 826 | Max Sum of Rectangle No Larger Than K Array, Binary Search, Matrix, Prefix Sum, Ordered Set | Hard | 14 | 0.5% |
| 827 | Maximum 69 Number Math, Greedy | Easy | 14 | 0.8% |
| 828 | 24 Game Array, Math, Backtracking | Hard | 14 | 0.6% |
| 829 | Longest Subarray of 1's After Deleting One Element Array, Dynamic Programming, Sliding Window | Medium | 14 | 0.7% |
| 830 | Number of Operations to Make Network Connected Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 14 | 0.7% |
| 831 | Number of Steps to Reduce a Number to Zero Math, Bit Manipulation | Easy | 14 | 0.9% |
| 832 | Hamming Distance Bit Manipulation | Easy | 14 | 0.8% |
| 833 | Minimum Operations to Make Array Elements Zero Array, Math, Bit Manipulation | Hard | 14 | 0.6% |
| 834 | Maximum Repeating Substring String, Dynamic Programming, String Matching | Easy | 14 | 0.4% |
| 835 | Largest Perimeter Triangle Array, Math, Greedy, Sorting | Easy | 14 | 0.6% |
| 836 | Super Egg Drop Math, Binary Search, Dynamic Programming | Hard | 14 | 0.3% |
| 837 | Maximum Tastiness of Candy Basket Array, Binary Search, Greedy, Sorting | Medium | 14 | 0.7% |
| 838 | Avoid Flood in The City Array, Hash Table, Binary Search, Greedy, Heap (Priority Queue) | Medium | 14 | 0.4% |
| 839 | Remove K-Balanced Substrings String, Stack, Simulation | Medium | 14 | 0.3% |
| 840 | Find the Distance Value Between Two Arrays Array, Two Pointers, Binary Search, Sorting | Easy | 14 | 0.7% |
| 841 | Longest Balanced Substring I Hash Table, String, Counting, Enumeration | Medium | 14 | 0.7% |
| 842 | Simple Bank System Array, Hash Table, Design, Simulation | Medium | 14 | 0.7% |
| 843 | Range Sum of BST Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 14 | 0.9% |
| 844 | Maximum Frequency Stack Hash Table, Stack, Design, Ordered Set | Hard | 14 | 0.7% |
| 845 | Find X-Sum of All K-Long Subarrays I Array, Hash Table, Sliding Window, Heap (Priority Queue) | Easy | 14 | 0.8% |
| 846 | Longest Substring with At Least K Repeating Characters Hash Table, String, Divide and Conquer, Sliding Window | Medium | 14 | 0.5% |
| 847 | Determine if Two Strings Are Close Hash Table, String, Sorting, Counting | Medium | 14 | 0.5% |
| 848 | Number of Distinct Islands Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function | Medium | 14 | 0.6% |
| 849 | Minimum Score of a Path Between Two Cities Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 14 | 0.6% |
| 850 | Reshape Data: Melt | Easy | 14 | 0.9% |
| 851 | Map of Highest Peak Array, Breadth-First Search, Matrix | Medium | 14 | 0.8% |
| 852 | Combination Sum IV Array, Dynamic Programming | Medium | 14 | 0.6% |
| 853 | Maximum Matrix Sum Array, Greedy, Matrix | Medium | 14 | 0.7% |
| 854 | Online Election Array, Hash Table, Binary Search, Design | Medium | 14 | 0.5% |
| 855 | Wiggle Sort II Array, Divide and Conquer, Greedy, Sorting, Quickselect | Medium | 14 | 0.4% |
| 856 | Smallest Subtree with all the Deepest Nodes Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 14 | 0.8% |
| 857 | Maximum Square Area by Removing Fences From a Field Array, Hash Table, Enumeration | Medium | 14 | 0.5% |
| 858 | Find the Largest Area of Square Inside Two Rectangles Array, Math, Geometry | Medium | 14 | 0.7% |
| 859 | N-Repeated Element in Size 2N Array Array, Hash Table | Easy | 14 | 0.8% |
| 860 | Take K of Each Character From Left and Right Hash Table, String, Sliding Window | Medium | 14 | 0.5% |
| 861 | Exclusive Time of Functions Array, Stack | Medium | 14 | 0.7% |
| 862 | Subtract the Product and Sum of Digits of an Integer Math | Easy | 14 | 0.9% |
| 863 | House Robber III Dynamic Programming, Tree, Depth-First Search, Binary Tree | Medium | 14 | 0.6% |
| 864 | Longest Balanced Substring II Hash Table, String, Prefix Sum | Medium | 14 | 0.4% |
| 865 | Champagne Tower Dynamic Programming | Medium | 14 | 0.6% |
| 866 | Special Binary String String, Divide and Conquer, Sorting | Hard | 14 | 0.8% |
| 867 | Concatenation of Consecutive Binary Numbers Math, Bit Manipulation, Simulation | Medium | 14 | 0.7% |
| 868 | Largest Submatrix With Rearrangements Array, Greedy, Sorting, Matrix | Medium | 14 | 0.8% |
| 869 | Maximum Amount of Money Robot Can Earn Array, Dynamic Programming, Matrix | Medium | 14 | 0.5% |
| 870 | Closest Equal Element Queries Array, Hash Table, Binary Search | Medium | 14 | 0.5% |
| 871 | Mirror Distance of an Integer Math | Easy | 14 | 0.9% |
| 872 | Two Furthest Houses With Different Colors Array, Greedy | Easy | 14 | 0.7% |
| 873 | Longest Increasing Path in a Matrix Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix | Hard | 14 | 0.6% |
| 874 | Words Within Two Edits of Dictionary Array, String, Trie | Medium | 14 | 0.7% |
| 875 | Guess Number Higher or Lower II Math, Dynamic Programming, Game Theory | Medium | 14 | 0.5% |
| 876 | Valid Mountain Array Array | Easy | 14 | 0.4% |
| 877 | Total Cost to Hire K Workers Array, Two Pointers, Heap (Priority Queue), Simulation | Medium | 14 | 0.4% |
| 878 | Flatten Nested List Iterator Stack, Tree, Depth-First Search, Design, Queue, Iterator | Medium | 14 | 0.7% |
| 879 | Nth Digit Math, Binary Search | Medium | 14 | 0.4% |
| 880 | Minimum Cost of Buying Candies With Discount Array, Greedy, Sorting | Easy | 14 | 0.7% |
| 881 | Bulls and Cows Hash Table, String, Counting | Medium | 14 | 0.5% |
| 882 | Earliest Finish Time for Land and Water Rides I Array, Two Pointers, Binary Search, Greedy, Sorting | Easy | 14 | 0.7% |
| 883 | Number of Ways to Assign Edge Weights II Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search | Hard | 14 | 0.7% |
| 884 | Process String with Special Operations I String, Simulation | Medium | 14 | 0.7% |
| 885 | Number of ZigZag Arrays II Math, Dynamic Programming | Hard | 14 | 0.7% |
| 886 | Unique Binary Search Trees Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree | Medium | 8 | 0.6% |
| 887 | Palindrome Partitioning II String, Dynamic Programming | Hard | 8 | 0.4% |
| 888 | Maximum Gap Array, Sorting, Bucket Sort, Radix Sort | Medium | 8 | 0.5% |
| 889 | Bulb Switcher Math, Brainteaser | Medium | 8 | 0.6% |
| 890 | Russian Doll Envelopes Array, Binary Search, Dynamic Programming, Sorting | Hard | 8 | 0.4% |
| 891 | Kth Smallest Element in a Sorted Matrix Array, Binary Search, Sorting, Heap (Priority Queue), Matrix | Medium | 8 | 0.6% |
| 892 | Find Right Interval Array, Binary Search, Sorting | Medium | 8 | 0.6% |
| 893 | Find Mode in Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 8 | 0.6% |
| 894 | Out of Boundary Paths Dynamic Programming | Medium | 8 | 0.5% |
| 895 | Is Graph Bipartite? Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 8 | 0.6% |
| 896 | Design Circular Queue Array, Linked List, Design, Queue | Medium | 8 | 0.5% |
| 897 | Score of Parentheses String, Stack | Medium | 8 | 0.6% |
| 898 | Stone Game Array, Math, Dynamic Programming, Game Theory | Medium | 8 | 0.7% |
| 899 | Distribute Coins in Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.8% |
| 900 | Longest Arithmetic Subsequence Array, Hash Table, Binary Search, Dynamic Programming | Medium | 8 | 0.5% |
| 901 | Flower Planting With No Adjacent Depth-First Search, Breadth-First Search, Graph Theory | Medium | 8 | 0.5% |
| 902 | Longest Duplicate Substring String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function | Hard | 8 | 0.3% |
| 903 | Minimum Falling Path Sum II Array, Dynamic Programming, Matrix | Hard | 8 | 0.6% |
| 904 | Stone Game II Array, Math, Dynamic Programming, Prefix Sum, Game Theory | Medium | 8 | 0.7% |
| 905 | Find Resultant Array After Removing Anagrams Array, Hash Table, String, Sorting | Easy | 8 | 0.7% |
| 906 | Group the People Given the Group Size They Belong To Array, Hash Table, Greedy | Medium | 8 | 0.9% |
| 907 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Medium | 8 | 0.6% |
| 908 | Average Salary Excluding the Minimum and Maximum Salary Array, Sorting | Easy | 8 | 0.6% |
| 909 | The kth Factor of n Math, Number Theory | Medium | 8 | 0.7% |
| 910 | Water Bottles Math, Simulation | Easy | 8 | 0.7% |
| 911 | Patients With a Condition Database | Easy | 8 | 0.4% |
| 912 | Minimum Time to Make Rope Colorful Array, String, Dynamic Programming, Greedy | Medium | 8 | 0.7% |
| 913 | Sum of All Subset XOR Totals Array, Math, Backtracking, Bit Manipulation, Combinatorics, Enumeration | Easy | 8 | 0.9% |
| 914 | Maximum Alternating Subsequence Sum Array, Dynamic Programming | Medium | 8 | 0.6% |
| 915 | Minimum Number of Operations to Make Array Continuous Array, Hash Table, Binary Search, Sliding Window | Hard | 8 | 0.5% |
| 916 | Time Needed to Buy Tickets Array, Queue, Simulation | Easy | 8 | 0.7% |
| 917 | Count Numbers with Unique Digits Math, Dynamic Programming, Backtracking | Medium | 8 | 0.6% |
| 918 | Most Frequent Subtree Sum Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.7% |
| 919 | Filling Bookcase Shelves Array, Dynamic Programming | Medium | 8 | 0.7% |
| 920 | Minimum Swaps to Group All 1's Together II Array, Sliding Window | Medium | 8 | 0.7% |
| 921 | Split Linked List in Parts Linked List | Medium | 8 | 0.7% |
| 922 | Regions Cut By Slashes Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 8 | 0.8% |
| 923 | Minimized Maximum of Products Distributed to Any Store Array, Binary Search, Greedy | Medium | 8 | 0.6% |
| 924 | Maximum Number of Points with Cost Array, Dynamic Programming, Matrix | Medium | 8 | 0.4% |
| 925 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 8 | 0.5% |
| 926 | Final Array State After K Multiplication Operations I Array, Math, Heap (Priority Queue), Simulation | Easy | 8 | 0.9% |
| 927 | Sum of Digits of String After Convert String, Simulation | Easy | 8 | 0.7% |
| 928 | Find Missing Observations Array, Math, Simulation | Medium | 8 | 0.6% |
| 929 | Linked List in Binary Tree Linked List, Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.5% |
| 930 | Sum of Prefix Scores of Strings Array, String, Trie, Counting | Hard | 8 | 0.6% |
| 931 | Make Sum Divisible by P Array, Hash Table, Prefix Sum | Medium | 8 | 0.4% |
| 932 | Sentence Similarity III Array, Two Pointers, String | Medium | 8 | 0.5% |
| 933 | Divide Players Into Teams of Equal Skill Array, Hash Table, Two Pointers, Sorting | Medium | 8 | 0.7% |
| 934 | Divide Intervals Into Minimum Number of Groups Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 8 | 0.6% |
| 935 | Maximum Product of Two Elements in an Array Array, Sorting, Heap (Priority Queue) | Easy | 8 | 0.8% |
| 936 | Split a String Into the Max Number of Unique Substrings Hash Table, String, Backtracking | Medium | 8 | 0.7% |
| 937 | Find Minimum Operations to Make All Elements Divisible by Three Array, Math | Easy | 8 | 0.9% |
| 938 | Circular Sentence String | Easy | 8 | 0.7% |
| 939 | Maximum XOR for Each Query Array, Bit Manipulation, Prefix Sum | Medium | 8 | 0.8% |
| 940 | Find a Safe Walk Through a Grid Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 8 | 0.3% |
| 941 | Degree of an Array Array, Hash Table | Easy | 8 | 0.6% |
| 942 | Maximum Sum BST in Binary Tree Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Hard | 8 | 0.5% |
| 943 | Flip Columns For Maximum Number of Equal Rows Array, Hash Table, Matrix | Medium | 8 | 0.8% |
| 944 | Nim Game Math, Brainteaser, Game Theory | Easy | 8 | 0.6% |
| 945 | Special Array II Array, Binary Search, Prefix Sum | Medium | 8 | 0.5% |
| 946 | Number of Visible People in a Queue Array, Stack, Monotonic Stack | Hard | 8 | 0.7% |
| 947 | Check if Array is Good Array, Hash Table, Sorting | Easy | 8 | 0.6% |
| 948 | Sliding Window Median Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 8 | 0.4% |
| 949 | Count Univalue Subtrees Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.6% |
| 950 | Count Special Subsequences Array, Hash Table, Math, Enumeration | Medium | 8 | 0.3% |
| 951 | Word Subsets Array, Hash Table, String | Medium | 8 | 0.6% |
| 952 | Minimize XOR Greedy, Bit Manipulation | Medium | 8 | 0.6% |
| 953 | First Completely Painted Row or Column Array, Hash Table, Matrix | Medium | 8 | 0.6% |
| 954 | Maximum and Minimum Sums of at Most Size K Subsequences Array, Math, Dynamic Programming, Sorting, Combinatorics | Medium | 8 | 0.2% |
| 955 | Grid Game Array, Matrix, Prefix Sum | Medium | 8 | 0.6% |
| 956 | Paint House IV Array, Dynamic Programming | Medium | 8 | 0.5% |
| 957 | Largest Local Values in a Matrix Array, Matrix | Easy | 8 | 0.9% |
| 958 | Convert Binary Number in a Linked List to Integer Linked List, Math | Easy | 8 | 0.8% |
| 959 | Find Original Array From Doubled Array Array, Hash Table, Greedy, Sorting | Medium | 8 | 0.4% |
| 960 | Shortest Path in a Hidden Grid Array, Depth-First Search, Breadth-First Search, Matrix, Interactive | Medium | 8 | 0.4% |
| 961 | Construct Quad Tree Array, Divide and Conquer, Tree, Matrix | Medium | 8 | 0.8% |
| 962 | Count Pairs Whose Sum is Less than Target Array, Two Pointers, Binary Search, Sorting | Easy | 8 | 0.9% |
| 963 | Find Unique Binary String Array, Hash Table, String, Backtracking | Medium | 8 | 0.8% |
| 964 | Reach a Number Math, Binary Search | Medium | 8 | 0.5% |
| 965 | Decrypt String from Alphabet to Integer Mapping String | Easy | 8 | 0.8% |
| 966 | Count Vowel Strings in Ranges Array, String, Prefix Sum | Medium | 8 | 0.7% |
| 967 | Count Total Number of Colored Cells Math | Medium | 8 | 0.7% |
| 968 | Maximum Subsequence Score Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 8 | 0.5% |
| 969 | Walls and Gates Array, Breadth-First Search, Matrix | Medium | 8 | 0.6% |
| 970 | Beautiful Arrangement II Array, Math | Medium | 8 | 0.6% |
| 971 | Last Stone Weight II Array, Dynamic Programming | Medium | 8 | 0.6% |
| 972 | Find the Minimum and Maximum Number of Nodes Between Critical Points Linked List | Medium | 8 | 0.7% |
| 973 | Find All Possible Recipes from Given Supplies Array, Hash Table, String, Graph Theory, Topological Sort | Medium | 8 | 0.6% |
| 974 | Maximum Units on a Truck Array, Greedy, Sorting | Easy | 8 | 0.7% |
| 975 | Shifting Letters Array, String, Prefix Sum | Medium | 8 | 0.5% |
| 976 | Grumpy Bookstore Owner Array, Sliding Window | Medium | 8 | 0.6% |
| 977 | Largest Number At Least Twice of Others Array, Sorting | Easy | 8 | 0.5% |
| 978 | Solving Questions With Brainpower Array, Dynamic Programming | Medium | 8 | 0.6% |
| 979 | Longest Univalue Path Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.4% |
| 980 | Count Good Triplets in an Array Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 8 | 0.7% |
| 981 | Count Equal and Divisible Pairs in an Array Array | Easy | 8 | 0.8% |
| 982 | Adding Spaces to a String Array, Two Pointers, String, Simulation | Medium | 8 | 0.7% |
| 983 | Equal Row and Column Pairs Array, Hash Table, Matrix, Simulation | Medium | 8 | 0.7% |
| 984 | Shortest String That Contains Three Strings String, Greedy, Enumeration | Medium | 8 | 0.3% |
| 985 | Count of Interesting Subarrays Array, Hash Table, Prefix Sum | Medium | 8 | 0.6% |
| 986 | Minimum Number Game Array, Sorting, Heap (Priority Queue), Simulation | Easy | 8 | 0.9% |
| 987 | Remove Methods From Project Depth-First Search, Breadth-First Search, Graph Theory | Medium | 8 | 0.5% |
| 988 | Merge Two 2D Arrays by Summing Values Array, Hash Table, Two Pointers | Easy | 8 | 0.8% |
| 989 | Move Pieces to Obtain a String Two Pointers, String | Medium | 8 | 0.6% |
| 990 | Number of Equivalent Domino Pairs Array, Hash Table, Counting | Easy | 8 | 0.6% |
| 991 | Maximum Number of Tasks You Can Assign Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue | Hard | 8 | 0.5% |
| 992 | Furthest Building You Can Reach Array, Greedy, Heap (Priority Queue) | Medium | 8 | 0.5% |
| 993 | Find Maximum Number of Non Intersecting Substrings Hash Table, String, Dynamic Programming, Greedy | Medium | 8 | 0.3% |
| 994 | Maximum Sum of Edge Values in a Graph Math, Greedy, Graph Theory | Hard | 8 | 0.4% |
| 995 | Minimum Moves to Clean the Classroom Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix | Medium | 8 | 0.3% |
| 996 | Clumsy Factorial Math, Stack, Simulation | Medium | 8 | 0.6% |
| 997 | Maximum Candies You Can Get from Boxes Array, Breadth-First Search, Graph Theory | Hard | 8 | 0.7% |
| 998 | Find the Lexicographically Largest String From the Box I Two Pointers, String, Enumeration | Medium | 8 | 0.4% |
| 999 | Number of Sub-arrays With Odd Sum Array, Math, Dynamic Programming, Prefix Sum | Medium | 8 | 0.6% |
| 1000 | Minimum Operations to Make the Array Alternating Array, Hash Table, Greedy, Counting | Medium | 8 | 0.4% |
| 1001 | Lexicographically Minimum String After Removing Stars Hash Table, String, Stack, Greedy, Heap (Priority Queue) | Medium | 8 | 0.5% |
| 1002 | Maximum Difference Between Even and Odd Frequency II String, Sliding Window, Enumeration, Prefix Sum | Hard | 8 | 0.5% |
| 1003 | Maximum Difference Between Adjacent Elements in a Circular Array Array | Easy | 8 | 0.8% |
| 1004 | Find Closest Node to Given Two Nodes Depth-First Search, Graph Theory | Medium | 8 | 0.5% |
| 1005 | Generate Tag for Video Caption String, Simulation | Easy | 8 | 0.3% |
| 1006 | Longest Happy Prefix String, Rolling Hash, String Matching, Hash Function | Hard | 8 | 0.5% |
| 1007 | Sum of k-Mirror Numbers Math, Enumeration | Hard | 8 | 0.6% |
| 1008 | Insert Greatest Common Divisors in Linked List Linked List, Math, Number Theory | Medium | 8 | 0.9% |
| 1009 | Scramble String String, Dynamic Programming | Hard | 8 | 0.4% |
| 1010 | Largest Number After Digit Swaps by Parity Sorting, Heap (Priority Queue) | Easy | 8 | 0.7% |
| 1011 | Sort the Jumbled Numbers Array, Sorting | Medium | 8 | 0.6% |
| 1012 | Find the Original Typed String II String, Dynamic Programming, Prefix Sum | Hard | 8 | 0.5% |
| 1013 | Student Attendance Record I String | Easy | 8 | 0.5% |
| 1014 | Reschedule Meetings for Maximum Free Time I Array, Greedy, Sliding Window | Medium | 8 | 0.5% |
| 1015 | Partition Array Into Three Parts With Equal Sum Array, Greedy | Easy | 8 | 0.4% |
| 1016 | Calculator with Method Chaining | Easy | 8 | 0.8% |
| 1017 | The Earliest and Latest Rounds Where Players Compete Dynamic Programming, Memoization | Hard | 8 | 0.7% |
| 1018 | Orderly Queue Math, String, Sorting | Hard | 8 | 0.7% |
| 1019 | Minimum Difference in Sums After Removal of Elements Array, Dynamic Programming, Heap (Priority Queue) | Hard | 8 | 0.7% |
| 1020 | Memoize | Medium | 8 | 0.7% |
| 1021 | Check if Two Chessboard Squares Have the Same Color Math, String | Easy | 8 | 0.7% |
| 1022 | Add Two Promises | Easy | 8 | 0.9% |
| 1023 | Maximize Subarrays After Removing One Conflicting Pair Array, Segment Tree, Enumeration, Prefix Sum | Hard | 8 | 0.6% |
| 1024 | Count Number of Maximum Bitwise-OR Subsets Array, Backtracking, Bit Manipulation, Enumeration | Medium | 8 | 0.9% |
| 1025 | Minimum Cuts to Divide a Circle Math, Geometry | Easy | 8 | 0.6% |
| 1026 | Sum of Unique Elements Array, Hash Table, Counting | Easy | 8 | 0.8% |
| 1027 | Smallest String With Swaps Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 8 | 0.6% |
| 1028 | Rearranging Fruits Array, Hash Table, Greedy, Sort | Hard | 8 | 0.6% |
| 1029 | Broken Calculator Math, Greedy | Medium | 8 | 0.6% |
| 1030 | The Number of Beautiful Subsets Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics | Medium | 8 | 0.5% |
| 1031 | Difference Between Element Sum and Digit Sum of an Array Array, Math | Easy | 8 | 0.9% |
| 1032 | The Maze Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 8 | 0.6% |
| 1033 | Range Product Queries of Powers Array, Bit Manipulation, Prefix Sum | Medium | 8 | 0.6% |
| 1034 | Number of Distinct Substrings in a String String, Trie, Rolling Hash, Suffix Array, Hash Function | Medium | 8 | 0.6% |
| 1035 | Construct Binary Tree from String String, Stack, Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.6% |
| 1036 | Pass the Pillow Math, Simulation | Easy | 8 | 0.6% |
| 1037 | Minimum Interval to Include Each Query Array, Binary Search, Sweep Line, Sorting, Heap (Priority Queue) | Hard | 8 | 0.5% |
| 1038 | Bitwise AND of Numbers Range Bit Manipulation | Medium | 8 | 0.5% |
| 1039 | Sort Items by Groups Respecting Dependencies Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 8 | 0.7% |
| 1040 | Letter Case Permutation String, Backtracking, Bit Manipulation | Medium | 8 | 0.8% |
| 1041 | Alice and Bob Playing Flower Game Math | Medium | 8 | 0.6% |
| 1042 | Find Words Containing Character Array, String | Easy | 8 | 0.9% |
| 1043 | Generate Binary Strings Without Adjacent Zeros String, Backtracking, Bit Manipulation | Medium | 8 | 0.9% |
| 1044 | Find Closest Person Math | Easy | 8 | 0.9% |
| 1045 | Choose K Elements With Maximum Sum Array, Sorting, Heap (Priority Queue) | Medium | 8 | 0.3% |
| 1046 | A Number After a Double Reversal Math | Easy | 8 | 0.8% |
| 1047 | Minimum Number of People to Teach Array, Hash Table, Greedy | Medium | 8 | 0.7% |
| 1048 | Beautiful Arrangement Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 8 | 0.6% |
| 1049 | Maximum Number of Points From Grid Queries Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix | Hard | 8 | 0.6% |
| 1050 | Reverse Nodes in Even Length Groups Linked List | Medium | 8 | 0.6% |
| 1051 | Find the Winning Player in Coin Game Math, Simulation, Game Theory | Easy | 8 | 0.5% |
| 1052 | Lexicographically Smallest Equivalent String String, Union-Find | Medium | 8 | 0.8% |
| 1053 | Find Subarrays With Equal Sum Array, Hash Table | Easy | 8 | 0.7% |
| 1054 | Fraction to Recurring Decimal Hash Table, Math, String | Medium | 8 | 0.3% |
| 1055 | Minimum Common Value Array, Hash Table, Two Pointers, Binary Search | Easy | 8 | 0.6% |
| 1056 | Maximum Palindromes After Operations Array, Hash Table, String, Greedy, Sorting, Counting | Medium | 8 | 0.5% |
| 1057 | Make Two Arrays Equal by Reversing Subarrays Array, Hash Table, Sorting | Easy | 8 | 0.8% |
| 1058 | Count Number of Bad Pairs Array, Hash Table, Math, Counting | Medium | 8 | 0.5% |
| 1059 | Dota2 Senate String, Greedy, Queue | Medium | 8 | 0.5% |
| 1060 | Adjacent Increasing Subarrays Detection I Array | Easy | 8 | 0.5% |
| 1061 | Maximum Number of Distinct Elements After Operations Array, Greedy, Sorting | Medium | 8 | 0.5% |
| 1062 | K Radius Subarray Averages Array, Sliding Window | Medium | 8 | 0.5% |
| 1063 | Robot Bounded In Circle Math, String, Simulation | Medium | 8 | 0.6% |
| 1064 | Non-negative Integers without Consecutive Ones Dynamic Programming | Hard | 8 | 0.4% |
| 1065 | Minimum Moves to Reach Target in Grid Math | Hard | 8 | 0.2% |
| 1066 | Largest Positive Integer That Exists With Its Negative Array, Hash Table, Two Pointers, Sorting | Easy | 8 | 0.7% |
| 1067 | Generate Fibonacci Sequence | Easy | 8 | 0.8% |
| 1068 | Find X-Sum of All K-Long Subarrays II Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 8 | 0.4% |
| 1069 | Number of Ways to Form a Target String Given a Dictionary Array, String, Dynamic Programming | Hard | 8 | 0.6% |
| 1070 | Minimum One Bit Operations to Make Integers Zero Math, Dynamic Programming, Bit Manipulation, Recursion, Memoization | Hard | 8 | 0.8% |
| 1071 | Tiling a Rectangle with the Fewest Squares Backtracking | Hard | 8 | 0.6% |
| 1072 | Design Tic-Tac-Toe Array, Hash Table, Design, Matrix, Simulation | Medium | 8 | 0.6% |
| 1073 | Maximum Number of Operations to Move Ones to the End String, Greedy, Counting | Medium | 8 | 0.7% |
| 1074 | Delete Duplicate Folders in System Array, Hash Table, String, Depth-First Search, Trie, Sorting, Hash Function | Hard | 8 | 0.8% |
| 1075 | Max Chunks To Make Sorted II Array, Stack, Greedy, Sorting, Monotonic Stack | Hard | 8 | 0.5% |
| 1076 | Count the Number of Substrings With Dominant Ones String, Enumeration | Medium | 8 | 0.4% |
| 1077 | Check If All 1's Are at Least Length K Places Away Array | Easy | 8 | 0.6% |
| 1078 | 1-bit and 2-bit Characters Array | Easy | 8 | 0.5% |
| 1079 | Add One Row to Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 8 | 0.6% |
| 1080 | Keep Multiplying Found Values by Two Array, Hash Table, Sorting, Simulation | Easy | 8 | 0.8% |
| 1081 | Decoded String at Index String, Stack | Medium | 8 | 0.4% |
| 1082 | Find Beautiful Indices in the Given Array I Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function | Medium | 8 | 0.4% |
| 1083 | Smallest Integer Divisible by K Hash Table, Math | Medium | 8 | 0.5% |
| 1084 | Maximum Running Time of N Computers Array, Binary Search, Greedy, Sorting | Hard | 8 | 0.6% |
| 1085 | Employee Free Time Array, Sweep Line, Sorting, Heap (Priority Queue) | Hard | 8 | 0.7% |
| 1086 | Count Partitions with Even Sum Difference Array, Math, Prefix Sum | Easy | 8 | 0.9% |
| 1087 | Closest Binary Search Tree Value Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 8 | 0.5% |
| 1088 | Tree Node Database | Medium | 8 | 0.8% |
| 1089 | Student Attendance Record II Dynamic Programming | Hard | 8 | 0.6% |
| 1090 | The Skyline Problem Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set | Hard | 8 | 0.5% |
| 1091 | Cinema Seat Allocation Array, Hash Table, Greedy, Bit Manipulation | Medium | 8 | 0.4% |
| 1092 | Put Marbles in Bags Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 8 | 0.7% |
| 1093 | Count Number of Trapezoids I Array, Hash Table, Math, Geometry | Medium | 8 | 0.5% |
| 1094 | Count Mentions Per User Array, Math, Sorting, Simulation | Medium | 8 | 0.5% |
| 1095 | Battleships in a Board Array, Depth-First Search, Matrix | Medium | 8 | 0.8% |
| 1096 | Number of Ways to Divide a Long Corridor Math, String, Dynamic Programming | Hard | 8 | 0.5% |
| 1097 | Design Spreadsheet Array, Hash Table, String, Design, Matrix | Medium | 8 | 0.7% |
| 1098 | Maximum Frequency of an Element After Performing Operations II Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Hard | 8 | 0.5% |
| 1099 | Count Square Sum Triples Math, Enumeration | Easy | 8 | 0.8% |
| 1100 | Minimum Moves to Balance Circular Array Array, Greedy, Sorting | Medium | 8 | 0.4% |
| 1101 | Delete Columns to Make Sorted II Array, String, Greedy | Medium | 8 | 0.5% |
| 1102 | Check if All A's Appears Before All B's String | Easy | 8 | 0.7% |
| 1103 | Circular Array Loop Array, Hash Table, Two Pointers | Medium | 8 | 0.4% |
| 1104 | Number of Good Paths Array, Hash Table, Tree, Union-Find, Graph Theory, Sorting | Hard | 8 | 0.6% |
| 1105 | Apple Redistribution into Boxes Array, Greedy, Sorting | Easy | 8 | 0.8% |
| 1106 | Analyze Subscription Conversion Database | Medium | 8 | 0.7% |
| 1107 | Meeting Rooms III Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Hard | 8 | 0.5% |
| 1108 | Find Minimum Cost to Remove Array Elements Array, Dynamic Programming | Medium | 8 | 0.2% |
| 1109 | Minimum Moves to Convert String String, Greedy | Easy | 8 | 0.6% |
| 1110 | Mini Parser String, Stack, Depth-First Search | Medium | 8 | 0.4% |
| 1111 | Soup Servings Math, Dynamic Programming, Probability and Statistics | Medium | 8 | 0.6% |
| 1112 | Numbers With Same Consecutive Differences Backtracking, Breadth-First Search | Medium | 8 | 0.6% |
| 1113 | Max Dot Product of Two Subsequences Array, Dynamic Programming | Hard | 8 | 0.7% |
| 1114 | Long Pressed Name Two Pointers, String | Easy | 8 | 0.3% |
| 1115 | Arithmetic Slices II - Subsequence Array, Dynamic Programming | Hard | 8 | 0.6% |
| 1116 | Find Missing Elements Array, Hash Table, Sorting | Easy | 8 | 0.8% |
| 1117 | Total Hamming Distance Array, Math, Bit Manipulation | Medium | 8 | 0.5% |
| 1118 | Number of Perfect Pairs Array, Math, Two Pointers, Sorting | Medium | 8 | 0.3% |
| 1119 | Construct the Minimum Bitwise Array I Array, Bit Manipulation | Easy | 8 | 0.9% |
| 1120 | Root Equals Sum of Children Tree, Binary Tree | Easy | 8 | 0.9% |
| 1121 | Minimum Cost Path with Edge Reversals Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 8 | 0.6% |
| 1122 | Minimize String Length Hash Table, String | Easy | 8 | 0.8% |
| 1123 | Rectangle Area Math, Geometry | Medium | 8 | 0.5% |
| 1124 | Maximum Difference Between Node and Ancestor Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.8% |
| 1125 | Find Words That Can Be Formed by Characters Array, Hash Table, String, Counting | Easy | 8 | 0.7% |
| 1126 | Find And Replace in String Array, Hash Table, String, Sorting | Medium | 8 | 0.5% |
| 1127 | Binary Gap Bit Manipulation | Easy | 8 | 0.7% |
| 1128 | Trionic Array II Array, Dynamic Programming | Hard | 8 | 0.5% |
| 1129 | Convert 1D Array Into 2D Array Array, Matrix, Simulation | Easy | 8 | 0.7% |
| 1130 | GCD of Odd and Even Sums Math, Number Theory | Easy | 8 | 0.9% |
| 1131 | Self Crossing Array, Math, Geometry | Hard | 8 | 0.4% |
| 1132 | Replace Non-Coprime Numbers in Array Array, Math, Stack, Number Theory | Hard | 8 | 0.6% |
| 1133 | Linked List Components Array, Hash Table, Linked List | Medium | 8 | 0.6% |
| 1134 | The Dining Philosophers Concurrency | Medium | 8 | 0.5% |
| 1135 | Sort Array By Parity II Array, Two Pointers, Sorting | Easy | 8 | 0.7% |
| 1136 | Max Consecutive Ones II Array, Dynamic Programming, Sliding Window | Medium | 8 | 0.5% |
| 1137 | Partition to K Equal Sum Subsets Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Medium | 8 | 0.4% |
| 1138 | Construct the Lexicographically Largest Valid Sequence Array, Backtracking | Medium | 8 | 0.7% |
| 1139 | Minimum Knight Moves Breadth-First Search | Medium | 8 | 0.4% |
| 1140 | Tenth Line Shell | Easy | 8 | 0.4% |
| 1141 | Remove Invalid Parentheses String, Backtracking, Breadth-First Search | Hard | 8 | 0.5% |
| 1142 | Select Data | Easy | 8 | 0.8% |
| 1143 | Check Digitorial Permutation Math, Counting | Medium | 8 | 0.5% |
| 1144 | Minimum Changes To Make Alternating Binary String String | Easy | 8 | 0.7% |
| 1145 | Swap Adjacent in LR String Two Pointers, String | Medium | 8 | 0.4% |
| 1146 | Find the Number of Ways to Place People I Array, Math, Geometry, Sorting, Enumeration | Medium | 8 | 0.6% |
| 1147 | Binary Tree Level Order Traversal II Tree, Breadth-First Search, Binary Tree | Medium | 8 | 0.7% |
| 1148 | The K Weakest Rows in a Matrix Array, Binary Search, Sorting, Heap (Priority Queue), Matrix | Easy | 8 | 0.7% |
| 1149 | Fancy Sequence Math, Design, Segment Tree, Number Theory | Hard | 8 | 0.4% |
| 1150 | Maximum Frequency of an Element After Performing Operations I Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Medium | 8 | 0.4% |
| 1151 | Maximum Frequency After Subarray Operation Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sum | Medium | 8 | 0.3% |
| 1152 | Daily Leads and Partners Database | Easy | 8 | 0.9% |
| 1153 | Find the Closest Palindrome Math, String | Hard | 8 | 0.3% |
| 1154 | Construct Product Matrix Array, Matrix, Prefix Sum | Medium | 8 | 0.5% |
| 1155 | Equal Sum Grid Partition I Array, Matrix, Enumeration, Prefix Sum | Medium | 8 | 0.5% |
| 1156 | Alien Dictionary Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 8 | 0.4% |
| 1157 | Count Unguarded Cells in the Grid Array, Matrix, Simulation | Medium | 8 | 0.7% |
| 1158 | Human Traffic of Stadium Database | Hard | 8 | 0.5% |
| 1159 | Maximal Score After Applying K Operations Array, Greedy, Heap (Priority Queue) | Medium | 8 | 0.6% |
| 1160 | Find the Largest Almost Missing Integer Array, Hash Table | Easy | 8 | 0.4% |
| 1161 | Maximum Ascending Subarray Sum Array | Easy | 8 | 0.7% |
| 1162 | Smallest Number in Infinite Set Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 8 | 0.7% |
| 1163 | Merge In Between Linked Lists Linked List | Medium | 8 | 0.8% |
| 1164 | Shortest Common Supersequence String, Dynamic Programming | Hard | 8 | 0.6% |
| 1165 | Minimum Distance to the Target Element Array | Easy | 8 | 0.6% |
| 1166 | Classes With at Least 5 Students Database | Easy | 8 | 0.6% |
| 1167 | Beautiful Array Array, Math, Divide and Conquer | Medium | 8 | 0.7% |
| 1168 | Frog Jump Array, Dynamic Programming | Hard | 8 | 0.5% |
| 1169 | Minimum Operations to Reduce an Integer to 0 Dynamic Programming, Greedy, Bit Manipulation | Medium | 8 | 0.6% |
| 1170 | Maximize the Distance Between Points on a Square Array, Math, Binary Search, Geometry, Sorting | Hard | 8 | 0.5% |
| 1171 | Insertion Sort List Linked List, Sorting | Medium | 8 | 0.6% |
| 1172 | Greatest Sum Divisible by Three Array, Dynamic Programming, Greedy, Sorting | Medium | 8 | 0.6% |
| 1173 | Substrings of Size Three with Distinct Characters Hash Table, String, Sliding Window, Counting | Easy | 8 | 0.8% |
| 1174 | Jump Game IX Array, Dynamic Programming | Medium | 8 | 0.5% |
| 1175 | Minimize Hamming Distance After Swap Operations Array, Depth-First Search, Union-Find | Medium | 8 | 0.7% |
| 1176 | Binary Number with Alternating Bits Bit Manipulation | Easy | 8 | 0.7% |
| 1177 | Build an Array With Stack Operations Array, Stack, Simulation | Medium | 8 | 0.8% |
| 1178 | Swapping Nodes in a Linked List Linked List, Two Pointers | Medium | 8 | 0.7% |
| 1179 | Design Snake Game Array, Hash Table, Design, Queue, Simulation | Medium | 8 | 0.4% |
| 1180 | Minimum Moves to Equal Array Elements Array, Math | Medium | 8 | 0.6% |
| 1181 | Design Bounded Blocking Queue Concurrency | Medium | 8 | 0.7% |
| 1182 | Three Divisors Math, Enumeration, Number Theory | Easy | 8 | 0.6% |
| 1183 | Number of Boomerangs Array, Hash Table, Math | Medium | 8 | 0.6% |
| 1184 | Check If Array Pairs Are Divisible by k Array, Hash Table, Counting | Medium | 8 | 0.5% |
| 1185 | Number of Unique Subjects Taught by Each Teacher Database | Easy | 8 | 0.9% |
| 1186 | Range Addition II Array, Math | Easy | 8 | 0.6% |
| 1187 | Minimum Number of Coins to be Added Array, Greedy, Sorting | Medium | 8 | 0.6% |
| 1188 | Get Equal Substrings Within Budget String, Binary Search, Sliding Window, Prefix Sum | Medium | 8 | 0.6% |
| 1189 | Minimum Jumps to Reach Home Array, Hash Table, Breadth-First Search | Medium | 8 | 0.3% |
| 1190 | Reverse Words in a String III Two Pointers, String | Easy | 8 | 0.8% |
| 1191 | Weighted Word Mapping Array, String, Simulation | Easy | 8 | 0.9% |
| 1192 | Stock Price Fluctuation Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set | Medium | 8 | 0.5% |
| 1193 | Maximum Ice Cream Bars Array, Greedy, Sorting, Counting Sort | Medium | 8 | 0.8% |
| 1194 | Maximum Number of Balloons Hash Table, String, Counting | Easy | 8 | 0.6% |
| 1195 | Minimum Swaps To Make Sequences Increasing Array, Dynamic Programming | Hard | 8 | 0.4% |
| 1196 | Number of ZigZag Arrays I Dynamic Programming, Prefix Sum | Hard | 8 | 0.5% |
| 1197 | Count the Number of Inversions Array, Dynamic Programming | Hard | 8 | 0.3% |
| 1198 | Word Frequency Shell | Medium | 8 | 0.3% |
| 1199 | Employee Importance Array, Hash Table, Tree, Depth-First Search, Breadth-First Search | Medium | 8 | 0.7% |
| 1200 | Count Square Submatrices with All Ones Array, Dynamic Programming, Matrix | Medium | 8 | 0.8% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.