Google LeetCode Questions
2305 questions all-time · 601 easy · 1205 medium · 499 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Two Sum Array, Hash Table | Easy | 100 | 0.6% |
| 2 | Add Two Numbers Linked List, Math, Recursion | Medium | 78 | 0.5% |
| 3 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 74 | 0.5% |
| 4 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 74 | 0.7% |
| 5 | Longest Common Prefix Array, String, Trie | Easy | 73 | 0.5% |
| 6 | Palindrome Number Math | Easy | 73 | 0.6% |
| 7 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 73 | 0.6% |
| 8 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 72 | 0.4% |
| 9 | 3Sum Array, Two Pointers, Sorting | Medium | 72 | 0.4% |
| 10 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 72 | 0.6% |
| 11 | Create Hello World Function | Easy | 72 | 0.8% |
| 12 | Merge Strings Alternately Two Pointers, String | Easy | 71 | 0.8% |
| 13 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 70 | 0.4% |
| 14 | Longest Consecutive Sequence Array, Hash Table, Union-Find | Medium | 69 | 0.5% |
| 15 | Recyclable and Low Fat Products Database | Easy | 68 | 0.9% |
| 16 | Container With Most Water Array, Two Pointers, Greedy | Medium | 68 | 0.6% |
| 17 | Valid Parentheses String, Stack | Easy | 66 | 0.4% |
| 18 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 66 | 0.7% |
| 19 | Roman to Integer Hash Table, Math, String | Easy | 66 | 0.7% |
| 20 | Merge Intervals Array, Sorting | Medium | 66 | 0.5% |
| 21 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 66 | 0.6% |
| 22 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 65 | 0.5% |
| 23 | Reverse Integer Math | Medium | 65 | 0.3% |
| 24 | Remove Duplicates from Sorted Array Array, Two Pointers | Easy | 65 | 0.6% |
| 25 | Subarray Sum Equals K Array, Hash Table, Prefix Sum | Medium | 65 | 0.5% |
| 26 | Climbing Stairs Math, Dynamic Programming, Memoization | Easy | 64 | 0.5% |
| 27 | Merge Two Sorted Lists Linked List, Recursion | Easy | 61 | 0.7% |
| 28 | Next Permutation Array, Two Pointers | Medium | 61 | 0.5% |
| 29 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 61 | 0.8% |
| 30 | Spiral Matrix Array, Matrix, Simulation | Medium | 60 | 0.6% |
| 31 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 60 | 0.5% |
| 32 | Reverse Linked List Linked List, Recursion | Easy | 59 | 0.8% |
| 33 | Decode String String, Stack, Recursion | Medium | 59 | 0.6% |
| 34 | Add Two Integers Math | Easy | 59 | 0.9% |
| 35 | Remove Element Array, Two Pointers | Easy | 58 | 0.6% |
| 36 | Koko Eating Bananas Array, Binary Search | Medium | 58 | 0.5% |
| 37 | Search in Rotated Sorted Array Array, Binary Search | Medium | 58 | 0.5% |
| 38 | Move Zeroes Array, Two Pointers | Easy | 58 | 0.6% |
| 39 | Pascal's Triangle Array, Dynamic Programming | Easy | 58 | 0.8% |
| 40 | Minimum Number of Increments on Subarrays to Form a Target Array Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | Hard | 58 | 0.8% |
| 41 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 58 | 0.5% |
| 42 | 4Sum Array, Two Pointers, Sorting | Medium | 57 | 0.4% |
| 43 | Single Number Array, Bit Manipulation | Easy | 57 | 0.8% |
| 44 | N-Queens Array, Backtracking | Hard | 57 | 0.8% |
| 45 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 57 | 0.5% |
| 46 | Jump Game Array, Dynamic Programming, Greedy | Medium | 57 | 0.4% |
| 47 | Letter Combinations of a Phone Number Hash Table, String, Backtracking | Medium | 57 | 0.7% |
| 48 | Concatenation of Array Array, Simulation | Easy | 57 | 0.9% |
| 49 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 57 | 0.6% |
| 50 | Find Peak Element Array, Binary Search | Medium | 57 | 0.5% |
| 51 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 57 | 0.7% |
| 52 | Rotate Array Array, Math, Two Pointers | Medium | 56 | 0.5% |
| 53 | Valid Anagram Hash Table, String, Sorting | Easy | 56 | 0.7% |
| 54 | Find the Index of the First Occurrence in a String Two Pointers, String, String Matching | Easy | 56 | 0.5% |
| 55 | House Robber Array, Dynamic Programming | Medium | 56 | 0.5% |
| 56 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 56 | 0.7% |
| 57 | Rotate Image Array, Math, Matrix | Medium | 56 | 0.8% |
| 58 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 56 | 0.7% |
| 59 | Search Insert Position Array, Binary Search | Easy | 55 | 0.5% |
| 60 | Plus One Array, Math | Easy | 55 | 0.5% |
| 61 | Viewers Turned Streamers Database | Hard | 55 | 0.4% |
| 62 | Logger Rate Limiter Hash Table, Design, Data Stream | Easy | 54 | 0.8% |
| 63 | Max Consecutive Ones Array | Easy | 54 | 0.7% |
| 64 | Sort Colors Array, Two Pointers, Sorting | Medium | 54 | 0.7% |
| 65 | Pow(x, n) Math, Recursion | Medium | 54 | 0.4% |
| 66 | Happy Number Hash Table, Math, Two Pointers | Easy | 54 | 0.6% |
| 67 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 54 | 0.5% |
| 68 | Product of Array Except Self Array, Prefix Sum | Medium | 54 | 0.7% |
| 69 | Longest Repeating Character Replacement Hash Table, String, Sliding Window | Medium | 54 | 0.6% |
| 70 | Single Element in a Sorted Array Array, Binary Search | Medium | 54 | 0.6% |
| 71 | Add Binary Math, String, Bit Manipulation, Simulation | Easy | 53 | 0.6% |
| 72 | Zigzag Conversion String | Medium | 53 | 0.5% |
| 73 | Russian Doll Envelopes Array, Binary Search, Dynamic Programming, Sorting | Hard | 53 | 0.4% |
| 74 | Combine Two Tables Database | Easy | 53 | 0.8% |
| 75 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 53 | 0.6% |
| 76 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 53 | 0.3% |
| 77 | Power of Two Math, Bit Manipulation, Recursion | Easy | 53 | 0.5% |
| 78 | Number of Visible People in a Queue Array, Stack, Monotonic Stack | Hard | 53 | 0.7% |
| 79 | Set Matrix Zeroes Array, Hash Table, Matrix | Medium | 52 | 0.6% |
| 80 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 52 | 0.5% |
| 81 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 52 | 0.5% |
| 82 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 52 | 0.5% |
| 83 | Subsets Array, Backtracking, Bit Manipulation | Medium | 52 | 0.8% |
| 84 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 52 | 0.5% |
| 85 | Binary Search Array, Binary Search | Easy | 51 | 0.6% |
| 86 | Valid Palindrome Two Pointers, String | Easy | 51 | 0.5% |
| 87 | Basic Calculator Math, String, Stack, Recursion | Hard | 51 | 0.5% |
| 88 | Maximal Rectangle Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Hard | 51 | 0.6% |
| 89 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 51 | 0.6% |
| 90 | Remove Nth Node From End of List Linked List, Two Pointers | Medium | 51 | 0.5% |
| 91 | Contains Duplicate Array, Hash Table, Sorting | Easy | 51 | 0.6% |
| 92 | Min Stack Stack, Design | Medium | 51 | 0.6% |
| 93 | Intersection of Two Arrays Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 51 | 0.8% |
| 94 | Permutations Array, Backtracking | Medium | 51 | 0.8% |
| 95 | Unique Paths Math, Dynamic Programming, Combinatorics | Medium | 50 | 0.7% |
| 96 | Sqrt(x) Math, Binary Search | Easy | 50 | 0.4% |
| 97 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 50 | 0.6% |
| 98 | Maximum Product Subarray Array, Dynamic Programming | Medium | 50 | 0.4% |
| 99 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 49 | 0.5% |
| 100 | Count Number of Trapezoids II Array, Hash Table, Math, Geometry | Hard | 49 | 0.4% |
| 101 | 3Sum Closest Array, Two Pointers, Sorting | Medium | 49 | 0.5% |
| 102 | Palindrome Linked List Linked List, Two Pointers, Stack, Recursion | Easy | 49 | 0.6% |
| 103 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 49 | 0.4% |
| 104 | First Missing Positive Array, Hash Table | Hard | 49 | 0.4% |
| 105 | Max Consecutive Ones III Array, Binary Search, Sliding Window, Prefix Sum | Medium | 48 | 0.7% |
| 106 | Two Sum II - Input Array Is Sorted Array, Two Pointers, Binary Search | Medium | 48 | 0.7% |
| 107 | Fruit Into Baskets Array, Hash Table, Sliding Window | Medium | 48 | 0.5% |
| 108 | Reverse Words in a String Two Pointers, String | Medium | 48 | 0.6% |
| 109 | Insert Delete GetRandom O(1) Array, Hash Table, Math, Design, Randomized | Medium | 48 | 0.6% |
| 110 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 48 | 0.7% |
| 111 | Middle of the Linked List Linked List, Two Pointers | Easy | 48 | 0.8% |
| 112 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 47 | 0.7% |
| 113 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 47 | 0.4% |
| 114 | Find All Numbers Disappeared in an Array Array, Hash Table | Easy | 47 | 0.6% |
| 115 | The Earliest Moment When Everyone Become Friends Array, Union-Find, Sorting | Medium | 47 | 0.7% |
| 116 | Valid Sudoku Array, Hash Table, Matrix | Medium | 47 | 0.6% |
| 117 | Candy Array, Greedy | Hard | 47 | 0.5% |
| 118 | Linked List Cycle Hash Table, Linked List, Two Pointers | Easy | 47 | 0.5% |
| 119 | Contains Duplicate II Array, Hash Table, Sliding Window | Easy | 47 | 0.5% |
| 120 | Reverse Nodes in k-Group Linked List, Recursion | Hard | 47 | 0.7% |
| 121 | Zero Array Transformation I Array, Prefix Sum | Medium | 47 | 0.5% |
| 122 | Partition Equal Subset Sum Array, Dynamic Programming | Medium | 47 | 0.5% |
| 123 | Combination Sum Array, Backtracking | Medium | 47 | 0.8% |
| 124 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 47 | 0.7% |
| 125 | Running Sum of 1d Array Array, Prefix Sum | Easy | 47 | 0.9% |
| 126 | Same Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 46 | 0.7% |
| 127 | Guess the Word Array, Math, String, Interactive, Game Theory | Hard | 46 | 0.4% |
| 128 | Remove K Digits String, Stack, Greedy, Monotonic Stack | Medium | 46 | 0.4% |
| 129 | Edit Distance String, Dynamic Programming | Medium | 46 | 0.6% |
| 130 | Count Primes Array, Math, Enumeration, Number Theory | Medium | 46 | 0.4% |
| 131 | Peak Index in a Mountain Array Array, Binary Search | Medium | 46 | 0.7% |
| 132 | Fibonacci Number Math, Dynamic Programming, Recursion, Memoization | Easy | 46 | 0.7% |
| 133 | Separate Squares I Array, Binary Search | Medium | 46 | 0.6% |
| 134 | Insert Interval Array | Medium | 46 | 0.5% |
| 135 | Length of Last Word String | Easy | 46 | 0.6% |
| 136 | Rotate List Linked List, Two Pointers | Medium | 46 | 0.4% |
| 137 | Text Justification Array, String, Simulation | Hard | 46 | 0.5% |
| 138 | Isomorphic Strings Hash Table, String | Easy | 46 | 0.5% |
| 139 | Reverse Vowels of a String Two Pointers, String | Easy | 46 | 0.6% |
| 140 | Sum of Subarray Minimums Array, Dynamic Programming, Stack, Monotonic Stack | Medium | 46 | 0.4% |
| 141 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 45 | 0.5% |
| 142 | Sort an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sort | Medium | 45 | 0.6% |
| 143 | Missing Number Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | Easy | 45 | 0.7% |
| 144 | Palindrome Partitioning String, Dynamic Programming, Backtracking | Medium | 45 | 0.7% |
| 145 | Minimum Area Rectangle Array, Hash Table, Math, Geometry, Sorting | Medium | 45 | 0.6% |
| 146 | Count Number of Trapezoids I Array, Hash Table, Math, Geometry | Medium | 45 | 0.5% |
| 147 | Second Highest Salary Database | Medium | 45 | 0.5% |
| 148 | Find the Duplicate Number Array, Two Pointers, Binary Search, Bit Manipulation | Medium | 45 | 0.6% |
| 149 | Next Greater Element II Array, Stack, Monotonic Stack | Medium | 45 | 0.7% |
| 150 | Diameter of Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 45 | 0.7% |
| 151 | Create a DataFrame from List | Easy | 45 | 0.8% |
| 152 | Wildcard Matching String, Dynamic Programming, Greedy, Recursion | Hard | 44 | 0.3% |
| 153 | Subsets II Array, Backtracking, Bit Manipulation | Medium | 44 | 0.6% |
| 154 | Reverse Pairs Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 44 | 0.3% |
| 155 | Random Pick with Weight Array, Math, Binary Search, Prefix Sum, Randomized | Medium | 44 | 0.5% |
| 156 | Capacity To Ship Packages Within D Days Array, Binary Search | Medium | 44 | 0.7% |
| 157 | Unique Number of Occurrences Array, Hash Table | Easy | 44 | 0.8% |
| 158 | Maximum Average Subarray I Array, Sliding Window | Easy | 44 | 0.5% |
| 159 | Article Views I Database | Easy | 44 | 0.8% |
| 160 | Check if Array Is Sorted and Rotated Array | Easy | 44 | 0.6% |
| 161 | Reverse String Two Pointers, String | Easy | 43 | 0.8% |
| 162 | Divide Two Integers Math, Bit Manipulation | Medium | 43 | 0.2% |
| 163 | Surrounded Regions Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 43 | 0.5% |
| 164 | Largest Number Array, String, Greedy, Sorting | Medium | 43 | 0.4% |
| 165 | Big Countries Database | Easy | 43 | 0.7% |
| 166 | Range Module Design, Segment Tree, Ordered Set | Hard | 43 | 0.5% |
| 167 | String to Integer (atoi) String | Medium | 43 | 0.2% |
| 168 | Power of Three Math, Recursion | Easy | 43 | 0.5% |
| 169 | Target Sum Array, Dynamic Programming, Backtracking | Medium | 43 | 0.5% |
| 170 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 43 | 0.5% |
| 171 | String Compression Two Pointers, String | Medium | 43 | 0.6% |
| 172 | Find Customer Referee Database | Easy | 43 | 0.7% |
| 173 | Integer to Roman Hash Table, Math, String | Medium | 43 | 0.7% |
| 174 | Move Pieces to Obtain a String Two Pointers, String | Medium | 43 | 0.6% |
| 175 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 43 | 0.5% |
| 176 | Search a 2D Matrix II Array, Binary Search, Divide and Conquer, Matrix | Medium | 43 | 0.6% |
| 177 | Pacific Atlantic Water Flow Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 43 | 0.6% |
| 178 | Permutation in String Hash Table, Two Pointers, String, Sliding Window | Medium | 43 | 0.5% |
| 179 | Squares of a Sorted Array Array, Two Pointers, Sorting | Easy | 43 | 0.7% |
| 180 | Finding MK Average Design, Queue, Heap (Priority Queue), Data Stream, Ordered Set | Hard | 43 | 0.4% |
| 181 | Apply Substitutions Array, Hash Table, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 43 | 0.8% |
| 182 | Search a 2D Matrix Array, Binary Search, Matrix | Medium | 42 | 0.5% |
| 183 | First Unique Character in a String Hash Table, String, Queue, Counting | Easy | 42 | 0.7% |
| 184 | Binary Tree Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 42 | 0.7% |
| 185 | Invert Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 42 | 0.8% |
| 186 | Meeting Rooms III Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Hard | 42 | 0.5% |
| 187 | Find the Difference Hash Table, String, Bit Manipulation, Sorting | Easy | 42 | 0.6% |
| 188 | Greatest Common Divisor of Strings Math, String | Easy | 42 | 0.5% |
| 189 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 42 | 0.5% |
| 190 | Rising Temperature Database | Easy | 42 | 0.5% |
| 191 | Lowest Common Ancestor of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 42 | 0.7% |
| 192 | Number of Provinces Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 42 | 0.7% |
| 193 | Frequency of the Most Frequent Element Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 42 | 0.4% |
| 194 | Next Greater Element I Array, Hash Table, Stack, Monotonic Stack | Easy | 41 | 0.8% |
| 195 | Remove Duplicates from Sorted List Linked List | Easy | 41 | 0.6% |
| 196 | Employees Earning More Than Their Managers Database | Easy | 41 | 0.7% |
| 197 | Majority Element II Array, Hash Table, Sorting, Counting | Medium | 41 | 0.6% |
| 198 | Burst Balloons Array, Dynamic Programming | Hard | 41 | 0.6% |
| 199 | Delete Nodes And Return Forest Array, Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 41 | 0.7% |
| 200 | Kth Smallest Element in a BST Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 41 | 0.8% |
| 201 | Swap Adjacent in LR String Two Pointers, String | Medium | 41 | 0.4% |
| 202 | Symmetric Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 41 | 0.6% |
| 203 | Minimum Size Subarray Sum Array, Binary Search, Sliding Window, Prefix Sum | Medium | 41 | 0.5% |
| 204 | Is Subsequence Two Pointers, String, Dynamic Programming | Easy | 41 | 0.5% |
| 205 | Maximum Width Ramp Array, Two Pointers, Stack, Monotonic Stack | Medium | 41 | 0.6% |
| 206 | Largest Divisible Subset Array, Math, Dynamic Programming, Sorting | Medium | 40 | 0.5% |
| 207 | Add Strings Math, String, Simulation | Easy | 40 | 0.5% |
| 208 | Sort List Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort | Medium | 40 | 0.6% |
| 209 | Intersection of Two Linked Lists Hash Table, Linked List, Two Pointers | Easy | 40 | 0.6% |
| 210 | Swim in Rising Water Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Hard | 40 | 0.7% |
| 211 | Minimum Number of Days to Make m Bouquets Array, Binary Search | Medium | 40 | 0.6% |
| 212 | Clone Graph Hash Table, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 40 | 0.7% |
| 213 | 24 Game Array, Math, Backtracking | Hard | 40 | 0.6% |
| 214 | Count Good Numbers Math, Recursion | Medium | 40 | 0.6% |
| 215 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 40 | 0.4% |
| 216 | Remove Duplicates from Sorted Array II Array, Two Pointers | Medium | 40 | 0.6% |
| 217 | Gas Station Array, Greedy | Medium | 40 | 0.5% |
| 218 | First Bad Version Binary Search, Interactive | Easy | 40 | 0.5% |
| 219 | Perfect Squares Math, Dynamic Programming, Breadth-First Search | Medium | 40 | 0.6% |
| 220 | Odd Even Linked List Linked List | Medium | 40 | 0.6% |
| 221 | Task Scheduler Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 40 | 0.6% |
| 222 | Find K Closest Elements Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue) | Medium | 40 | 0.5% |
| 223 | Copy List with Random Pointer Hash Table, Linked List | Medium | 39 | 0.6% |
| 224 | Trapping Rain Water II Array, Breadth-First Search, Heap (Priority Queue), Matrix | Hard | 39 | 0.6% |
| 225 | Rotate String String, String Matching | Easy | 39 | 0.7% |
| 226 | Longest Common Subsequence String, Dynamic Programming | Medium | 39 | 0.6% |
| 227 | Reverse Linked List II Linked List | Medium | 39 | 0.5% |
| 228 | Binary Tree Inorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 39 | 0.8% |
| 229 | Binary Tree Zigzag Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 39 | 0.6% |
| 230 | Summary Ranges Array | Easy | 39 | 0.5% |
| 231 | Ransom Note Hash Table, String, Counting | Easy | 39 | 0.7% |
| 232 | Fizz Buzz Math, String, Simulation | Easy | 39 | 0.8% |
| 233 | Zero Array Transformation II Array, Two Pointers, Binary Search, Prefix Sum | Medium | 39 | 0.4% |
| 234 | Single Number II Array, Bit Manipulation | Medium | 39 | 0.7% |
| 235 | Reorder List Linked List, Two Pointers, Stack, Recursion | Medium | 39 | 0.7% |
| 236 | Shortest Palindrome String, Rolling Hash, String Matching, Hash Function | Hard | 39 | 0.4% |
| 237 | Implement Stack using Queues Stack, Design, Queue | Easy | 39 | 0.7% |
| 238 | Find Minimum in Rotated Sorted Array Array, Binary Search | Medium | 39 | 0.5% |
| 239 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 39 | 0.6% |
| 240 | Longest Increasing Path in a Matrix Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix | Hard | 39 | 0.6% |
| 241 | 01 Matrix Array, Dynamic Programming, Breadth-First Search, Matrix | Medium | 39 | 0.5% |
| 242 | Asteroid Collision Array, Stack, Simulation | Medium | 39 | 0.5% |
| 243 | Average Time of Process per Machine Database | Easy | 39 | 0.7% |
| 244 | Group Shifted Strings Array, Hash Table, String | Medium | 38 | 0.7% |
| 245 | Counter | Easy | 38 | 0.8% |
| 246 | Swap Nodes in Pairs Linked List, Recursion | Medium | 38 | 0.7% |
| 247 | Search in Rotated Sorted Array II Array, Binary Search | Medium | 38 | 0.4% |
| 248 | Coin Change II Array, Dynamic Programming | Medium | 38 | 0.6% |
| 249 | Can Place Flowers Array, Greedy | Easy | 38 | 0.3% |
| 250 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 38 | 0.6% |
| 251 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 38 | 0.5% |
| 252 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path | Medium | 38 | 0.6% |
| 253 | Evaluate Reverse Polish Notation Array, Math, Stack | Medium | 38 | 0.6% |
| 254 | Expression Add Operators Math, String, Backtracking | Hard | 38 | 0.4% |
| 255 | Sum of Two Integers Math, Bit Manipulation | Medium | 38 | 0.6% |
| 256 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 38 | 0.5% |
| 257 | Minimum Area Rectangle II Array, Hash Table, Math, Geometry | Medium | 38 | 0.6% |
| 258 | Count Square Submatrices with All Ones Array, Dynamic Programming, Matrix | Medium | 38 | 0.8% |
| 259 | Find Missing and Repeated Values Array, Hash Table, Math, Matrix | Easy | 38 | 0.8% |
| 260 | Number of Islands II Array, Hash Table, Union-Find | Hard | 37 | 0.4% |
| 261 | Valid Palindrome II Two Pointers, String, Greedy | Easy | 37 | 0.4% |
| 262 | Odd Even Jump Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set | Hard | 37 | 0.4% |
| 263 | Find All Possible Recipes from Given Supplies Array, Hash Table, String, Graph Theory, Topological Sort | Medium | 37 | 0.6% |
| 264 | Lexicographically Smallest Beautiful String String, Greedy | Hard | 37 | 0.4% |
| 265 | Permutation Sequence Math, Recursion | Hard | 37 | 0.5% |
| 266 | Maximum Depth of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 37 | 0.8% |
| 267 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 37 | 0.7% |
| 268 | House Robber II Array, Dynamic Programming | Medium | 37 | 0.5% |
| 269 | Find All Duplicates in an Array Array, Hash Table, Sorting | Medium | 37 | 0.8% |
| 270 | Race Car Dynamic Programming | Hard | 37 | 0.4% |
| 271 | Online Stock Span Stack, Design, Monotonic Stack, Data Stream | Medium | 37 | 0.7% |
| 272 | Path With Minimum Effort Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Medium | 37 | 0.6% |
| 273 | Can Make Arithmetic Progression From Sequence Array, Sorting | Easy | 37 | 0.7% |
| 274 | Word Search II Array, String, Backtracking, Trie, Matrix | Hard | 37 | 0.4% |
| 275 | Moving Average from Data Stream Array, Design, Queue, Data Stream | Easy | 37 | 0.8% |
| 276 | Cheapest Flights Within K Stops Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 37 | 0.4% |
| 277 | Binary Subarrays With Sum Array, Hash Table, Sliding Window, Prefix Sum | Medium | 37 | 0.7% |
| 278 | Simplify Path String, Stack | Medium | 37 | 0.5% |
| 279 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 37 | 0.6% |
| 280 | Alien Dictionary Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 37 | 0.4% |
| 281 | Contiguous Array Array, Hash Table, Prefix Sum | Medium | 37 | 0.5% |
| 282 | Number of Matching Subsequences Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sorting | Medium | 37 | 0.5% |
| 283 | Minimum Path Sum Array, Dynamic Programming, Matrix | Medium | 36 | 0.7% |
| 284 | Network Delay Time Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 36 | 0.6% |
| 285 | Multiply Strings Math, String, Simulation | Medium | 36 | 0.4% |
| 286 | Linked List Cycle II Hash Table, Linked List, Two Pointers | Medium | 36 | 0.6% |
| 287 | Implement Queue using Stacks Stack, Design, Queue | Easy | 36 | 0.7% |
| 288 | Add Digits Math, Simulation, Number Theory | Easy | 36 | 0.7% |
| 289 | Assign Cookies Array, Two Pointers, Greedy, Sorting | Easy | 36 | 0.6% |
| 290 | Employee Bonus Database | Easy | 36 | 0.8% |
| 291 | Redundant Connection Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 36 | 0.7% |
| 292 | Maximum Swap Math, Greedy | Medium | 36 | 0.5% |
| 293 | Minimum Number of Operations to Move All Balls to Each Box Array, String, Prefix Sum | Medium | 36 | 0.9% |
| 294 | Minimum Time to Finish the Race Array, Dynamic Programming | Hard | 36 | 0.4% |
| 295 | Validate Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 36 | 0.4% |
| 296 | Construct Binary Tree from Preorder and Inorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 36 | 0.7% |
| 297 | Delete Node in a Linked List Linked List | Medium | 36 | 0.8% |
| 298 | H-Index Array, Sorting, Counting Sort | Medium | 36 | 0.4% |
| 299 | Design Hit Counter Array, Binary Search, Design, Queue, Data Stream | Medium | 36 | 0.7% |
| 300 | Find K Pairs with Smallest Sums Array, Heap (Priority Queue) | Medium | 36 | 0.4% |
| 301 | Repeated Substring Pattern String, String Matching | Easy | 36 | 0.5% |
| 302 | Diagonal Traverse Array, Matrix, Simulation | Medium | 36 | 0.7% |
| 303 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 36 | 0.6% |
| 304 | Find And Replace in String Array, Hash Table, String, Sorting | Medium | 36 | 0.5% |
| 305 | Min Cost Climbing Stairs Array, Dynamic Programming | Easy | 35 | 0.7% |
| 306 | Substring with Concatenation of All Words Hash Table, String, Sliding Window | Hard | 35 | 0.3% |
| 307 | Triangle Array, Dynamic Programming | Medium | 35 | 0.6% |
| 308 | Managers with at Least 5 Direct Reports Database | Medium | 35 | 0.5% |
| 309 | Domino and Tromino Tiling Dynamic Programming | Medium | 35 | 0.5% |
| 310 | Vertical Order Traversal of a Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Hard | 35 | 0.5% |
| 311 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 35 | 0.4% |
| 312 | Kth Missing Positive Number Array, Binary Search | Easy | 35 | 0.6% |
| 313 | Best Time to Buy and Sell Stock with Cooldown Array, Dynamic Programming | Medium | 35 | 0.6% |
| 314 | Combination Sum IV Array, Dynamic Programming | Medium | 35 | 0.6% |
| 315 | Reverse String II Two Pointers, String | Easy | 35 | 0.5% |
| 316 | Set Mismatch Array, Hash Table, Bit Manipulation, Sorting | Easy | 35 | 0.4% |
| 317 | Richest Customer Wealth Array, Matrix | Easy | 35 | 0.9% |
| 318 | Detect Squares Array, Hash Table, Design, Counting, Data Stream | Medium | 35 | 0.5% |
| 319 | Find Longest Special Substring That Occurs Thrice I Hash Table, String, Binary Search, Sliding Window, Counting | Medium | 35 | 0.6% |
| 320 | Rearrange Array Elements by Sign Array, Two Pointers, Simulation | Medium | 35 | 0.8% |
| 321 | Integer to English Words Math, String, Recursion | Hard | 35 | 0.4% |
| 322 | Remove Duplicate Letters String, Stack, Greedy, Monotonic Stack | Medium | 35 | 0.5% |
| 323 | Find Eventual Safe States Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 35 | 0.7% |
| 324 | Backspace String Compare Two Pointers, String, Stack, Simulation | Easy | 35 | 0.5% |
| 325 | Shuffle the Array Array | Easy | 35 | 0.9% |
| 326 | Single-Threaded CPU Array, Sorting, Heap (Priority Queue) | Medium | 35 | 0.5% |
| 327 | The Skyline Problem Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set | Hard | 34 | 0.5% |
| 328 | Count of Smaller Numbers After Self Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 34 | 0.4% |
| 329 | Exclusive Time of Functions Array, Stack | Medium | 34 | 0.7% |
| 330 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 34 | 0.5% |
| 331 | Rank Transform of an Array Array, Hash Table, Sorting | Easy | 34 | 0.7% |
| 332 | Number of Closed Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 34 | 0.7% |
| 333 | The Latest Time to Catch a Bus Array, Two Pointers, Binary Search, Sorting | Medium | 34 | 0.3% |
| 334 | Find the Safest Path in a Grid Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Medium | 34 | 0.5% |
| 335 | Count Days Without Meetings Array, Sorting | Medium | 34 | 0.5% |
| 336 | Combination Sum II Array, Backtracking | Medium | 34 | 0.6% |
| 337 | Balanced Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 34 | 0.6% |
| 338 | Nth Digit Math, Binary Search | Medium | 34 | 0.4% |
| 339 | Sort Characters By Frequency Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting | Medium | 34 | 0.8% |
| 340 | Kth Largest Element in a Stream Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream | Easy | 34 | 0.6% |
| 341 | Soup Servings Math, Dynamic Programming, Probability and Statistics | Medium | 34 | 0.6% |
| 342 | Car Fleet Array, Stack, Sorting, Monotonic Stack | Medium | 34 | 0.6% |
| 343 | Transpose Matrix Array, Matrix, Simulation | Easy | 34 | 0.8% |
| 344 | Subarrays with K Different Integers Array, Hash Table, Sliding Window, Counting | Hard | 34 | 0.7% |
| 345 | Remove Outermost Parentheses String, Stack | Easy | 34 | 0.9% |
| 346 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 34 | 0.5% |
| 347 | Score of a String String | Easy | 34 | 0.9% |
| 348 | Average Selling Price Database | Easy | 34 | 0.4% |
| 349 | Next Special Palindrome Number Backtracking, Bit Manipulation | Hard | 34 | 0.3% |
| 350 | Fraction to Recurring Decimal Hash Table, Math, String | Medium | 33 | 0.3% |
| 351 | Binary Tree Right Side View Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 33 | 0.7% |
| 352 | Binary Tree Paths String, Backtracking, Tree, Depth-First Search, Binary Tree | Easy | 33 | 0.7% |
| 353 | Linked List Random Node Linked List, Math, Reservoir Sampling, Randomized | Medium | 33 | 0.6% |
| 354 | Sequence Reconstruction Array, Graph Theory, Topological Sort | Medium | 33 | 0.3% |
| 355 | Shortest Unsorted Continuous Subarray Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack | Medium | 33 | 0.4% |
| 356 | Minimum Weighted Subgraph With the Required Paths Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 33 | 0.4% |
| 357 | Height of Binary Tree After Subtree Removal Queries Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Hard | 33 | 0.5% |
| 358 | Maximum XOR of Two Numbers in an Array Array, Hash Table, Bit Manipulation, Trie | Medium | 33 | 0.5% |
| 359 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 33 | 0.7% |
| 360 | Continuous Subarrays Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Medium | 33 | 0.6% |
| 361 | Maximum Points You Can Obtain from Cards Array, Sliding Window, Prefix Sum | Medium | 33 | 0.6% |
| 362 | Find Pivot Index Array, Prefix Sum | Easy | 33 | 0.6% |
| 363 | Find X-Sum of All K-Long Subarrays I Array, Hash Table, Sliding Window, Heap (Priority Queue) | Easy | 33 | 0.8% |
| 364 | Flatten Binary Tree to Linked List Linked List, Stack, Tree, Depth-First Search, Binary Tree | Medium | 33 | 0.7% |
| 365 | Reconstruct Itinerary Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit | Hard | 33 | 0.4% |
| 366 | Android Unlock Patterns Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 33 | 0.5% |
| 367 | Champagne Tower Dynamic Programming | Medium | 33 | 0.6% |
| 368 | Sum of Distances in Tree Dynamic Programming, Tree, Depth-First Search, Graph Theory | Hard | 33 | 0.7% |
| 369 | Minimum Cost to Make at Least One Valid Path in a Grid Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Hard | 33 | 0.7% |
| 370 | Unique Length-3 Palindromic Subsequences Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 33 | 0.7% |
| 371 | Detonate the Maximum Bombs Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry | Medium | 33 | 0.5% |
| 372 | Design a Number Container System Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 33 | 0.6% |
| 373 | Count and Say String | Medium | 33 | 0.6% |
| 374 | Partition List Linked List, Two Pointers | Medium | 33 | 0.6% |
| 375 | Convert Sorted Array to Binary Search Tree Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Easy | 33 | 0.8% |
| 376 | Remove Linked List Elements Linked List, Recursion | Easy | 33 | 0.5% |
| 377 | Encode and Decode Strings Array, String, Design | Medium | 33 | 0.5% |
| 378 | Find All Anagrams in a String Hash Table, String, Sliding Window | Medium | 33 | 0.5% |
| 379 | Design a Stack With Increment Operation Array, Stack, Design | Medium | 33 | 0.8% |
| 380 | Replace Employee ID With The Unique Identifier Database | Easy | 33 | 0.8% |
| 381 | Customer Who Visited but Did Not Make Any Transactions Database | Easy | 33 | 0.7% |
| 382 | Type of Triangle Array, Math, Sorting | Easy | 33 | 0.4% |
| 383 | Combinations Backtracking | Medium | 32 | 0.7% |
| 384 | Top K Frequent Words Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting | Medium | 32 | 0.6% |
| 385 | Shortest Path Visiting All Nodes Dynamic Programming, Bit Manipulation, Breadth-First Search, Graph Theory, Bitmask | Hard | 32 | 0.7% |
| 386 | Maximum Candies Allocated to K Children Array, Binary Search | Medium | 32 | 0.5% |
| 387 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Medium | 32 | 0.6% |
| 388 | Partition Array Into Two Arrays to Minimize Sum Difference Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask | Hard | 32 | 0.2% |
| 389 | Time Taken to Cross the Door Array, Queue, Simulation | Hard | 32 | 0.5% |
| 390 | Excel Sheet Column Title Math, String | Easy | 32 | 0.5% |
| 391 | Consecutive Numbers Database | Medium | 32 | 0.5% |
| 392 | Range Sum Query - Immutable Array, Design, Prefix Sum | Easy | 32 | 0.7% |
| 393 | Longest Palindrome Hash Table, String, Greedy | Easy | 32 | 0.6% |
| 394 | Palindromic Substrings Two Pointers, String, Dynamic Programming | Medium | 32 | 0.7% |
| 395 | Find Duplicate Subtrees Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 32 | 0.6% |
| 396 | Ugly Number Math | Easy | 32 | 0.4% |
| 397 | Graph Valid Tree Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 31 | 0.5% |
| 398 | Count Numbers with Unique Digits Math, Dynamic Programming, Backtracking | Medium | 31 | 0.6% |
| 399 | Repeated String Match String, String Matching | Medium | 31 | 0.4% |
| 400 | Largest Triangle Area Array, Math, Geometry | Easy | 31 | 0.7% |
| 401 | Keys and Rooms Depth-First Search, Breadth-First Search, Graph Theory | Medium | 31 | 0.8% |
| 402 | Remove Sub-Folders from the Filesystem Array, String, Depth-First Search, Trie | Medium | 31 | 0.8% |
| 403 | Maximum Score After Splitting a String String, Prefix Sum | Easy | 31 | 0.7% |
| 404 | Delete Nodes From Linked List Present in Array Array, Hash Table, Linked List | Medium | 31 | 0.7% |
| 405 | Unique Paths II Array, Dynamic Programming, Matrix | Medium | 31 | 0.4% |
| 406 | Recover Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 31 | 0.6% |
| 407 | Word Break II Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization | Hard | 31 | 0.6% |
| 408 | Queue Reconstruction by Height Array, Binary Indexed Tree, Segment Tree, Sorting | Medium | 31 | 0.7% |
| 409 | Predict the Winner Array, Math, Dynamic Programming, Recursion, Game Theory | Medium | 31 | 0.6% |
| 410 | Flood Fill Array, Depth-First Search, Breadth-First Search, Matrix | Easy | 31 | 0.7% |
| 411 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 31 | 0.6% |
| 412 | Monthly Transactions I Database | Medium | 31 | 0.6% |
| 413 | Students and Examinations Database | Easy | 31 | 0.6% |
| 414 | Minimum Difference Between Largest and Smallest Value in Three Moves Array, Greedy, Sorting | Medium | 31 | 0.6% |
| 415 | Binary Tree Vertical Order Traversal Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Medium | 31 | 0.6% |
| 416 | House Robber III Dynamic Programming, Tree, Depth-First Search, Binary Tree | Medium | 31 | 0.6% |
| 417 | Sliding Window Median Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 31 | 0.4% |
| 418 | Maximum Sum of 3 Non-Overlapping Subarrays Array, Dynamic Programming, Sliding Window, Prefix Sum | Hard | 31 | 0.6% |
| 419 | Minimum Falling Path Sum Array, Dynamic Programming, Matrix | Medium | 31 | 0.6% |
| 420 | Find in Mountain Array Array, Binary Search, Interactive | Hard | 31 | 0.4% |
| 421 | Tuple with Same Product Array, Hash Table, Counting | Medium | 31 | 0.7% |
| 422 | Sender With Largest Word Count Array, Hash Table, String, Counting | Medium | 31 | 0.6% |
| 423 | Decode Ways String, Dynamic Programming | Medium | 31 | 0.4% |
| 424 | Number of 1 Bits Divide and Conquer, Bit Manipulation | Easy | 31 | 0.8% |
| 425 | Increasing Triplet Subsequence Array, Greedy | Medium | 31 | 0.4% |
| 426 | Flatten Nested List Iterator Stack, Tree, Depth-First Search, Design, Queue, Iterator | Medium | 31 | 0.7% |
| 427 | Longest Absolute File Path String, Stack, Depth-First Search | Medium | 31 | 0.5% |
| 428 | Delete Node in a BST Tree, Binary Search Tree, Binary Tree | Medium | 31 | 0.5% |
| 429 | Jewels and Stones Hash Table, String | Easy | 31 | 0.9% |
| 430 | Flipping an Image Array, Two Pointers, Bit Manipulation, Matrix, Simulation | Easy | 31 | 0.8% |
| 431 | New 21 Game Math, Dynamic Programming, Sliding Window, Probability and Statistics | Medium | 31 | 0.5% |
| 432 | Regions Cut By Slashes Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 31 | 0.8% |
| 433 | Longest Arithmetic Subsequence of Given Difference Array, Hash Table, Dynamic Programming | Medium | 31 | 0.5% |
| 434 | Divide Array in Sets of K Consecutive Numbers Array, Hash Table, Greedy, Sorting | Medium | 31 | 0.6% |
| 435 | Kids With the Greatest Number of Candies Array | Easy | 31 | 0.9% |
| 436 | Minimum Interval to Include Each Query Array, Binary Search, Sweep Line, Sorting, Heap (Priority Queue) | Hard | 31 | 0.5% |
| 437 | Maximum Good Subarray Sum Array, Hash Table, Prefix Sum | Medium | 31 | 0.2% |
| 438 | Maximum Number of Events That Can Be Attended Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 31 | 0.4% |
| 439 | Inverse Coin Change Array, Dynamic Programming | Medium | 31 | 0.5% |
| 440 | Number of Digit One Math, Dynamic Programming, Recursion | Hard | 30 | 0.4% |
| 441 | Path Sum III Tree, Depth-First Search, Binary Tree | Medium | 30 | 0.5% |
| 442 | Detect Capital String | Easy | 30 | 0.6% |
| 443 | Minimum Absolute Difference in BST Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 30 | 0.6% |
| 444 | Valid Parenthesis String String, Dynamic Programming, Stack, Greedy | Medium | 30 | 0.4% |
| 445 | Max Chunks To Make Sorted Array, Stack, Greedy, Sorting, Monotonic Stack | Medium | 30 | 0.6% |
| 446 | K-th Symbol in Grammar Math, Bit Manipulation, Recursion | Medium | 30 | 0.5% |
| 447 | Robot Room Cleaner Backtracking, Interactive | Hard | 30 | 0.8% |
| 448 | Minimum Add to Make Parentheses Valid String, Stack, Greedy | Medium | 30 | 0.7% |
| 449 | Minimum Domino Rotations For Equal Row Array, Greedy | Medium | 30 | 0.6% |
| 450 | Smallest Integer Divisible by K Hash Table, Math | Medium | 30 | 0.5% |
| 451 | Maximum Level Sum of a Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 30 | 0.7% |
| 452 | Find the Difference of Two Arrays Array, Hash Table | Easy | 30 | 0.8% |
| 453 | Check If N and Its Double Exist Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 30 | 0.4% |
| 454 | Product of the Last K Numbers Array, Math, Design, Data Stream, Prefix Sum | Medium | 30 | 0.6% |
| 455 | Number of Subsequences That Satisfy the Given Sum Condition Array, Two Pointers, Binary Search, Sorting | Medium | 30 | 0.5% |
| 456 | Find Original Array From Doubled Array Array, Hash Table, Greedy, Sorting | Medium | 30 | 0.4% |
| 457 | Design a Text Editor Linked List, String, Stack, Design, Simulation, Doubly-Linked List | Hard | 30 | 0.5% |
| 458 | Maximum Beauty of an Array After Applying Operation Array, Binary Search, Sliding Window, Sorting | Medium | 30 | 0.6% |
| 459 | Best Time to Buy and Sell Stock III Array, Dynamic Programming | Hard | 30 | 0.5% |
| 460 | Binary Search Tree Iterator Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator | Medium | 30 | 0.8% |
| 461 | Minimum Height Trees Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 30 | 0.4% |
| 462 | Third Maximum Number Array, Sorting | Easy | 30 | 0.4% |
| 463 | Non-overlapping Intervals Array, Dynamic Programming, Greedy, Sorting | Medium | 30 | 0.6% |
| 464 | Minimum Time Difference Array, Math, String, Sorting | Medium | 30 | 0.6% |
| 465 | My Calendar I Array, Binary Search, Design, Segment Tree, Ordered Set | Medium | 30 | 0.6% |
| 466 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 30 | 0.5% |
| 467 | K Closest Points to Origin Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect | Medium | 30 | 0.7% |
| 468 | Subarray Sums Divisible by K Array, Hash Table, Prefix Sum | Medium | 30 | 0.6% |
| 469 | Duplicate Zeros Array, Two Pointers | Easy | 30 | 0.5% |
| 470 | How Many Numbers Are Smaller Than the Current Number Array, Hash Table, Sorting, Counting Sort | Easy | 30 | 0.9% |
| 471 | Maximum Score From Removing Substrings String, Stack, Greedy | Medium | 30 | 0.7% |
| 472 | Sum of Beauty of All Substrings Hash Table, String, Counting | Medium | 30 | 0.7% |
| 473 | Range Sum Query 2D - Immutable Array, Design, Matrix, Prefix Sum | Medium | 30 | 0.6% |
| 474 | K-th Smallest in Lexicographical Order Trie | Hard | 30 | 0.5% |
| 475 | Remove Duplicates from Sorted List II Linked List, Two Pointers | Medium | 29 | 0.5% |
| 476 | Missing Ranges Array | Easy | 29 | 0.4% |
| 477 | Basic Calculator II Math, String, Stack | Medium | 29 | 0.5% |
| 478 | Create Maximum Number Array, Two Pointers, Stack, Greedy, Monotonic Stack | Hard | 29 | 0.4% |
| 479 | Student Attendance Record II Dynamic Programming | Hard | 29 | 0.6% |
| 480 | Robot Return to Origin String, Simulation | Easy | 29 | 0.8% |
| 481 | Rotated Digits Math, Dynamic Programming | Medium | 29 | 0.6% |
| 482 | All Nodes Distance K in Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 29 | 0.7% |
| 483 | Longest Duplicate Substring String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function | Hard | 29 | 0.3% |
| 484 | Make The String Great String, Stack | Easy | 29 | 0.7% |
| 485 | Minimum Operations to Reduce X to Zero Array, Hash Table, Binary Search, Sliding Window, Prefix Sum | Medium | 29 | 0.4% |
| 486 | Build Array from Permutation Array, Simulation | Easy | 29 | 0.9% |
| 487 | Painting a Grid With Three Different Colors Dynamic Programming | Hard | 29 | 0.8% |
| 488 | Check if Word Can Be Placed In Crossword Array, Matrix, Enumeration | Medium | 29 | 0.5% |
| 489 | Array Prototype Last | Easy | 29 | 0.7% |
| 490 | Divide Array Into Arrays With Max Difference Array, Greedy, Sorting | Medium | 29 | 0.8% |
| 491 | Maximum Number of Ways to Partition an Array Array, Hash Table, Counting, Enumeration, Prefix Sum | Hard | 29 | 0.4% |
| 492 | Word Ladder II Hash Table, String, Backtracking, Breadth-First Search | Hard | 29 | 0.3% |
| 493 | Delete the Middle Node of a Linked List Linked List, Two Pointers | Medium | 29 | 0.6% |
| 494 | Intersection of Two Arrays II Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy | 29 | 0.6% |
| 495 | Number of Enclaves Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 29 | 0.7% |
| 496 | Number of Good Pairs Array, Hash Table, Math, Counting | Easy | 29 | 0.9% |
| 497 | Maximum Frequency of an Element After Performing Operations I Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Medium | 29 | 0.4% |
| 498 | Walls and Gates Array, Breadth-First Search, Matrix | Medium | 28 | 0.6% |
| 499 | Wiggle Sort II Array, Divide and Conquer, Greedy, Sorting, Quickselect | Medium | 28 | 0.4% |
| 500 | Valid Word Abbreviation Two Pointers, String | Easy | 28 | 0.4% |
| 501 | Optimal Account Balancing Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 28 | 0.5% |
| 502 | My Calendar II Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set | Medium | 28 | 0.6% |
| 503 | Expressive Words Array, Two Pointers, String | Medium | 28 | 0.5% |
| 504 | Word Subsets Array, Hash Table, String | Medium | 28 | 0.6% |
| 505 | Bag of Tokens Array, Two Pointers, Greedy, Sorting | Medium | 28 | 0.6% |
| 506 | Longest Arithmetic Subsequence Array, Hash Table, Binary Search, Dynamic Programming | Medium | 28 | 0.5% |
| 507 | Rank Teams by Votes Array, Hash Table, String, Sorting, Counting | Medium | 28 | 0.6% |
| 508 | Count Submatrices With All Ones Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Medium | 28 | 0.7% |
| 509 | Find the Highest Altitude Array, Prefix Sum | Easy | 28 | 0.8% |
| 510 | Maximum Score of a Node Sequence Array, Graph Theory, Sorting, Enumeration | Hard | 28 | 0.4% |
| 511 | First Letter to Appear Twice Hash Table, String, Bit Manipulation, Counting | Easy | 28 | 0.8% |
| 512 | Maximum Number of Points with Cost Array, Dynamic Programming, Matrix | Medium | 28 | 0.4% |
| 513 | Permutations II Array, Backtracking, Sorting | Medium | 28 | 0.6% |
| 514 | Binary Tree Preorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 28 | 0.8% |
| 515 | Max Points on a Line Array, Hash Table, Math, Geometry | Hard | 28 | 0.3% |
| 516 | Palindrome Pairs Array, Hash Table, String, Trie, Hash Function | Hard | 28 | 0.4% |
| 517 | Island Perimeter Array, Depth-First Search, Breadth-First Search, Matrix | Easy | 28 | 0.7% |
| 518 | Heaters Array, Two Pointers, Binary Search, Sorting | Medium | 28 | 0.4% |
| 519 | Longest Palindromic Subsequence String, Dynamic Programming | Medium | 28 | 0.7% |
| 520 | Triangle Judgement Database | Easy | 28 | 0.7% |
| 521 | Two Sum IV - Input is a BST Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 28 | 0.6% |
| 522 | Maximum Width of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 28 | 0.5% |
| 523 | Is Graph Bipartite? Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 28 | 0.6% |
| 524 | Design Linked List Linked List, Design | Medium | 28 | 0.3% |
| 525 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 28 | 0.5% |
| 526 | Path with Maximum Probability Array, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 28 | 0.7% |
| 527 | Nth Highest Salary Database | Medium | 28 | 0.4% |
| 528 | Sum of Good Subsequences Array, Hash Table, Dynamic Programming | Hard | 28 | 0.3% |
| 529 | Zero Array Transformation III Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 28 | 0.5% |
| 530 | Count Special Subsequences Array, Hash Table, Math, Enumeration | Medium | 28 | 0.3% |
| 531 | Count Number of Bad Pairs Array, Hash Table, Math, Counting | Medium | 28 | 0.5% |
| 532 | Path Existence Queries in a Graph I Array, Hash Table, Binary Search, Union-Find, Graph Theory | Medium | 28 | 0.6% |
| 533 | Spiral Matrix II Array, Matrix, Simulation | Medium | 28 | 0.8% |
| 534 | Game of Life Array, Matrix, Simulation | Medium | 28 | 0.7% |
| 535 | Shortest Distance from All Buildings Array, Breadth-First Search, Matrix | Hard | 28 | 0.4% |
| 536 | Sort Transformed Array Array, Math, Two Pointers, Sorting | Medium | 28 | 0.6% |
| 537 | Ones and Zeroes Array, String, Dynamic Programming | Medium | 28 | 0.5% |
| 538 | Delete Operation for Two Strings String, Dynamic Programming | Medium | 28 | 0.7% |
| 539 | Magic Squares In Grid Array, Hash Table, Math, Matrix | Medium | 28 | 0.6% |
| 540 | Longest Mountain in Array Array, Two Pointers, Dynamic Programming, Enumeration | Medium | 28 | 0.4% |
| 541 | X of a Kind in a Deck of Cards Array, Hash Table, Math, Counting, Number Theory | Easy | 28 | 0.3% |
| 542 | Filling Bookcase Shelves Array, Dynamic Programming | Medium | 28 | 0.7% |
| 543 | Count Servers that Communicate Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting | Medium | 28 | 0.7% |
| 544 | Find the Smallest Divisor Given a Threshold Array, Binary Search | Medium | 28 | 0.7% |
| 545 | Stone Game III Array, Math, Dynamic Programming, Game Theory | Hard | 28 | 0.6% |
| 546 | Build an Array With Stack Operations Array, Stack, Simulation | Medium | 28 | 0.8% |
| 547 | Longest Subarray of 1's After Deleting One Element Array, Dynamic Programming, Sliding Window | Medium | 28 | 0.7% |
| 548 | Parallel Courses II Dynamic Programming, Bit Manipulation, Graph Theory, Bitmask | Hard | 28 | 0.3% |
| 549 | Find the Most Competitive Subsequence Array, Stack, Greedy, Monotonic Stack | Medium | 28 | 0.5% |
| 550 | Minimum Number of Flips to Make the Binary String Alternating String, Dynamic Programming, Sliding Window | Medium | 28 | 0.5% |
| 551 | Convert 1D Array Into 2D Array Array, Matrix, Simulation | Easy | 28 | 0.7% |
| 552 | Stock Price Fluctuation Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set | Medium | 28 | 0.5% |
| 553 | Find Target Indices After Sorting Array Array, Binary Search, Sorting | Easy | 28 | 0.8% |
| 554 | Counting Words With a Given Prefix Array, String, String Matching | Easy | 28 | 0.8% |
| 555 | Find All K-Distant Indices in an Array Array, Two Pointers | Easy | 28 | 0.8% |
| 556 | To Be Or Not To Be | Easy | 28 | 0.6% |
| 557 | Maximum Number of K-Divisible Components Tree, Depth-First Search | Hard | 28 | 0.7% |
| 558 | Interleaving String String, Dynamic Programming | Medium | 28 | 0.4% |
| 559 | Path Sum Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 28 | 0.6% |
| 560 | Pascal's Triangle II Array, Dynamic Programming | Easy | 28 | 0.7% |
| 561 | Duplicate Emails Database | Easy | 28 | 0.7% |
| 562 | Number of Ways to Build Sturdy Brick Wall Array, Dynamic Programming, Bit Manipulation, Bitmask | Medium | 28 | 0.5% |
| 563 | Maximum Product of Word Lengths Array, String, Bit Manipulation | Medium | 28 | 0.6% |
| 564 | Relative Ranks Array, Sorting, Heap (Priority Queue) | Easy | 28 | 0.7% |
| 565 | RLE Iterator Array, Design, Counting, Iterator | Medium | 28 | 0.6% |
| 566 | Interval List Intersections Array, Two Pointers, Sweep Line | Medium | 28 | 0.7% |
| 567 | Shortest Common Supersequence String, Dynamic Programming | Hard | 28 | 0.6% |
| 568 | The kth Factor of n Math, Number Theory | Medium | 28 | 0.7% |
| 569 | Minimum Cost to Cut a Stick Array, Dynamic Programming, Sorting | Hard | 28 | 0.6% |
| 570 | Water Bottles Math, Simulation | Easy | 28 | 0.7% |
| 571 | Lexicographical Numbers Depth-First Search, Trie | Medium | 28 | 0.8% |
| 572 | Invalid Tweets Database | Easy | 28 | 0.9% |
| 573 | Check if Grid can be Cut into Sections Array, Sorting | Medium | 28 | 0.7% |
| 574 | Reschedule Meetings for Maximum Free Time I Array, Greedy, Sliding Window | Medium | 28 | 0.5% |
| 575 | Customers Who Never Order Database | Easy | 28 | 0.7% |
| 576 | Longest Non-Decreasing Subarray After Replacing at Most One Element Array, Dynamic Programming | Medium | 28 | 0.2% |
| 577 | Rank Scores Database | Medium | 27 | 0.7% |
| 578 | Best Time to Buy and Sell Stock IV Array, Dynamic Programming | Hard | 27 | 0.5% |
| 579 | Lowest Common Ancestor of a Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 27 | 0.7% |
| 580 | Find Leaves of Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 27 | 0.8% |
| 581 | Kth Smallest Element in a Sorted Matrix Array, Binary Search, Sorting, Heap (Priority Queue), Matrix | Medium | 27 | 0.6% |
| 582 | Binary Watch Backtracking, Bit Manipulation | Easy | 27 | 0.7% |
| 583 | Find Mode in Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 27 | 0.6% |
| 584 | Subarray Product Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Medium | 27 | 0.5% |
| 585 | Largest Number At Least Twice of Others Array, Sorting | Easy | 27 | 0.5% |
| 586 | Pyramid Transition Matrix Hash Table, String, Backtracking, Bit Manipulation | Medium | 27 | 0.6% |
| 587 | Construct Binary Tree from Preorder and Postorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 27 | 0.8% |
| 588 | Unique Email Addresses Array, Hash Table, String | Easy | 27 | 0.7% |
| 589 | Matrix Block Sum Array, Matrix, Prefix Sum | Medium | 27 | 0.8% |
| 590 | Kth Ancestor of a Tree Node Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design | Hard | 27 | 0.4% |
| 591 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold Array, Binary Search, Matrix, Prefix Sum | Medium | 27 | 0.7% |
| 592 | Number of Substrings Containing All Three Characters Hash Table, String, Sliding Window | Medium | 27 | 0.7% |
| 593 | Minimize Hamming Distance After Swap Operations Array, Depth-First Search, Union-Find | Medium | 27 | 0.7% |
| 594 | Largest Submatrix With Rearrangements Array, Greedy, Sorting, Matrix | Medium | 27 | 0.8% |
| 595 | Evaluate the Bracket Pairs of a String Array, Hash Table, String | Medium | 27 | 0.7% |
| 596 | Describe the Painting Array, Hash Table, Sorting, Prefix Sum | Medium | 27 | 0.5% |
| 597 | Find All People With Secret Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sorting | Hard | 27 | 0.5% |
| 598 | Words Within Two Edits of Dictionary Array, String, Trie | Medium | 27 | 0.7% |
| 599 | Merge Two 2D Arrays by Summing Values Array, Hash Table, Two Pointers | Easy | 27 | 0.8% |
| 600 | Find if Path Exists in Graph Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Easy | 27 | 0.6% |
| 601 | Distinct Subsequences String, Dynamic Programming | Hard | 27 | 0.5% |
| 602 | Sum Root to Leaf Numbers Tree, Depth-First Search, Binary Tree | Medium | 27 | 0.7% |
| 603 | Longest Increasing Subsequence II Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue | Hard | 27 | 0.3% |
| 604 | Design Search Autocomplete System String, Depth-First Search, Design, Trie, Sorting, Heap (Priority Queue), Data Stream | Hard | 27 | 0.5% |
| 605 | Toeplitz Matrix Array, Matrix | Easy | 27 | 0.7% |
| 606 | Design Circular Queue Array, Linked List, Design, Queue | Medium | 27 | 0.5% |
| 607 | Buddy Strings Hash Table, String | Easy | 27 | 0.3% |
| 608 | Shortest Subarray with Sum at Least K Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue | Hard | 27 | 0.3% |
| 609 | Maximum Sum Circular Subarray Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue | Medium | 27 | 0.5% |
| 610 | Number of Recent Calls Design, Queue, Data Stream | Easy | 27 | 0.8% |
| 611 | Valid Mountain Array Array | Easy | 27 | 0.4% |
| 612 | Minimum Cost to Merge Stones Array, Dynamic Programming, Prefix Sum | Hard | 27 | 0.5% |
| 613 | Car Pooling Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum | Medium | 27 | 0.6% |
| 614 | Find the Maximum Length of Valid Subsequence I Array, Dynamic Programming | Medium | 27 | 0.5% |
| 615 | Time Needed to Inform All Employees Tree, Depth-First Search, Breadth-First Search | Medium | 27 | 0.6% |
| 616 | Furthest Building You Can Reach Array, Greedy, Heap (Priority Queue) | Medium | 27 | 0.5% |
| 617 | Minimum Deletions to Make String Balanced String, Dynamic Programming, Stack | Medium | 27 | 0.7% |
| 618 | Find the Length of the Longest Common Prefix Array, Hash Table, String, Trie | Medium | 27 | 0.6% |
| 619 | Project Employees I Database | Easy | 27 | 0.7% |
| 620 | Adjacent Increasing Subarrays Detection I Array | Easy | 27 | 0.5% |
| 621 | Maximum Number of Distinct Elements After Operations Array, Greedy, Sorting | Medium | 27 | 0.5% |
| 622 | Find the Prefix Common Array of Two Arrays Array, Hash Table, Bit Manipulation | Medium | 27 | 0.9% |
| 623 | Number of Connected Components in an Undirected Graph Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 26 | 0.7% |
| 624 | Count of Range Sum Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 26 | 0.4% |
| 625 | Power of Four Math, Bit Manipulation, Recursion | Easy | 26 | 0.5% |
| 626 | Guess Number Higher or Lower Binary Search, Interactive | Easy | 26 | 0.6% |
| 627 | Push Dominoes Two Pointers, String, Dynamic Programming | Medium | 26 | 0.6% |
| 628 | Maximize Distance to Closest Person Array | Medium | 26 | 0.5% |
| 629 | Boats to Save People Array, Two Pointers, Greedy, Sorting | Medium | 26 | 0.6% |
| 630 | Cat and Mouse Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theory | Hard | 26 | 0.4% |
| 631 | Flip String to Monotone Increasing String, Dynamic Programming | Medium | 26 | 0.6% |
| 632 | Knight Dialer Dynamic Programming | Medium | 26 | 0.6% |
| 633 | Delete Columns to Make Sorted Array, String | Easy | 26 | 0.8% |
| 634 | Flip Equivalent Binary Trees Tree, Depth-First Search, Binary Tree | Medium | 26 | 0.7% |
| 635 | Delete Columns to Make Sorted II Array, String, Greedy | Medium | 26 | 0.5% |
| 636 | Minimum Knight Moves Breadth-First Search | Medium | 26 | 0.4% |
| 637 | Sort Integers by The Power Value Dynamic Programming, Memoization, Sorting | Medium | 26 | 0.7% |
| 638 | Check If a String Contains All Binary Codes of Size K Hash Table, String, Bit Manipulation, Rolling Hash, Hash Function | Medium | 26 | 0.6% |
| 639 | Arithmetic Subarrays Array, Hash Table, Sorting | Medium | 26 | 0.8% |
| 640 | The Earliest and Latest Rounds Where Players Compete Dynamic Programming, Memoization | Hard | 26 | 0.7% |
| 641 | Number of Unique Good Subsequences String, Dynamic Programming | Hard | 26 | 0.5% |
| 642 | Find the Number of Ways to Place People I Array, Math, Geometry, Sorting, Enumeration | Medium | 26 | 0.6% |
| 643 | Reverse Bits Divide and Conquer, Bit Manipulation | Easy | 26 | 0.7% |
| 644 | Count Complete Tree Nodes Binary Search, Bit Manipulation, Tree, Binary Tree | Easy | 26 | 0.7% |
| 645 | Number of Flowers in Full Bloom Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set | Hard | 26 | 0.6% |
| 646 | Bulls and Cows Hash Table, String, Counting | Medium | 26 | 0.5% |
| 647 | Minimum Obstacle Removal to Reach Corner Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Hard | 26 | 0.7% |
| 648 | Valid Perfect Square Math, Binary Search | Easy | 26 | 0.5% |
| 649 | Sort Array By Parity Array, Two Pointers, Sorting | Easy | 26 | 0.8% |
| 650 | Shortest Bridge Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 26 | 0.6% |
| 651 | Smallest String Starting From Leaf String, Backtracking, Tree, Depth-First Search, Binary Tree | Medium | 26 | 0.6% |
| 652 | Remove All Adjacent Duplicates In String String, Stack | Easy | 26 | 0.7% |
| 653 | Defanging an IP Address String | Easy | 26 | 0.9% |
| 654 | User Activity for the Past 30 Days I Database | Easy | 26 | 0.5% |
| 655 | Product Price at a Given Date Database | Medium | 26 | 0.6% |
| 656 | Queries Quality and Percentage Database | Easy | 26 | 0.5% |
| 657 | Special Positions in a Binary Matrix Array, Matrix | Easy | 26 | 0.7% |
| 658 | All O`one Data Structure Hash Table, Linked List, Design, Doubly-Linked List | Hard | 26 | 0.4% |
| 659 | Special Array I Array | Easy | 26 | 0.8% |
| 660 | Longest Harmonious Subsequence Array, Hash Table, Sliding Window, Sorting, Counting | Easy | 26 | 0.6% |
| 661 | Path With Maximum Minimum Value Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Medium | 26 | 0.5% |
| 662 | Populating Next Right Pointers in Each Node Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 25 | 0.7% |
| 663 | Wiggle Sort Array, Greedy, Sorting | Medium | 25 | 0.7% |
| 664 | Max Sum of Rectangle No Larger Than K Array, Binary Search, Matrix, Prefix Sum, Ordered Set | Hard | 25 | 0.5% |
| 665 | UTF-8 Validation Array, Bit Manipulation | Medium | 25 | 0.5% |
| 666 | Integer Replacement Dynamic Programming, Greedy, Bit Manipulation, Memoization | Medium | 25 | 0.4% |
| 667 | The Maze Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 25 | 0.6% |
| 668 | Longest Word in Dictionary through Deleting Array, Two Pointers, String, Sorting | Medium | 25 | 0.5% |
| 669 | Student Attendance Record I String | Easy | 25 | 0.5% |
| 670 | Sum of Square Numbers Math, Two Pointers, Binary Search | Medium | 25 | 0.4% |
| 671 | Implement Magic Dictionary Hash Table, String, Depth-First Search, Design, Trie | Medium | 25 | 0.6% |
| 672 | Cracking the Safe String, Depth-First Search, Graph Theory, Eulerian Circuit | Hard | 25 | 0.6% |
| 673 | Escape The Ghosts Array, Math | Medium | 25 | 0.6% |
| 674 | Insert into a Sorted Circular Linked List Linked List | Medium | 25 | 0.4% |
| 675 | Similar String Groups Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find | Hard | 25 | 0.6% |
| 676 | Online Election Array, Hash Table, Binary Search, Design | Medium | 25 | 0.5% |
| 677 | Beautiful Array Array, Math, Divide and Conquer | Medium | 25 | 0.7% |
| 678 | Largest Component Size by Common Factor Array, Hash Table, Math, Union-Find, Number Theory | Hard | 25 | 0.4% |
| 679 | Stream of Characters Array, String, Design, Trie, Data Stream | Hard | 25 | 0.5% |
| 680 | Longest String Chain Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting | Medium | 25 | 0.6% |
| 681 | Remove Interval Array | Medium | 25 | 0.7% |
| 682 | Rank Transform of a Matrix Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix | Hard | 25 | 0.4% |
| 683 | Watering Plants Array, Simulation | Medium | 25 | 0.8% |
| 684 | Tiling a Rectangle with the Fewest Squares Backtracking | Hard | 25 | 0.6% |
| 685 | Minimum Remove to Make Valid Parentheses String, Stack | Medium | 25 | 0.7% |
| 686 | Minimum Distance to Type a Word Using Two Fingers String, Dynamic Programming | Hard | 25 | 0.7% |
| 687 | Jump Game IV Array, Hash Table, Breadth-First Search | Hard | 25 | 0.5% |
| 688 | Number of Ways of Cutting a Pizza Array, Dynamic Programming, Memoization, Matrix, Prefix Sum | Hard | 25 | 0.6% |
| 689 | Range Sum of Sorted Subarray Sums Array, Two Pointers, Binary Search, Sorting, Prefix Sum | Medium | 25 | 0.6% |
| 690 | Number of Good Ways to Split a String Hash Table, String, Dynamic Programming, Bit Manipulation, Prefix Sum | Medium | 25 | 0.7% |
| 691 | Split a String Into the Max Number of Unique Substrings Hash Table, String, Backtracking | Medium | 25 | 0.7% |
| 692 | Special Array With X Elements Greater Than or Equal X Array, Binary Search, Sorting | Easy | 25 | 0.7% |
| 693 | Maximum XOR With an Element From Array Array, Bit Manipulation, Trie | Hard | 25 | 0.6% |
| 694 | Jump Game VII String, Dynamic Programming, Sliding Window, Prefix Sum | Medium | 25 | 0.4% |
| 695 | Number of Zero-Filled Subarrays Array, Math | Medium | 25 | 0.7% |
| 696 | Build a Matrix With Conditions Array, Graph Theory, Topological Sort, Matrix | Hard | 25 | 0.8% |
| 697 | Number of Good Paths Array, Hash Table, Tree, Union-Find, Graph Theory, Sorting | Hard | 25 | 0.6% |
| 698 | Find the Maximum Length of Valid Subsequence II Array, Dynamic Programming | Medium | 25 | 0.6% |
| 699 | Unique Binary Search Trees II Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree | Medium | 25 | 0.6% |
| 700 | Convert Sorted List to Binary Search Tree Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Medium | 25 | 0.7% |
| 701 | Dungeon Game Array, Dynamic Programming, Matrix | Hard | 25 | 0.4% |
| 702 | Design Add and Search Words Data Structure String, Depth-First Search, Design, Trie | Medium | 25 | 0.5% |
| 703 | Range Sum Query 2D - Mutable Array, Design, Binary Indexed Tree, Segment Tree, Matrix | Medium | 25 | 0.5% |
| 704 | Counting Bits Dynamic Programming, Bit Manipulation | Easy | 25 | 0.8% |
| 705 | Largest Local Values in a Matrix Array, Matrix | Easy | 25 | 0.9% |
| 706 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 25 | 0.3% |
| 707 | Continuous Subarray Sum Array, Hash Table, Math, Prefix Sum | Medium | 25 | 0.3% |
| 708 | Next Closest Time Hash Table, String, Backtracking, Enumeration | Medium | 25 | 0.5% |
| 709 | Number of Atoms Hash Table, String, Stack, Sorting | Hard | 25 | 0.7% |
| 710 | Employee Free Time Array, Sweep Line, Sorting, Heap (Priority Queue) | Hard | 25 | 0.7% |
| 711 | Random Point in Non-overlapping Rectangles Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized | Medium | 25 | 0.4% |
| 712 | Game Play Analysis IV Database | Medium | 25 | 0.4% |
| 713 | Immediate Food Delivery II Database | Medium | 25 | 0.6% |
| 714 | Path with Maximum Gold Array, Backtracking, Matrix | Medium | 25 | 0.7% |
| 715 | Count Number of Nice Subarrays Array, Hash Table, Math, Sliding Window, Prefix Sum | Medium | 25 | 0.8% |
| 716 | Cherry Pickup II Array, Dynamic Programming, Matrix | Hard | 25 | 0.7% |
| 717 | Nim Game Math, Brainteaser, Game Theory | Easy | 25 | 0.6% |
| 718 | Exchange Seats Database | Medium | 25 | 0.7% |
| 719 | Find the Maximum Sequence Value of Array Array, Dynamic Programming, Bit Manipulation | Hard | 25 | 0.2% |
| 720 | Maximum Frequency of an Element After Performing Operations II Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Hard | 25 | 0.5% |
| 721 | Find Numbers with Even Number of Digits Array, Math | Easy | 25 | 0.8% |
| 722 | Find N Unique Integers Sum up to Zero Array, Math | Easy | 25 | 0.8% |
| 723 | Count Non-Decreasing Subarrays After K Operations Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queue | Hard | 25 | 0.2% |
| 724 | Minimum Pair Removal to Sort Array I Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set | Easy | 25 | 0.7% |
| 725 | Fill a Special Grid Array, Divide and Conquer, Matrix | Medium | 25 | 0.7% |
| 726 | Factorial Trailing Zeroes Math | Medium | 23 | 0.5% |
| 727 | 3Sum Smaller Array, Two Pointers, Binary Search, Sorting | Medium | 23 | 0.5% |
| 728 | Paint Fence Dynamic Programming | Medium | 23 | 0.5% |
| 729 | Word Pattern Hash Table, String | Easy | 23 | 0.4% |
| 730 | Verify Preorder Serialization of a Binary Tree String, Stack, Tree, Binary Tree | Medium | 23 | 0.5% |
| 731 | Rearrange String k Distance Apart Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Hard | 23 | 0.4% |
| 732 | Perfect Rectangle Array, Hash Table, Math, Geometry, Sweep Line | Hard | 23 | 0.4% |
| 733 | Frog Jump Array, Dynamic Programming | Hard | 23 | 0.5% |
| 734 | Sentence Screen Fitting Array, String, Dynamic Programming | Medium | 23 | 0.4% |
| 735 | Magical String Two Pointers, String | Medium | 23 | 0.6% |
| 736 | Encode and Decode TinyURL Hash Table, String, Design, Hash Function | Medium | 23 | 0.9% |
| 737 | Non-decreasing Array Array | Medium | 23 | 0.3% |
| 738 | Find K-th Smallest Pair Distance Array, Two Pointers, Binary Search, Sorting | Hard | 23 | 0.5% |
| 739 | Sentence Similarity II Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find | Medium | 23 | 0.5% |
| 740 | Max Chunks To Make Sorted II Array, Stack, Greedy, Sorting, Monotonic Stack | Hard | 23 | 0.5% |
| 741 | Minimize Max Distance to Gas Station Array, Binary Search | Hard | 23 | 0.5% |
| 742 | Image Overlap Array, Matrix | Medium | 23 | 0.6% |
| 743 | Exam Room Design, Heap (Priority Queue), Ordered Set | Medium | 23 | 0.4% |
| 744 | All Possible Full Binary Trees Dynamic Programming, Tree, Recursion, Memoization, Binary Tree | Medium | 23 | 0.8% |
| 745 | DI String Match Array, Two Pointers, String, Greedy | Easy | 23 | 0.8% |
| 746 | Most Stones Removed with Same Row or Column Hash Table, Depth-First Search, Union-Find, Graph Theory | Medium | 23 | 0.6% |
| 747 | Minimum Cost For Tickets Array, Dynamic Programming | Medium | 23 | 0.7% |
| 748 | Campus Bikes Array, Sorting, Heap (Priority Queue) | Medium | 23 | 0.6% |
| 749 | Video Stitching Array, Dynamic Programming, Greedy | Medium | 23 | 0.5% |
| 750 | Letter Tile Possibilities Hash Table, String, Backtracking, Counting | Medium | 23 | 0.8% |
| 751 | Print in Order Concurrency | Easy | 23 | 0.7% |
| 752 | Decompress Run-Length Encoded List Array | Easy | 23 | 0.9% |
| 753 | Minimum Number of Vertices to Reach All Nodes Graph Theory | Medium | 23 | 0.8% |
| 754 | Minimum Number of Days to Eat N Oranges Dynamic Programming, Memoization | Hard | 23 | 0.4% |
| 755 | Cat and Mouse II Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory | Hard | 23 | 0.4% |
| 756 | Checking Existence of Edge Length Limited Paths Array, Two Pointers, Union-Find, Graph Theory, Sorting | Hard | 23 | 0.6% |
| 757 | Latest Time by Replacing Hidden Digits String, Greedy | Easy | 23 | 0.4% |
| 758 | Map of Highest Peak Array, Breadth-First Search, Matrix | Medium | 23 | 0.8% |
| 759 | Maximum Score of a Good Subarray Array, Two Pointers, Binary Search, Stack, Monotonic Stack | Hard | 23 | 0.6% |
| 760 | Sentence Similarity III Array, Two Pointers, String | Medium | 23 | 0.5% |
| 761 | Eliminate Maximum Number of Monsters Array, Greedy, Sorting | Medium | 23 | 0.5% |
| 762 | The Number of Weak Characters in the Game Array, Stack, Greedy, Sorting, Monotonic Stack | Medium | 23 | 0.4% |
| 763 | Parallel Courses III Array, Dynamic Programming, Graph Theory, Topological Sort | Hard | 23 | 0.7% |
| 764 | Maximum Number of Words Found in Sentences Array, String | Easy | 23 | 0.9% |
| 765 | Destroying Asteroids Array, Greedy, Sorting | Medium | 23 | 0.6% |
| 766 | Paths in Matrix Whose Sum Is Divisible by K Array, Dynamic Programming, Matrix | Hard | 23 | 0.6% |
| 767 | Count Number of Distinct Integers After Reverse Operations Array, Hash Table, Math, Counting | Medium | 23 | 0.8% |
| 768 | Closest Nodes Queries in a Binary Search Tree Array, Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 23 | 0.4% |
| 769 | Frog Jump II Array, Binary Search, Greedy | Medium | 23 | 0.6% |
| 770 | Disconnect Path in a Binary Matrix by at Most One Flip Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix | Medium | 23 | 0.3% |
| 771 | Check if There is a Path With Equal Number of 0's And 1's Array, Dynamic Programming, Matrix | Medium | 23 | 0.5% |
| 772 | Count the Number of Fair Pairs Array, Two Pointers, Binary Search, Sorting | Medium | 23 | 0.5% |
| 773 | Prime Subtraction Operation Array, Math, Binary Search, Greedy, Number Theory | Medium | 23 | 0.6% |
| 774 | Find the Largest Area of Square Inside Two Rectangles Array, Math, Geometry | Medium | 23 | 0.7% |
| 775 | Confirmation Rate Database | Medium | 23 | 0.6% |
| 776 | Delete Duplicate Emails Database | Easy | 23 | 0.7% |
| 777 | Binary Tree Longest Consecutive Sequence Tree, Depth-First Search, Binary Tree | Medium | 23 | 0.5% |
| 778 | Smallest Rectangle Enclosing Black Pixels Array, Binary Search, Depth-First Search, Breadth-First Search, Matrix | Hard | 23 | 0.6% |
| 779 | Patching Array Array, Greedy | Hard | 23 | 0.5% |
| 780 | Count Subarrays With Score Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Hard | 23 | 0.6% |
| 781 | Evaluate Boolean Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 23 | 0.8% |
| 782 | License Key Formatting String | Easy | 23 | 0.5% |
| 783 | Maximum Sum of Distinct Subarrays With Length K Array, Hash Table, Sliding Window | Medium | 23 | 0.4% |
| 784 | Redundant Connection II Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 23 | 0.4% |
| 785 | Construct Binary Search Tree from Preorder Traversal Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree | Medium | 23 | 0.8% |
| 786 | Parallel Courses Graph Theory, Topological Sort | Medium | 23 | 0.6% |
| 787 | N-th Tribonacci Number Math, Dynamic Programming, Memoization | Easy | 23 | 0.6% |
| 788 | Search Suggestions System Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue) | Medium | 23 | 0.7% |
| 789 | Clear Digits String, Stack, Simulation | Easy | 23 | 0.8% |
| 790 | Avoid Flood in The City Array, Hash Table, Binary Search, Greedy, Heap (Priority Queue) | Medium | 23 | 0.4% |
| 791 | Car Fleet II Array, Math, Stack, Heap (Priority Queue), Monotonic Stack | Hard | 23 | 0.6% |
| 792 | Remove All Occurrences of a Substring String, Stack, Simulation | Medium | 23 | 0.8% |
| 793 | Convert Object to JSON String | Medium | 23 | 0.8% |
| 794 | Number of Same-End Substrings Array, Hash Table, String, Counting, Prefix Sum | Medium | 23 | 0.6% |
| 795 | Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) | Hard | 23 | 0.7% |
| 796 | Number of Ways to Arrive at Destination Dynamic Programming, Graph Theory, Topological Sort, Shortest Path | Medium | 23 | 0.4% |
| 797 | Check if DFS Strings Are Palindromes Array, Hash Table, String, Tree, Depth-First Search, Hash Function | Hard | 23 | 0.2% |
| 798 | Adjacent Increasing Subarrays Detection II Array, Binary Search | Medium | 23 | 0.6% |
| 799 | Percentage of Users Attended a Contest Database | Easy | 23 | 0.6% |
| 800 | Two Best Non-Overlapping Events Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue) | Medium | 23 | 0.6% |
| 801 | House Robber IV Array, Binary Search, Dynamic Programming, Greedy | Medium | 23 | 0.6% |
| 802 | Reschedule Meetings for Maximum Free Time II Array, Greedy, Enumeration | Medium | 23 | 0.6% |
| 803 | The k-th Lexicographical String of All Happy Strings of Length n String, Backtracking | Medium | 23 | 0.9% |
| 804 | Check if Number is a Sum of Powers of Three Math | Medium | 23 | 0.8% |
| 805 | Find Minimum in Rotated Sorted Array II Array, Binary Search | Hard | 22 | 0.5% |
| 806 | Read N Characters Given read4 II - Call Multiple Times Array, Simulation, Interactive | Hard | 22 | 0.4% |
| 807 | Longest Substring with At Most Two Distinct Characters Hash Table, String, Sliding Window | Medium | 22 | 0.6% |
| 808 | Bulb Switcher Math, Brainteaser | Medium | 22 | 0.6% |
| 809 | Design Snake Game Array, Hash Table, Design, Queue, Simulation | Medium | 22 | 0.4% |
| 810 | Line Reflection Array, Hash Table, Math | Medium | 22 | 0.4% |
| 811 | Range Addition Array, Prefix Sum | Medium | 22 | 0.7% |
| 812 | Smallest Good Base Math, Binary Search | Hard | 22 | 0.5% |
| 813 | Max Consecutive Ones II Array, Dynamic Programming, Sliding Window | Medium | 22 | 0.5% |
| 814 | All Paths from Source Lead to Destination Graph Theory, Topological Sort | Medium | 22 | 0.4% |
| 815 | Freedom Trail String, Dynamic Programming, Depth-First Search, Breadth-First Search | Hard | 22 | 0.6% |
| 816 | Design Compressed String Iterator Array, String, Design, Iterator | Easy | 22 | 0.4% |
| 817 | Minimum Window Subsequence String, Dynamic Programming, Sliding Window | Hard | 22 | 0.4% |
| 818 | My Calendar III Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set | Hard | 22 | 0.7% |
| 819 | Sentence Similarity Array, Hash Table, String | Easy | 22 | 0.4% |
| 820 | Insert into a Binary Search Tree Tree, Binary Search Tree, Binary Tree | Medium | 22 | 0.7% |
| 821 | Search in a Sorted Array of Unknown Size Array, Binary Search, Interactive | Medium | 22 | 0.7% |
| 822 | Minimum Distance Between BST Nodes Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 22 | 0.6% |
| 823 | Largest Sum of Averages Array, Dynamic Programming, Prefix Sum | Medium | 22 | 0.6% |
| 824 | Linked List Components Array, Hash Table, Linked List | Medium | 22 | 0.6% |
| 825 | K-Similar Strings Hash Table, String, Breadth-First Search | Hard | 22 | 0.4% |
| 826 | Minimum Cost to Hire K Workers Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 22 | 0.6% |
| 827 | Delete Columns to Make Sorted III Array, String, Dynamic Programming | Hard | 22 | 0.7% |
| 828 | Numbers With Repeated Digits Math, Dynamic Programming | Hard | 22 | 0.5% |
| 829 | Best Sightseeing Pair Array, Dynamic Programming | Medium | 22 | 0.6% |
| 830 | Binary String With Substrings Representing 1 To N Hash Table, String, Bit Manipulation, Sliding Window | Medium | 22 | 0.6% |
| 831 | Confusing Number Math | Easy | 22 | 0.5% |
| 832 | Valid Boomerang Array, Math, Geometry | Easy | 22 | 0.4% |
| 833 | Single-Row Keyboard Hash Table, String | Easy | 22 | 0.9% |
| 834 | Smallest Subsequence of Distinct Characters String, Stack, Greedy, Monotonic Stack | Medium | 22 | 0.6% |
| 835 | Minimum Falling Path Sum II Array, Dynamic Programming, Matrix | Hard | 22 | 0.6% |
| 836 | Sum of Mutated Array Closest to Target Array, Binary Search, Sorting | Medium | 22 | 0.5% |
| 837 | Alphabet Board Path Hash Table, String | Medium | 22 | 0.5% |
| 838 | Deepest Leaves Sum Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 22 | 0.9% |
| 839 | Pizza With 3n Slices Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 22 | 0.5% |
| 840 | Max Value of Equation Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 22 | 0.5% |
| 841 | Last Moment Before All Ants Fall Out of a Plank Array, Brainteaser, Simulation | Medium | 22 | 0.7% |
| 842 | Maximum Non Negative Product in a Matrix Array, Dynamic Programming, Matrix | Medium | 22 | 0.5% |
| 843 | Minimum Adjacent Swaps for K Consecutive Ones Array, Greedy, Sliding Window, Prefix Sum | Hard | 22 | 0.4% |
| 844 | Number of Restricted Paths From First to Last Node Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path | Medium | 22 | 0.4% |
| 845 | Queries on Number of Points Inside a Circle Array, Math, Geometry | Medium | 22 | 0.9% |
| 846 | Largest Color Value in a Directed Graph Hash Table, String, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Counting | Hard | 22 | 0.6% |
| 847 | Merge Triplets to Form Target Triplet Array, Greedy | Medium | 22 | 0.7% |
| 848 | Number of Wonderful Substrings Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 22 | 0.7% |
| 849 | Cutting Ribbons Array, Binary Search | Medium | 22 | 0.5% |
| 850 | Count Fertile Pyramids in a Land Array, Dynamic Programming, Matrix | Hard | 22 | 0.7% |
| 851 | Create Binary Tree From Descriptions Array, Hash Table, Tree, Binary Tree | Medium | 22 | 0.8% |
| 852 | Most Frequent Number Following Key In an Array Array, Hash Table, Counting | Easy | 22 | 0.6% |
| 853 | Check if Number Has Equal Digit Count and Digit Value Hash Table, String, Counting | Easy | 22 | 0.7% |
| 854 | Longest Binary Subsequence Less Than or Equal to K String, Dynamic Programming, Greedy, Memoization | Medium | 22 | 0.5% |
| 855 | Sum of Prefix Scores of Strings Array, String, Trie, Counting | Hard | 22 | 0.6% |
| 856 | Determine if Two Events Have Conflict Array, String | Easy | 22 | 0.5% |
| 857 | Find the Punishment Number of an Integer Math, Backtracking | Medium | 22 | 0.8% |
| 858 | String Transformation Math, String, Dynamic Programming, String Matching | Hard | 22 | 0.3% |
| 859 | Maximum Number That Sum of the Prices Is Less Than or Equal to K Math, Binary Search, Dynamic Programming, Bit Manipulation | Medium | 22 | 0.4% |
| 860 | Find the Number of Ways to Place People II Array, Math, Geometry, Sorting, Enumeration | Hard | 22 | 0.6% |
| 861 | Longest Common Suffix Queries Array, String, Trie | Hard | 22 | 0.5% |
| 862 | Restore IP Addresses String, Backtracking | Medium | 22 | 0.6% |
| 863 | Unique Binary Search Trees Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree | Medium | 22 | 0.6% |
| 864 | Construct Binary Tree from Inorder and Postorder Traversal Array, Hash Table, Divide and Conquer, Tree, Binary Tree | Medium | 22 | 0.7% |
| 865 | Repeated DNA Sequences Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function | Medium | 22 | 0.5% |
| 866 | Closest Binary Search Tree Value Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 22 | 0.5% |
| 867 | Minimum Consecutive Cards to Pick Up Array, Hash Table, Sliding Window | Medium | 22 | 0.5% |
| 868 | Water and Jug Problem Math, Depth-First Search, Breadth-First Search | Medium | 22 | 0.5% |
| 869 | Guess Number Higher or Lower II Math, Dynamic Programming, Game Theory | Medium | 22 | 0.5% |
| 870 | Longest Nice Subarray Array, Bit Manipulation, Sliding Window | Medium | 22 | 0.6% |
| 871 | Number of Boomerangs Array, Hash Table, Math | Medium | 22 | 0.6% |
| 872 | Longest Uncommon Subsequence II Array, Hash Table, Two Pointers, String, Sorting | Medium | 22 | 0.5% |
| 873 | Beautiful Arrangement Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 22 | 0.6% |
| 874 | Not Boring Movies Database | Easy | 22 | 0.8% |
| 875 | Split Array into Consecutive Subsequences Array, Hash Table, Greedy, Heap (Priority Queue) | Medium | 22 | 0.5% |
| 876 | Couples Holding Hands Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 22 | 0.6% |
| 877 | Reaching Points Math | Hard | 22 | 0.3% |
| 878 | Shortest Path to Get All Keys Array, Bit Manipulation, Breadth-First Search, Matrix | Hard | 22 | 0.5% |
| 879 | Reverse Only Letters Two Pointers, String | Easy | 22 | 0.7% |
| 880 | Critical Connections in a Network Depth-First Search, Graph Theory, Biconnected Component | Hard | 22 | 0.6% |
| 881 | All Ancestors of a Node in a Directed Acyclic Graph Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 22 | 0.6% |
| 882 | The Number of Employees Which Report to Each Employee Database | Easy | 22 | 0.5% |
| 883 | Spiral Matrix III Array, Matrix, Simulation | Medium | 22 | 0.8% |
| 884 | Return Length of Arguments Passed | Easy | 22 | 0.9% |
| 885 | Stone Game Array, Math, Dynamic Programming, Game Theory | Medium | 22 | 0.7% |
| 886 | Largest Odd Number in String Math, String, Greedy | Easy | 22 | 0.7% |
| 887 | Maximum Employees to Be Invited to a Meeting Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort | Hard | 22 | 0.6% |
| 888 | Maximum Matrix Sum Array, Greedy, Matrix | Medium | 22 | 0.7% |
| 889 | Design Twitter Hash Table, Linked List, Design, Heap (Priority Queue) | Medium | 22 | 0.4% |
| 890 | Design Task Manager Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 22 | 0.5% |
| 891 | Partition Array According to Given Pivot Array, Two Pointers, Simulation | Medium | 22 | 0.9% |
| 892 | Longest Palindromic Subsequence After at Most K Operations String, Dynamic Programming | Medium | 22 | 0.4% |
| 893 | Find the K-th Character in String Game I Math, Bit Manipulation, Recursion, Simulation | Easy | 22 | 0.8% |
| 894 | Solving Questions With Brainpower Array, Dynamic Programming | Medium | 22 | 0.6% |
| 895 | Palindrome Partitioning II String, Dynamic Programming | Hard | 22 | 0.4% |
| 896 | Maximum Erasure Value Array, Hash Table, Sliding Window | Medium | 22 | 0.6% |
| 897 | Divide an Array Into Subarrays With Minimum Cost I Array, Sorting, Enumeration | Easy | 22 | 0.8% |
| 898 | Longest Balanced Subarray II Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum | Hard | 22 | 0.3% |
| 899 | Minimum Depth of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 21 | 0.5% |
| 900 | Binary Tree Postorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 21 | 0.8% |
| 901 | Strobogrammatic Number Hash Table, Two Pointers, String | Easy | 21 | 0.5% |
| 902 | Flatten 2D Vector Array, Two Pointers, Design, Iterator | Medium | 21 | 0.5% |
| 903 | Closest Binary Search Tree Value II Two Pointers, Stack, Tree, Depth-First Search, Binary Search Tree, Heap (Priority Queue), Binary Tree | Hard | 21 | 0.6% |
| 904 | Zigzag Iterator Array, Design, Queue, Iterator | Medium | 21 | 0.7% |
| 905 | Peeking Iterator Array, Design, Iterator | Medium | 21 | 0.6% |
| 906 | Super Ugly Number Array, Math, Dynamic Programming | Medium | 21 | 0.5% |
| 907 | Longest Substring with At Most K Distinct Characters Hash Table, String, Sliding Window | Medium | 21 | 0.5% |
| 908 | Design Tic-Tac-Toe Array, Hash Table, Design, Matrix, Simulation | Medium | 21 | 0.6% |
| 909 | Plus One Linked List Linked List, Math | Medium | 21 | 0.6% |
| 910 | The Maze II Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 21 | 0.6% |
| 911 | Word Abbreviation Array, String, Greedy, Trie, Sorting | Hard | 21 | 0.6% |
| 912 | Output Contest Matches String, Recursion, Simulation | Medium | 21 | 0.8% |
| 913 | Boundary of Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 21 | 0.5% |
| 914 | Longest Line of Consecutive One in Matrix Array, Dynamic Programming, Matrix | Medium | 21 | 0.5% |
| 915 | Subtree of Another Tree Tree, Depth-First Search, String Matching, Binary Tree, Hash Function | Easy | 21 | 0.5% |
| 916 | Shopping Offers Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Medium | 21 | 0.5% |
| 917 | Beautiful Arrangement II Array, Math | Medium | 21 | 0.6% |
| 918 | Kth Smallest Number in Multiplication Table Math, Binary Search | Hard | 21 | 0.5% |
| 919 | K Empty Slots Array, Binary Indexed Tree, Segment Tree, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Hard | 21 | 0.4% |
| 920 | Shortest Completing Word Array, Hash Table, String | Easy | 21 | 0.6% |
| 921 | Find Anagram Mappings Array, Hash Table | Easy | 21 | 0.8% |
| 922 | Basic Calculator III Math, String, Stack, Recursion | Hard | 21 | 0.5% |
| 923 | Bricks Falling When Hit Array, Union-Find, Matrix | Hard | 21 | 0.4% |
| 924 | Super Palindromes Math, String, Enumeration | Hard | 21 | 0.4% |
| 925 | Divisor Game Math, Dynamic Programming, Brainteaser, Game Theory | Easy | 21 | 0.7% |
| 926 | Minimum Cost to Connect Sticks Array, Greedy, Heap (Priority Queue) | Medium | 21 | 0.7% |
| 927 | Product Sales Analysis I Database | Easy | 21 | 0.9% |
| 928 | Brace Expansion II Hash Table, String, Backtracking, Stack, Breadth-First Search, Sorting | Hard | 21 | 0.6% |
| 929 | Divide Chocolate Array, Binary Search | Hard | 21 | 0.6% |
| 930 | Mean of Array After Removing Some Elements Array, Sorting | Easy | 21 | 0.7% |
| 931 | Element Appearing More Than 25% In Sorted Array Array | Easy | 21 | 0.6% |
| 932 | Distinct Echo Substrings String, Trie, Rolling Hash, Hash Function | Hard | 21 | 0.5% |
| 933 | Decrease Elements To Make Array Zigzag Array, Greedy | Medium | 21 | 0.5% |
| 934 | Binary Tree Coloring Game Tree, Depth-First Search, Binary Tree | Medium | 21 | 0.5% |
| 935 | Longest Chunked Palindrome Decomposition Two Pointers, String, Dynamic Programming, Greedy, Rolling Hash, Hash Function | Hard | 21 | 0.6% |
| 936 | Where Will the Ball Fall Array, Matrix, Simulation | Medium | 21 | 0.7% |
| 937 | Maximum Value of K Coins From Piles Array, Dynamic Programming, Prefix Sum | Hard | 21 | 0.6% |
| 938 | Number of Ways to Stay in the Same Place After Some Steps Dynamic Programming | Hard | 21 | 0.5% |
| 939 | Longest Happy Prefix String, Rolling Hash, String Matching, Hash Function | Hard | 21 | 0.5% |
| 940 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K Math, Greedy | Medium | 21 | 0.6% |
| 941 | Simplified Fractions Math, String, Number Theory | Medium | 21 | 0.7% |
| 942 | Find Two Non-overlapping Sub-arrays Each With Target Sum Array, Hash Table, Binary Search, Dynamic Programming, Sliding Window | Medium | 21 | 0.4% |
| 943 | Find Root of N-Ary Tree Hash Table, Bit Manipulation, Tree, Depth-First Search | Medium | 21 | 0.8% |
| 944 | Number of Good Leaf Nodes Pairs Tree, Depth-First Search, Binary Tree | Medium | 21 | 0.7% |
| 945 | Number of Ways to Reorder Array to Get Same BST Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree | Hard | 21 | 0.5% |
| 946 | Strange Printer II Array, Graph Theory, Topological Sort, Matrix | Hard | 21 | 0.6% |
| 947 | Rearrange Spaces Between Words String | Easy | 21 | 0.4% |
| 948 | Minimum Cost to Connect Two Groups of Points Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask | Hard | 21 | 0.5% |
| 949 | Throne Inheritance Hash Table, Tree, Depth-First Search, Design | Medium | 21 | 0.7% |
| 950 | Fancy Sequence Math, Design, Segment Tree, Number Theory | Hard | 21 | 0.4% |
| 951 | Distribute Repeating Integers Array, Hash Table, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmask | Hard | 21 | 0.4% |
| 952 | Max Number of K-Sum Pairs Array, Hash Table, Two Pointers, Sorting | Medium | 21 | 0.6% |
| 953 | Minimum Operations to Make a Subsequence Array, Hash Table, Binary Search, Greedy | Hard | 21 | 0.5% |
| 954 | Find Kth Largest XOR Coordinate Value Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect | Medium | 21 | 0.6% |
| 955 | Maximum Score from Performing Multiplication Operations Array, Dynamic Programming | Hard | 21 | 0.4% |
| 956 | Design Most Recently Used Queue Array, Linked List, Divide and Conquer, Design, Simulation, Doubly-Linked List | Medium | 21 | 0.8% |
| 957 | Maximum Number of Groups Getting Fresh Donuts Array, Dynamic Programming, Bit Manipulation, Memoization, Bitmask | Hard | 21 | 0.4% |
| 958 | Minimum Path Cost in a Hidden Grid Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Interactive, Shortest Path | Medium | 21 | 0.6% |
| 959 | Kth Smallest Subarray Sum Array, Binary Search, Sliding Window | Medium | 21 | 0.5% |
| 960 | Last Day Where You Can Still Cross Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 21 | 0.7% |
| 961 | Operations on Tree Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Design | Medium | 21 | 0.5% |
| 962 | Binary Searchable Numbers in an Unsorted Array Array, Binary Search, Stack, Monotonic Stack | Medium | 21 | 0.6% |
| 963 | Final Value of Variable After Performing Operations Array, String, Simulation | Easy | 21 | 0.9% |
| 964 | Minimum Operations to Convert Number Array, Breadth-First Search | Medium | 21 | 0.5% |
| 965 | Minimum Cost to Set Cooking Time Math, Enumeration | Medium | 21 | 0.4% |
| 966 | Find All Lonely Numbers in the Array Array, Hash Table, Counting | Medium | 21 | 0.6% |
| 967 | Maximum Split of Positive Even Integers Math, Backtracking, Greedy | Medium | 21 | 0.6% |
| 968 | Minimum Time to Remove All Cars Containing Illegal Goods String, Dynamic Programming | Hard | 21 | 0.4% |
| 969 | Maximum AND Sum of Array Array, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 21 | 0.5% |
| 970 | Count Prefixes of a Given String Array, String | Easy | 21 | 0.7% |
| 971 | Count Asterisks String | Easy | 21 | 0.8% |
| 972 | Merge Similar Items Array, Hash Table, Sorting, Ordered Set | Easy | 21 | 0.8% |
| 973 | Finding the Number of Visible Mountains Array, Stack, Sorting, Monotonic Stack | Medium | 21 | 0.4% |
| 974 | Longest Uploaded Prefix Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set | Medium | 21 | 0.6% |
| 975 | Number of Pairs Satisfying Inequality Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 21 | 0.5% |
| 976 | Number of Beautiful Partitions String, Dynamic Programming, Prefix Sum | Hard | 21 | 0.3% |
| 977 | Make Number of Distinct Characters Equal Hash Table, String, Counting | Medium | 21 | 0.3% |
| 978 | Increment Submatrices by One Array, Matrix, Prefix Sum | Medium | 21 | 0.7% |
| 979 | Sleep | Easy | 21 | 0.9% |
| 980 | Sum of Imbalance Numbers of All Subarrays Array, Hash Table, Enumeration | Hard | 21 | 0.4% |
| 981 | Minimum Absolute Difference Between Elements With Constraint Array, Binary Search, Ordered Set | Medium | 21 | 0.4% |
| 982 | Count K-Subsequences of a String With Maximum Beauty Hash Table, Math, String, Greedy, Sorting, Combinatorics | Hard | 21 | 0.3% |
| 983 | Find Champion II Graph Theory | Medium | 21 | 0.7% |
| 984 | Find Longest Special Substring That Occurs Thrice II Hash Table, String, Binary Search, Sliding Window, Counting | Medium | 21 | 0.4% |
| 985 | Minimum Number of Operations to Make Word K-Periodic Hash Table, String, Counting | Medium | 21 | 0.6% |
| 986 | Sum of Digit Differences of All Pairs Array, Hash Table, Math, Counting | Medium | 21 | 0.4% |
| 987 | Sum of Subarray Ranges Array, Stack, Monotonic Stack | Medium | 21 | 0.6% |
| 988 | Strobogrammatic Number II Array, String, Recursion | Medium | 21 | 0.5% |
| 989 | Meeting Rooms Array, Sorting | Easy | 21 | 0.6% |
| 990 | Design Phone Directory Array, Hash Table, Linked List, Design, Queue | Medium | 21 | 0.5% |
| 991 | Longest Substring with At Least K Repeating Characters Hash Table, String, Divide and Conquer, Sliding Window | Medium | 21 | 0.5% |
| 992 | Number of Valid Clock Times String, Enumeration | Easy | 21 | 0.5% |
| 993 | Erect the Fence Array, Math, Geometry | Hard | 21 | 0.5% |
| 994 | Add Bold Tag in String Array, Hash Table, String, Trie, String Matching | Medium | 21 | 0.5% |
| 995 | Search in a Binary Search Tree Tree, Binary Search Tree, Binary Tree | Easy | 21 | 0.8% |
| 996 | Hand of Straights Array, Hash Table, Greedy, Sorting | Medium | 21 | 0.6% |
| 997 | Profitable Schemes Array, Dynamic Programming | Hard | 21 | 0.5% |
| 998 | Super Egg Drop Math, Binary Search, Dynamic Programming | Hard | 21 | 0.3% |
| 999 | Distribute Coins in Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 21 | 0.8% |
| 1000 | Maximum Length of Semi-Decreasing Subarrays Array, Stack, Sorting, Monotonic Stack | Medium | 21 | 0.7% |
| 1001 | Last Stone Weight Array, Heap (Priority Queue) | Easy | 21 | 0.7% |
| 1002 | Parsing A Boolean Expression String, Stack, Recursion | Hard | 21 | 0.7% |
| 1003 | Convert Binary Number in a Linked List to Integer Linked List, Math | Easy | 21 | 0.8% |
| 1004 | Find Valid Matrix Given Row and Column Sums Array, Greedy, Matrix | Medium | 21 | 0.8% |
| 1005 | Split Two Strings to Make Palindrome Two Pointers, String | Medium | 21 | 0.3% |
| 1006 | Number of Students Unable to Eat Lunch Array, Stack, Queue, Simulation | Easy | 21 | 0.8% |
| 1007 | Replace All Digits with Characters String | Easy | 21 | 0.8% |
| 1008 | Swapping Nodes in a Linked List Linked List, Two Pointers | Medium | 21 | 0.7% |
| 1009 | Find the Maximum Number of Elements in Subset Array, Hash Table, Enumeration | Medium | 21 | 0.3% |
| 1010 | Alternating Groups II Array, Sliding Window | Medium | 21 | 0.6% |
| 1011 | Finding 3-Digit Even Numbers Array, Hash Table, Recursion, Sorting, Enumeration | Easy | 21 | 0.8% |
| 1012 | Self Dividing Numbers Math | Easy | 21 | 0.8% |
| 1013 | Separate Squares II Array, Binary Search, Segment Tree, Sweep Line | Hard | 21 | 0.6% |
| 1014 | Number of Equivalent Domino Pairs Array, Hash Table, Counting | Easy | 21 | 0.6% |
| 1015 | Maximize Subarray GCD Score Array, Math, Enumeration, Number Theory | Hard | 21 | 0.3% |
| 1016 | Partition String Hash Table, String, Trie, Simulation | Medium | 21 | 0.6% |
| 1017 | Left and Right Sum Differences Array, Prefix Sum | Easy | 21 | 0.9% |
| 1018 | Fruits Into Baskets II Array, Binary Search, Segment Tree, Simulation, Ordered Set | Easy | 21 | 0.7% |
| 1019 | Reordered Power of 2 Hash Table, Math, Sorting, Counting, Enumeration | Medium | 21 | 0.7% |
| 1020 | Minimum Cost Path with Edge Reversals Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 21 | 0.6% |
| 1021 | N-Queens II Backtracking | Hard | 20 | 0.8% |
| 1022 | Scramble String String, Dynamic Programming | Hard | 20 | 0.4% |
| 1023 | Palindrome Permutation Hash Table, String, Bit Manipulation | Easy | 20 | 0.7% |
| 1024 | Unique Word Abbreviation Array, Hash Table, String, Design | Medium | 20 | 0.3% |
| 1025 | Flip Game String | Easy | 20 | 0.7% |
| 1026 | Flip Game II Math, Dynamic Programming, Backtracking, Memoization, Game Theory | Medium | 20 | 0.5% |
| 1027 | Generalized Abbreviation String, Backtracking, Bit Manipulation | Medium | 20 | 0.6% |
| 1028 | Bomb Enemy Array, Dynamic Programming, Matrix | Medium | 20 | 0.5% |
| 1029 | Minimum Unique Word Abbreviation Array, String, Backtracking, Bit Manipulation | Hard | 20 | 0.4% |
| 1030 | Valid Word Square Array, Matrix | Easy | 20 | 0.4% |
| 1031 | Word Squares Array, String, Backtracking, Trie | Hard | 20 | 0.5% |
| 1032 | Convex Polygon Array, Math, Geometry | Medium | 20 | 0.4% |
| 1033 | Encode String with Shortest Length String, Dynamic Programming | Hard | 20 | 0.5% |
| 1034 | Find Permutation Array, String, Stack, Greedy | Medium | 20 | 0.7% |
| 1035 | Count Subarrays With More Ones Than Zeros Array, Hash Table, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Medium | 20 | 0.5% |
| 1036 | Longest Uncommon Subsequence I String | Easy | 20 | 0.6% |
| 1037 | Lonely Pixel I Array, Hash Table, Matrix | Medium | 20 | 0.6% |
| 1038 | Lonely Pixel II Array, Hash Table, Matrix | Medium | 20 | 0.5% |
| 1039 | Binary Tree Longest Consecutive Sequence II Tree, Depth-First Search, Binary Tree | Medium | 20 | 0.5% |
| 1040 | Maximum Vacation Days Array, Dynamic Programming, Matrix | Hard | 20 | 0.5% |
| 1041 | Median Employee Salary Database | Hard | 20 | 0.7% |
| 1042 | Maximum Average Subarray II Array, Binary Search, Prefix Sum | Hard | 20 | 0.4% |
| 1043 | 4 Keys Keyboard Math, Dynamic Programming | Medium | 20 | 0.6% |
| 1044 | Coin Path Array, Dynamic Programming | Hard | 20 | 0.3% |
| 1045 | Number of Longest Increasing Subsequence Array, Dynamic Programming, Binary Indexed Tree, Segment Tree | Medium | 20 | 0.5% |
| 1046 | Baseball Game Array, Stack, Simulation | Easy | 20 | 0.8% |
| 1047 | Longest Univalue Path Tree, Depth-First Search, Binary Tree | Medium | 20 | 0.4% |
| 1048 | Bold Words in String Array, Hash Table, String, Trie, String Matching | Medium | 20 | 0.5% |
| 1049 | Flatten a Multilevel Doubly Linked List Linked List, Depth-First Search, Doubly-Linked List | Medium | 20 | 0.6% |
| 1050 | Transform to Chessboard Array, Math, Bit Manipulation, Matrix | Hard | 20 | 0.5% |
| 1051 | Similar RGB Color Math, String, Enumeration | Easy | 20 | 0.7% |
| 1052 | Ambiguous Coordinates String, Backtracking, Enumeration | Medium | 20 | 0.6% |
| 1053 | Positions of Large Groups String | Easy | 20 | 0.5% |
| 1054 | Random Pick with Blacklist Array, Hash Table, Math, Binary Search, Sorting, Randomized | Hard | 20 | 0.4% |
| 1055 | Random Flip Matrix Hash Table, Math, Reservoir Sampling, Randomized | Medium | 20 | 0.5% |
| 1056 | Complete Binary Tree Inserter Tree, Breadth-First Search, Design, Binary Tree | Medium | 20 | 0.7% |
| 1057 | Array of Doubled Pairs Array, Hash Table, Greedy, Sorting | Medium | 20 | 0.4% |
| 1058 | Find the Town Judge Array, Hash Table, Graph Theory | Easy | 20 | 0.5% |
| 1059 | Shortest Way to Form String Two Pointers, String, Binary Search, Greedy | Medium | 20 | 0.6% |
| 1060 | Campus Bikes II Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 20 | 0.6% |
| 1061 | Brace Expansion String, Backtracking, Stack, Breadth-First Search, Sorting | Medium | 20 | 0.7% |
| 1062 | Confusing Number II Math, Backtracking | Hard | 20 | 0.5% |
| 1063 | Camelcase Matching Array, Two Pointers, String, Trie, String Matching | Medium | 20 | 0.7% |
| 1064 | Divide Array Into Increasing Sequences Array, Counting | Hard | 20 | 0.7% |
| 1065 | Partition Array for Maximum Sum Array, Dynamic Programming | Medium | 20 | 0.8% |
| 1066 | String Transforms Into Another String Hash Table, String, Graph Theory | Hard | 20 | 0.3% |
| 1067 | Shortest Distance to Target Color Array, Binary Search, Dynamic Programming | Medium | 20 | 0.6% |
| 1068 | Optimize Water Distribution in a Village Union-Find, Graph Theory, Heap (Priority Queue), Minimum Spanning Tree | Hard | 20 | 0.7% |
| 1069 | Occurrences After Bigram String | Easy | 20 | 0.6% |
| 1070 | Minimum Time to Build Blocks Array, Math, Greedy, Heap (Priority Queue) | Hard | 20 | 0.5% |
| 1071 | Largest Values From Labels Array, Hash Table, Greedy, Sorting, Counting | Medium | 20 | 0.6% |
| 1072 | Tree Diameter Tree, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 20 | 0.6% |
| 1073 | Iterator for Combination String, Backtracking, Design, Iterator | Medium | 20 | 0.7% |
| 1074 | Compare Strings by Frequency of the Smallest Character Array, Hash Table, String, Binary Search, Sorting | Medium | 20 | 0.6% |
| 1075 | Distance Between Bus Stops Array | Easy | 20 | 0.6% |
| 1076 | Design Skiplist Linked List, Design | Hard | 20 | 0.6% |
| 1077 | Maximum Font to Fit a Sentence in a Screen Array, String, Binary Search, Interactive | Medium | 20 | 0.6% |
| 1078 | Find Elements in a Contaminated Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Medium | 20 | 0.8% |
| 1079 | Minimum Path Cost in a Grid Array, Dynamic Programming, Matrix | Medium | 20 | 0.7% |
| 1080 | All People Report to the Given Manager Database | Medium | 20 | 0.8% |
| 1081 | Count Negative Numbers in a Sorted Matrix Array, Binary Search, Matrix | Easy | 20 | 0.8% |
| 1082 | Circle and Rectangle Overlapping Math, Geometry | Medium | 20 | 0.5% |
| 1083 | Diagonal Traverse II Array, Sorting, Heap (Priority Queue) | Medium | 20 | 0.6% |
| 1084 | Form Largest Integer With Digits That Add up to Target Array, Dynamic Programming | Hard | 20 | 0.5% |
| 1085 | People Whose List of Favorite Companies Is Not a Subset of Another List Array, Hash Table, String | Medium | 20 | 0.6% |
| 1086 | The k Strongest Values in an Array Array, Two Pointers, Sorting | Medium | 20 | 0.6% |
| 1087 | Number of Substrings With Only 1s Math, String | Medium | 20 | 0.6% |
| 1088 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target Array, Hash Table, Greedy, Prefix Sum | Medium | 20 | 0.5% |
| 1089 | Move Sub-Tree of N-Ary Tree Tree, Depth-First Search | Hard | 20 | 0.6% |
| 1090 | Guess the Majority in a Hidden Array Array, Math, Interactive | Medium | 20 | 0.7% |
| 1091 | Find Latest Group of Size M Array, Hash Table, Binary Search, Simulation | Medium | 20 | 0.4% |
| 1092 | The Most Similar Path in a Graph Array, String, Dynamic Programming, Graph Theory | Hard | 20 | 0.6% |
| 1093 | Put Boxes Into the Warehouse I Array, Greedy, Sorting | Medium | 20 | 0.7% |
| 1094 | Check If String Is Transformable With Substring Sort Operations String, Greedy, Sorting | Hard | 20 | 0.5% |
| 1095 | Put Boxes Into the Warehouse II Array, Greedy, Sorting | Medium | 20 | 0.7% |
| 1096 | Number of Ways to Form a Target String Given a Dictionary Array, String, Dynamic Programming | Hard | 20 | 0.6% |
| 1097 | Find Nearest Right Node in Binary Tree Tree, Breadth-First Search, Binary Tree | Medium | 20 | 0.8% |
| 1098 | Check If Two Expression Trees are Equivalent Hash Table, Tree, Depth-First Search, Binary Tree, Counting | Medium | 20 | 0.7% |
| 1099 | Correct a Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 20 | 0.7% |
| 1100 | Change the Root of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 20 | 0.7% |
| 1101 | Count Ways to Distribute Candies Dynamic Programming | Hard | 20 | 0.6% |
| 1102 | Largest Subarray Length K Array, Greedy | Easy | 20 | 0.7% |
| 1103 | Change Minimum Characters to Satisfy One of Three Conditions Hash Table, String, Counting, Prefix Sum | Medium | 20 | 0.4% |
| 1104 | Checking Existence of Edge Length Limited Paths II Depth-First Search, Union-Find, Graph Theory, Design, Sorting, Heap (Priority Queue), Minimum Spanning Tree | Hard | 20 | 0.5% |
| 1105 | Tree of Coprimes Array, Math, Tree, Depth-First Search, Number Theory | Hard | 20 | 0.4% |
| 1106 | Maximum Score From Removing Stones Math, Greedy, Heap (Priority Queue) | Medium | 20 | 0.7% |
| 1107 | Closest Dessert Cost Array, Dynamic Programming, Backtracking | Medium | 20 | 0.5% |
| 1108 | Find the Subtasks That Did Not Execute Database | Hard | 20 | 0.8% |
| 1109 | Minimum Number of Operations to Reinitialize a Permutation Array, Math, Simulation | Medium | 20 | 0.7% |
| 1110 | Count Pairs of Equal Substrings With Minimum Difference Hash Table, String, Greedy | Medium | 20 | 0.6% |
| 1111 | Find Customers With Positive Revenue this Year Database | Easy | 20 | 0.9% |
| 1112 | Minimum Adjacent Swaps to Reach the Kth Smallest Number Two Pointers, String, Greedy | Medium | 20 | 0.7% |
| 1113 | Number of Ways to Rearrange Sticks With K Sticks Visible Math, Dynamic Programming, Combinatorics | Hard | 20 | 0.6% |
| 1114 | Minimum Speed to Arrive on Time Array, Binary Search | Medium | 20 | 0.5% |
| 1115 | Minimum Cost to Change the Final Value of Expression Math, String, Dynamic Programming, Stack | Hard | 20 | 0.5% |
| 1116 | Longest Word With All Prefixes Array, String, Depth-First Search, Trie | Medium | 20 | 0.7% |
| 1117 | Minimum Skips to Arrive at Meeting On Time Array, Dynamic Programming | Hard | 20 | 0.4% |
| 1118 | Minimize Product Sum of Two Arrays Array, Greedy, Sorting | Medium | 20 | 0.9% |
| 1119 | Minimum Absolute Difference Queries Array, Prefix Sum | Medium | 20 | 0.5% |
| 1120 | Find a Peak Element II Array, Binary Search, Matrix | Medium | 20 | 0.6% |
| 1121 | Longest Common Subsequence Between Sorted Arrays Array, Hash Table, Counting | Medium | 20 | 0.8% |
| 1122 | Erect the Fence II Array, Math, Geometry | Hard | 20 | 0.5% |
| 1123 | Process Restricted Friend Requests Union-Find, Graph Theory | Hard | 20 | 0.6% |
| 1124 | Paths in Maze That Lead to Same Room Graph Theory | Medium | 20 | 0.6% |
| 1125 | Watering Plants II Array, Two Pointers, Simulation | Medium | 20 | 0.5% |
| 1126 | Recover the Original Array Array, Hash Table, Two Pointers, Sorting, Enumeration | Hard | 20 | 0.4% |
| 1127 | Count Words Obtained After Adding a Letter Array, Hash Table, String, Bit Manipulation, Sorting | Medium | 20 | 0.4% |
| 1128 | All Divisions With the Highest Score of a Binary Array Array | Medium | 20 | 0.7% |
| 1129 | Remove All Ones With Row and Column Flips Array, Math, Bit Manipulation, Matrix | Medium | 20 | 0.8% |
| 1130 | Minimum White Tiles After Covering With Carpets String, Dynamic Programming, Prefix Sum | Hard | 20 | 0.4% |
| 1131 | Remove All Ones With Row and Column Flips II Array, Bit Manipulation, Breadth-First Search, Matrix | Medium | 20 | 0.7% |
| 1132 | Minimum Number of Operations to Convert Time String, Greedy | Easy | 20 | 0.7% |
| 1133 | Check if There Is a Valid Parentheses String Path Array, Dynamic Programming, Matrix | Hard | 20 | 0.4% |
| 1134 | Design an ATM Machine Array, Greedy, Design | Medium | 20 | 0.5% |
| 1135 | Maximum White Tiles Covered by a Carpet Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 20 | 0.4% |
| 1136 | Minimum Lines to Represent a Line Chart Array, Math, Geometry, Sorting, Number Theory | Medium | 20 | 0.3% |
| 1137 | Booking Concert Tickets in Groups Binary Search, Design, Binary Indexed Tree, Segment Tree | Hard | 20 | 0.2% |
| 1138 | Count Positions on Street With Required Brightness Array, Prefix Sum | Medium | 20 | 0.6% |
| 1139 | Design Video Sharing Platform Hash Table, Design, Heap (Priority Queue) | Hard | 20 | 0.6% |
| 1140 | Minimum Flips in Binary Tree to Get Result Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 20 | 0.6% |
| 1141 | Subarray With Elements Greater Than Varying Threshold Array, Stack, Union-Find, Monotonic Stack | Hard | 20 | 0.5% |
| 1142 | Shortest Impossible Sequence of Rolls Array, Hash Table, Greedy | Hard | 20 | 0.7% |
| 1143 | Sort Array by Moving Items to Empty Space Array, Hash Table, Sorting | Hard | 20 | 0.5% |
| 1144 | Minimize Maximum Value in a Grid Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix | Hard | 20 | 0.7% |
| 1145 | Count Subarrays With Median K Array, Hash Table, Prefix Sum | Hard | 20 | 0.5% |
| 1146 | Extract Kth Character From The Rope Tree Tree, Depth-First Search, Binary Tree | Easy | 20 | 0.7% |
| 1147 | Count Houses in a Circular Street Array, Interactive | Easy | 20 | 0.9% |
| 1148 | Count Pairs of Points With Distance k Array, Hash Table, Bit Manipulation | Medium | 20 | 0.3% |
| 1149 | Determine if a Cell Is Reachable at a Given Time Math | Medium | 20 | 0.4% |
| 1150 | Minimum Increment Operations to Make Array Beautiful Array, Dynamic Programming | Medium | 20 | 0.3% |
| 1151 | Find Champion I Array, Matrix | Easy | 20 | 0.7% |
| 1152 | Maximum Score After Applying Operations on a Tree Dynamic Programming, Tree, Depth-First Search | Medium | 20 | 0.5% |
| 1153 | Count the Number of Good Partitions Array, Hash Table, Math, Combinatorics | Hard | 20 | 0.5% |
| 1154 | Number of Equal Numbers Blocks Array, Binary Search, Interactive | Medium | 20 | 0.6% |
| 1155 | Minimum Cost to Make Array Equalindromic Array, Math, Binary Search, Greedy, Sorting | Medium | 20 | 0.2% |
| 1156 | Maximize Consecutive Elements in an Array After Modification Array, Dynamic Programming, Sorting | Hard | 20 | 0.3% |
| 1157 | Most Frequent Prime Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory | Medium | 20 | 0.5% |
| 1158 | Latest Time You Can Obtain After Replacing Characters String, Enumeration | Easy | 20 | 0.4% |
| 1159 | Minimum Sum of Values by Dividing Array Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue | Hard | 20 | 0.3% |
| 1160 | Employees Whose Manager Left the Company Database | Easy | 20 | 0.5% |
| 1161 | Path Sum II Backtracking, Tree, Depth-First Search, Binary Tree | Medium | 20 | 0.6% |
| 1162 | Smallest Index With Equal Value Array | Easy | 20 | 0.7% |
| 1163 | Time Needed to Buy Tickets Array, Queue, Simulation | Easy | 20 | 0.7% |
| 1164 | Rings and Rods Hash Table, String | Easy | 20 | 0.8% |
| 1165 | Valid Phone Numbers Shell | Easy | 20 | 0.3% |
| 1166 | Different Ways to Add Parentheses Math, String, Dynamic Programming, Recursion, Memoization | Medium | 20 | 0.7% |
| 1167 | Amount of New Area Painted Each Day Array, Segment Tree, Ordered Set | Hard | 20 | 0.6% |
| 1168 | Integer Break Math, Dynamic Programming | Medium | 20 | 0.6% |
| 1169 | Arranging Coins Math, Binary Search | Easy | 20 | 0.5% |
| 1170 | K-diff Pairs in an Array Array, Hash Table, Two Pointers, Binary Search, Sorting | Medium | 20 | 0.5% |
| 1171 | Minimize the Maximum Difference of Pairs Array, Binary Search, Dynamic Programming, Greedy, Sorting | Medium | 20 | 0.5% |
| 1172 | Apply Transform Over Each Element in Array | Easy | 20 | 0.9% |
| 1173 | Find the Maximum Achievable Number Math | Easy | 20 | 0.9% |
| 1174 | Rabbits in Forest Array, Hash Table, Math, Greedy | Medium | 20 | 0.6% |
| 1175 | Fair Candy Swap Array, Hash Table, Binary Search, Sorting | Easy | 20 | 0.7% |
| 1176 | Range Sum of BST Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 20 | 0.9% |
| 1177 | Reveal Cards In Increasing Order Array, Queue, Sorting, Simulation | Medium | 20 | 0.8% |
| 1178 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 20 | 0.5% |
| 1179 | Find Positive Integer Solution for a Given Equation Math, Two Pointers, Binary Search, Interactive | Medium | 20 | 0.7% |
| 1180 | Maximize Total Cost of Alternating Subarrays Array, Dynamic Programming | Medium | 20 | 0.3% |
| 1181 | Frog Position After T Seconds Tree, Depth-First Search, Breadth-First Search, Graph Theory | Hard | 20 | 0.4% |
| 1182 | Shuffle String Array, String | Easy | 20 | 0.9% |
| 1183 | Fix Names in a Table Database | Easy | 20 | 0.6% |
| 1184 | Calculate Money in Leetcode Bank Math | Easy | 20 | 0.8% |
| 1185 | Find the City With the Smallest Number of Neighbors at a Threshold Distance Dynamic Programming, Graph Theory, Shortest Path | Medium | 20 | 0.7% |
| 1186 | Count the Number of Substrings With Dominant Ones String, Enumeration | Medium | 20 | 0.4% |
| 1187 | Find Smallest Letter Greater Than Target Array, Binary Search | Easy | 20 | 0.6% |
| 1188 | Final Prices With a Special Discount in a Shop Array, Stack, Monotonic Stack | Easy | 20 | 0.8% |
| 1189 | Maximum Number of Operations to Move Ones to the End String, Greedy, Counting | Medium | 20 | 0.7% |
| 1190 | Binary Tree Nodes Database | Medium | 20 | 0.8% |
| 1191 | Corporate Flight Bookings Array, Prefix Sum | Medium | 20 | 0.7% |
| 1192 | Calculate Compressed Mean Database | Easy | 20 | 0.9% |
| 1193 | Top Three Wineries Database | Hard | 20 | 0.5% |
| 1194 | Find Expensive Cities Database | Easy | 20 | 0.8% |
| 1195 | Class Performance Database | Medium | 20 | 0.9% |
| 1196 | Loan Types Database | Easy | 20 | 0.6% |
| 1197 | Find Beautiful Indices in the Given Array II Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function | Hard | 20 | 0.3% |
| 1198 | Ant on the Boundary Array, Simulation, Prefix Sum | Easy | 20 | 0.7% |
| 1199 | Add Two Numbers II Linked List, Math, Stack | Medium | 20 | 0.6% |
| 1200 | Lemonade Change Array, Greedy | Easy | 20 | 0.6% |
| 1201 | Last Stone Weight II Array, Dynamic Programming | Medium | 20 | 0.6% |
| 1202 | Defuse the Bomb Array, Sliding Window | Easy | 20 | 0.8% |
| 1203 | Maximum Area Rectangle With Point Constraints I Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration | Medium | 20 | 0.5% |
| 1204 | Minimum Absolute Difference Array, Sorting | Easy | 20 | 0.8% |
| 1205 | Number of Ways to Split Array Array, Prefix Sum | Medium | 20 | 0.6% |
| 1206 | Shifting Letters II Array, String, Prefix Sum | Medium | 20 | 0.5% |
| 1207 | Perfect Number Math | Easy | 20 | 0.5% |
| 1208 | Minimum Time to Repair Cars Array, Binary Search | Medium | 20 | 0.6% |
| 1209 | Find the Minimum Amount of Time to Brew Potions Array, Simulation, Prefix Sum | Medium | 20 | 0.6% |
| 1210 | Count Good Triplets Array, Enumeration | Easy | 20 | 0.9% |
| 1211 | Find the Count of Monotonic Pairs I Array, Math, Dynamic Programming, Combinatorics, Prefix Sum | Hard | 20 | 0.5% |
| 1212 | Kth Smallest Product of Two Sorted Arrays Array, Binary Search | Hard | 20 | 0.5% |
| 1213 | Count Cells in Overlapping Horizontal and Vertical Substrings Array, String, Rolling Hash, String Matching, Matrix, Hash Function | Medium | 20 | 0.3% |
| 1214 | Department Highest Salary Database | Medium | 20 | 0.6% |
| 1215 | Number of Stable Subsequences Array, Dynamic Programming | Hard | 20 | 0.6% |
| 1216 | Count Caesar Cipher Pairs Array, Hash Table, Math, String, Counting | Medium | 20 | 0.5% |
| 1217 | Valid Number String | Hard | 18 | 0.2% |
| 1218 | Insertion Sort List Linked List, Sorting | Medium | 18 | 0.6% |
| 1219 | Bitwise AND of Numbers Range Bit Manipulation | Medium | 18 | 0.5% |
| 1220 | Minimum Number of Arrows to Burst Balloons Array, Greedy, Sorting | Medium | 18 | 0.6% |
| 1221 | Employee Importance Array, Hash Table, Tree, Depth-First Search, Breadth-First Search | Medium | 18 | 0.7% |
| 1222 | Partition to K Equal Sum Subsets Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Medium | 18 | 0.4% |
| 1223 | Construct Quad Tree Array, Divide and Conquer, Tree, Matrix | Medium | 18 | 0.8% |
| 1224 | Minimum Number of Refueling Stops Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 18 | 0.4% |
| 1225 | Complement of Base 10 Integer Bit Manipulation | Easy | 18 | 0.6% |
| 1226 | Recover a Tree From Preorder Traversal String, Tree, Depth-First Search, Binary Tree | Hard | 18 | 0.8% |
| 1227 | Number of Steps to Reduce a Number to Zero Math, Bit Manipulation | Easy | 18 | 0.9% |
| 1228 | Min Cost to Connect All Points Array, Union-Find, Graph Theory, Minimum Spanning Tree | Medium | 18 | 0.7% |
| 1229 | Maximum Number of Events That Can Be Attended II Array, Binary Search, Dynamic Programming, Sorting | Hard | 18 | 0.6% |
| 1230 | Find Unique Binary String Array, Hash Table, String, Backtracking | Medium | 18 | 0.8% |
| 1231 | Maximum Twin Sum of a Linked List Linked List, Two Pointers, Stack | Medium | 18 | 0.8% |
| 1232 | Rectangle Area Math, Geometry | Medium | 18 | 0.5% |
| 1233 | Single Number III Array, Bit Manipulation | Medium | 18 | 0.7% |
| 1234 | Root Equals Sum of Children Tree, Binary Tree | Easy | 18 | 0.9% |
| 1235 | Keyboard Row Array, Hash Table, String | Easy | 18 | 0.7% |
| 1236 | Array Partition Array, Greedy, Sorting, Counting Sort | Easy | 18 | 0.8% |
| 1237 | Maximum Subsequence Score Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 18 | 0.5% |
| 1238 | Valid Triangle Number Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 18 | 0.6% |
| 1239 | Delete and Earn Array, Hash Table, Dynamic Programming | Medium | 18 | 0.6% |
| 1240 | Counter II | Easy | 18 | 0.8% |
| 1241 | Serialize and Deserialize N-ary Tree String, Tree, Depth-First Search, Breadth-First Search | Hard | 18 | 0.7% |
| 1242 | Design HashMap Array, Hash Table, Linked List, Design, Hash Function | Easy | 18 | 0.7% |
| 1243 | Monotonic Array Array | Easy | 18 | 0.6% |
| 1244 | Find the Shortest Superstring Array, String, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 18 | 0.5% |
| 1245 | Unique Paths III Array, Backtracking, Bit Manipulation, Matrix | Hard | 18 | 0.8% |
| 1246 | Find Common Characters Array, Hash Table, String | Easy | 18 | 0.7% |
| 1247 | Subtract the Product and Sum of Digits of an Integer Math | Easy | 18 | 0.9% |
| 1248 | Maximum Sum BST in Binary Tree Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Hard | 18 | 0.5% |
| 1249 | Check If Array Pairs Are Divisible by k Array, Hash Table, Counting | Medium | 18 | 0.5% |
| 1250 | Sort Array by Increasing Frequency Array, Hash Table, Sorting | Easy | 18 | 0.8% |
| 1251 | Determine if Two Strings Are Close Hash Table, String, Sorting, Counting | Medium | 18 | 0.5% |
| 1252 | Check if the Sentence Is Pangram Hash Table, String | Easy | 18 | 0.8% |
| 1253 | Excel Sheet Column Number Math, String | Easy | 18 | 0.7% |
| 1254 | Find Followers Count Database | Easy | 18 | 0.7% |
| 1255 | Minimum Genetic Mutation Hash Table, String, Breadth-First Search | Medium | 18 | 0.6% |
| 1256 | Investments in 2016 Database | Medium | 18 | 0.5% |
| 1257 | Minimum Number of Swaps to Make the String Balanced Two Pointers, String, Stack, Greedy | Medium | 18 | 0.8% |
| 1258 | Meeting Scheduler Array, Two Pointers, Sorting | Medium | 18 | 0.6% |
| 1259 | Count Hills and Valleys in an Array Array | Easy | 18 | 0.7% |
| 1260 | Combination Sum III Array, Backtracking | Medium | 18 | 0.7% |
| 1261 | Bitwise ORs of Subarrays Array, Dynamic Programming, Bit Manipulation | Medium | 18 | 0.6% |
| 1262 | Maximum Absolute Sum of Any Subarray Array, Dynamic Programming | Medium | 18 | 0.7% |
| 1263 | Divisible and Non-divisible Sums Difference Math | Easy | 18 | 0.9% |
| 1264 | Minimum Operations to Make Binary Array Elements Equal to One I Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum | Medium | 18 | 0.8% |
| 1265 | Special Binary String String, Divide and Conquer, Sorting | Hard | 18 | 0.8% |
| 1266 | Minimum Number of Flips to Make Binary Grid Palindromic II Array, Two Pointers, Matrix | Medium | 18 | 0.3% |
| 1267 | Maximum Value of an Ordered Triplet II Array | Medium | 18 | 0.6% |
| 1268 | Longest Continuous Increasing Subsequence Array | Easy | 18 | 0.5% |
| 1269 | Count Odd Numbers in an Interval Range Math | Easy | 18 | 0.5% |
| 1270 | Find the Original Typed String II String, Dynamic Programming, Prefix Sum | Hard | 18 | 0.5% |
| 1271 | Subdomain Visit Count Array, Hash Table, String, Counting | Medium | 18 | 0.8% |
| 1272 | N-Repeated Element in Size 2N Array Array, Hash Table | Easy | 18 | 0.8% |
| 1273 | Range Product Queries of Powers Array, Bit Manipulation, Prefix Sum | Medium | 18 | 0.6% |
| 1274 | Number of People Aware of a Secret Dynamic Programming, Queue, Simulation | Medium | 18 | 0.6% |
| 1275 | Maximize Alternating Sum Using Swaps Array, Greedy, Union-Find, Sorting | Hard | 18 | 0.6% |
| 1276 | Split Array With Minimum Difference Array, Prefix Sum | Medium | 18 | 0.3% |
| 1277 | Count Square Sum Triples Math, Enumeration | Easy | 18 | 0.8% |
| 1278 | Maximum Product of Splitted Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 18 | 0.6% |
| 1279 | Trionic Array I Array | Easy | 18 | 0.5% |
| 1280 | Minimum Bitwise OR From Grid Array, Greedy, Bit Manipulation, Matrix | Medium | 18 | 0.3% |
| 1281 | Department Top Three Salaries Database | Hard | 17 | 0.6% |
| 1282 | Shuffle an Array Array, Math, Design, Randomized | Medium | 17 | 0.6% |
| 1283 | Next Greater Element III Math, Two Pointers, String | Medium | 17 | 0.4% |
| 1284 | Reverse Words in a String III Two Pointers, String | Easy | 17 | 0.8% |
| 1285 | 2 Keys Keyboard Math, Dynamic Programming | Medium | 17 | 0.6% |
| 1286 | Number of Submatrices That Sum to Target Array, Hash Table, Matrix, Prefix Sum | Hard | 17 | 0.7% |
| 1287 | Minimum Number of Taps to Open to Water a Garden Array, Dynamic Programming, Greedy | Hard | 17 | 0.5% |
| 1288 | Check if a Parentheses String Can Be Valid String, Stack, Greedy | Medium | 17 | 0.5% |
| 1289 | Step-By-Step Directions From a Binary Tree Node to Another String, Tree, Depth-First Search, Binary Tree | Medium | 17 | 0.6% |
| 1290 | Maximum Running Time of N Computers Array, Binary Search, Greedy, Sorting | Hard | 17 | 0.6% |
| 1291 | Ugly Number II Hash Table, Math, Dynamic Programming, Heap (Priority Queue) | Medium | 17 | 0.5% |
| 1292 | Largest 3-Same-Digit Number in String String | Easy | 17 | 0.7% |
| 1293 | Number of Common Factors Math, Enumeration, Number Theory | Easy | 17 | 0.8% |
| 1294 | Cherry Pickup Array, Dynamic Programming, Matrix | Hard | 17 | 0.4% |
| 1295 | Design HashSet Array, Hash Table, Linked List, Design, Hash Function | Easy | 17 | 0.7% |
| 1296 | Long Pressed Name Two Pointers, String | Easy | 17 | 0.3% |
| 1297 | Minimum Number of K Consecutive Bit Flips Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum | Hard | 17 | 0.6% |
| 1298 | Product Sales Analysis III Database | Medium | 17 | 0.5% |
| 1299 | Relative Sort Array Array, Hash Table, Sorting, Counting Sort | Easy | 17 | 0.8% |
| 1300 | Last Person to Fit in the Bus Database | Medium | 17 | 0.7% |
| 1301 | Matrix Diagonal Sum Array, Matrix | Easy | 17 | 0.8% |
| 1302 | Primary Department for Each Employee Database | Easy | 17 | 0.7% |
| 1303 | Design Circular Deque Array, Linked List, Design, Queue | Medium | 17 | 0.6% |
| 1304 | Replace Elements with Greatest Element on Right Side Array | Easy | 17 | 0.7% |
| 1305 | Minimum Moves to Equal Array Elements Array, Math | Medium | 17 | 0.6% |
| 1306 | Additive Number String, Backtracking | Medium | 17 | 0.3% |
| 1307 | Customers Who Bought All Products Database | Medium | 17 | 0.6% |
| 1308 | Split Linked List in Parts Linked List | Medium | 17 | 0.7% |
| 1309 | Populating Next Right Pointers in Each Node II Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 17 | 0.6% |
| 1310 | XOR Queries of a Subarray Array, Bit Manipulation, Prefix Sum | Medium | 17 | 0.8% |
| 1311 | Partition Labels Hash Table, Two Pointers, String, Greedy | Medium | 17 | 0.8% |
| 1312 | Make Sum Divisible by P Array, Hash Table, Prefix Sum | Medium | 17 | 0.4% |
| 1313 | Minimum Time to Visit a Cell In a Grid Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Hard | 17 | 0.6% |
| 1314 | Remove Boxes Array, Dynamic Programming, Memoization | Hard | 17 | 0.5% |
| 1315 | Longest Happy String String, Greedy, Heap (Priority Queue) | Medium | 17 | 0.7% |
| 1316 | Find Minimum Time to Reach Last Room I Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 17 | 0.6% |
| 1317 | String Compression III String | Medium | 17 | 0.7% |
| 1318 | Maximum Gap Array, Sorting, Bucket Sort, Radix Sort | Medium | 17 | 0.5% |
| 1319 | Lowest Common Ancestor of a Binary Tree III Hash Table, Two Pointers, Tree, Binary Tree | Medium | 17 | 0.8% |
| 1320 | Rotating the Box Array, Two Pointers, Matrix | Medium | 17 | 0.8% |
| 1321 | Maximum Product of Three Numbers Array, Math, Sorting | Easy | 17 | 0.5% |
| 1322 | String Matching in an Array Array, String, String Matching | Easy | 17 | 0.7% |
| 1323 | Count the Number of Good Subarrays Array, Hash Table, Sliding Window | Medium | 17 | 0.7% |
| 1324 | Shortest Subarray to be Removed to Make Array Sorted Array, Two Pointers, Binary Search, Stack, Monotonic Stack | Medium | 17 | 0.5% |
| 1325 | Count Binary Substrings Two Pointers, String | Easy | 17 | 0.7% |
| 1326 | Movie Rating Database | Medium | 17 | 0.4% |
| 1327 | Nested List Weight Sum Depth-First Search, Breadth-First Search | Medium | 17 | 0.9% |
| 1328 | Insert Delete GetRandom O(1) - Duplicates allowed Array, Hash Table, Math, Design, Randomized | Hard | 17 | 0.4% |
| 1329 | Minimum Cost Walk in Weighted Graph Array, Bit Manipulation, Union-Find, Graph Theory | Hard | 17 | 0.7% |
| 1330 | Ways to Express an Integer as Sum of Powers Dynamic Programming | Medium | 17 | 0.5% |
| 1331 | Best Time to Buy and Sell Stock V Array, Dynamic Programming | Medium | 17 | 0.6% |
| 1332 | Minimum Increments to Equalize Leaf Paths Array, Dynamic Programming, Tree, Depth-First Search | Medium | 17 | 0.4% |
| 1333 | Game Play Analysis I Database | Easy | 17 | 0.8% |
| 1334 | Maximize Subarrays After Removing One Conflicting Pair Array, Segment Tree, Enumeration, Prefix Sum | Hard | 17 | 0.6% |
| 1335 | Best Time to Buy and Sell Stock with Transaction Fee Array, Dynamic Programming, Greedy | Medium | 17 | 0.7% |
| 1336 | Smallest Subarrays With Maximum Bitwise OR Array, Binary Search, Bit Manipulation, Sliding Window | Medium | 17 | 0.6% |
| 1337 | Rearranging Fruits Array, Hash Table, Greedy, Sort | Hard | 17 | 0.6% |
| 1338 | Threshold Majority Queries Array, Hash Table, Binary Search, Divide and Conquer, Counting, Prefix Sum | Hard | 17 | 0.2% |
| 1339 | Binary Number with Alternating Bits Bit Manipulation | Easy | 17 | 0.7% |
| 1340 | Convert Integer to the Sum of Two No-Zero Integers Math | Easy | 17 | 0.6% |
| 1341 | Minimum Sensors to Cover Grid Math | Medium | 17 | 0.7% |
| 1342 | Twisted Mirror Path Count Array, Dynamic Programming, Matrix | Medium | 17 | 0.5% |
| 1343 | Next Greater Numerically Balanced Number Hash Table, Math, Backtracking, Counting, Enumeration | Medium | 17 | 0.6% |
| 1344 | Minimum Number of Operations to Make All Array Elements Equal to 1 Array, Math, Number Theory | Medium | 17 | 0.5% |
| 1345 | Largest Prime from Consecutive Prime Sum Array, Math, Number Theory | Medium | 17 | 0.4% |
| 1346 | Power Update After K-th Largest Insertion I Array, Hash Table, Math, Segment Tree, Sorting, Heap (Priority Queue) | Medium | 17 | 0.7% |
| 1347 | Earliest Finish Time for Land and Water Rides II Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 17 | 0.6% |
| 1348 | Remove Invalid Parentheses String, Backtracking, Breadth-First Search | Hard | 15 | 0.5% |
| 1349 | Sum of Left Leaves Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 15 | 0.6% |
| 1350 | Battleships in a Board Array, Depth-First Search, Matrix | Medium | 15 | 0.8% |
| 1351 | IPO Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 15 | 0.5% |
| 1352 | Check Completeness of a Binary Tree Tree, Breadth-First Search, Binary Tree | Medium | 15 | 0.6% |
| 1353 | Minimum Time Visiting All Points Array, Math, Geometry | Easy | 15 | 0.8% |
| 1354 | Magnetic Force Between Two Balls Array, Binary Search, Sorting | Medium | 15 | 0.7% |
| 1355 | Maximum Difference Between Increasing Elements Array | Easy | 15 | 0.7% |
| 1356 | Extra Characters in a String Array, Hash Table, String, Dynamic Programming, Trie | Medium | 15 | 0.6% |
| 1357 | Get the Size of a DataFrame | Easy | 15 | 0.8% |
| 1358 | Convert a Number to Hexadecimal Math, String, Bit Manipulation | Easy | 15 | 0.5% |
| 1359 | Arithmetic Slices Array, Dynamic Programming, Sliding Window | Medium | 15 | 0.6% |
| 1360 | Strictly Palindromic Number Math, Two Pointers, Brainteaser | Medium | 15 | 0.9% |
| 1361 | Number of Unique Subjects Taught by Each Teacher Database | Easy | 15 | 0.9% |
| 1362 | Base 7 Math, String | Easy | 15 | 0.5% |
| 1363 | Maximum Length of Repeated Subarray Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function | Medium | 15 | 0.5% |
| 1364 | Implement Rand10() Using Rand7() Math, Rejection Sampling, Randomized, Probability and Statistics | Medium | 15 | 0.5% |
| 1365 | Maximum Nesting Depth of the Parentheses String, Stack | Easy | 15 | 0.8% |
| 1366 | Sorting the Sentence String, Sorting | Easy | 15 | 0.8% |
| 1367 | Maximum Population Year Array, Counting, Prefix Sum | Easy | 15 | 0.6% |
| 1368 | To Lower Case String | Easy | 15 | 0.8% |
| 1369 | Customer Placing the Largest Number of Orders Database | Easy | 15 | 0.6% |
| 1370 | Dota2 Senate String, Greedy, Queue | Medium | 15 | 0.5% |
| 1371 | Remove Nodes From Linked List Linked List, Stack, Recursion, Monotonic Stack | Medium | 15 | 0.8% |
| 1372 | The Number of the Smallest Unoccupied Chair Array, Hash Table, Heap (Priority Queue) | Medium | 15 | 0.6% |
| 1373 | Find Kth Bit in Nth Binary String String, Recursion, Simulation | Medium | 15 | 0.7% |
| 1374 | Count Number of Maximum Bitwise-OR Subsets Array, Backtracking, Bit Manipulation, Enumeration | Medium | 15 | 0.9% |
| 1375 | Delete Characters to Make Fancy String String | Easy | 15 | 0.7% |
| 1376 | Shortest Distance to a Character Array, Two Pointers, String | Easy | 15 | 0.7% |
| 1377 | Minimum Value to Get Positive Step by Step Sum Array, Prefix Sum | Easy | 15 | 0.6% |
| 1378 | Minimum Limit of Balls in a Bag Array, Binary Search | Medium | 15 | 0.7% |
| 1379 | Smallest String With Swaps Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 15 | 0.6% |
| 1380 | Take Gifts From the Richest Pile Array, Heap (Priority Queue), Simulation | Easy | 15 | 0.8% |
| 1381 | Maximum Average Pass Ratio Array, Greedy, Heap (Priority Queue) | Medium | 15 | 0.7% |
| 1382 | Detect Cycles in 2D Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 15 | 0.6% |
| 1383 | Minimize the Maximum Edge Weight of Graph Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path | Medium | 15 | 0.4% |
| 1384 | First Completely Painted Row or Column Array, Hash Table, Matrix | Medium | 15 | 0.6% |
| 1385 | Maximum Ascending Subarray Sum Array | Easy | 15 | 0.7% |
| 1386 | Construct the Lexicographically Largest Valid Sequence Array, Backtracking | Medium | 15 | 0.7% |
| 1387 | Apply Operations to an Array Array, Two Pointers, Simulation | Easy | 15 | 0.7% |
| 1388 | Find the Minimum Cost Array Permutation Array, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 15 | 0.3% |
| 1389 | Count the Number of Square-Free Subsets Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask | Medium | 15 | 0.3% |
| 1390 | Walking Robot Simulation II Design, Simulation | Medium | 15 | 0.4% |
| 1391 | Lowest Common Ancestor of Deepest Leaves Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 15 | 0.8% |
| 1392 | Count the Number of Powerful Integers Math, String, Dynamic Programming | Hard | 15 | 0.5% |
| 1393 | Count Equal and Divisible Pairs in an Array Array | Easy | 15 | 0.8% |
| 1394 | Count Largest Group Hash Table, Math, Counting | Easy | 15 | 0.7% |
| 1395 | Smallest Number With All Set Bits Math, Bit Manipulation | Easy | 15 | 0.8% |
| 1396 | Count Number of Balanced Permutations Math, String, Dynamic Programming, Combinatorics | Hard | 15 | 0.5% |
| 1397 | Minimum Equal Sum of Two Arrays After Replacing Zeros Array, Greedy | Medium | 15 | 0.5% |
| 1398 | Maximum Subarray Sum With Length Divisible by K Array, Hash Table, Prefix Sum | Medium | 15 | 0.5% |
| 1399 | Largest Perimeter Triangle Array, Math, Greedy, Sorting | Easy | 15 | 0.6% |
| 1400 | Find Words Containing Character Array, String | Easy | 15 | 0.9% |
| 1401 | Distribute Candies Among Children II Math, Combinatorics, Enumeration | Medium | 15 | 0.6% |
| 1402 | Find the Lexicographically Largest String From the Box I Two Pointers, String, Enumeration | Medium | 15 | 0.4% |
| 1403 | Sum of k-Mirror Numbers Math, Enumeration | Hard | 15 | 0.6% |
| 1404 | Trips and Users Database | Hard | 15 | 0.4% |
| 1405 | Paint House III Array, Dynamic Programming | Hard | 15 | 0.6% |
| 1406 | Find the Minimum Area to Cover All Ones I Array, Matrix | Medium | 15 | 0.8% |
| 1407 | Binary Gap Bit Manipulation | Easy | 15 | 0.7% |
| 1408 | Minimum Operations to Make Array Sum Divisible by K Array, Math | Easy | 15 | 0.9% |
| 1409 | Minimize Maximum Pair Sum in Array Array, Two Pointers, Greedy, Sorting | Medium | 15 | 0.8% |
| 1410 | Find All Possible Stable Binary Arrays I Dynamic Programming, Prefix Sum | Medium | 15 | 0.5% |
| 1411 | Maximum Path Score in a Grid Array, Dynamic Programming, Matrix | Medium | 15 | 0.5% |
| 1412 | Angle Between Hands of a Clock Math | Medium | 15 | 0.7% |
| 1413 | Number of ZigZag Arrays I Dynamic Programming, Prefix Sum | Hard | 15 | 0.5% |
| 1414 | Gray Code Math, Backtracking, Bit Manipulation | Medium | 13 | 0.7% |
| 1415 | Binary Tree Level Order Traversal II Tree, Breadth-First Search, Binary Tree | Medium | 13 | 0.7% |
| 1416 | 4Sum II Array, Hash Table | Medium | 13 | 0.6% |
| 1417 | Find Largest Value in Each Tree Row Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 13 | 0.7% |
| 1418 | Valid Square Math, Geometry | Medium | 13 | 0.5% |
| 1419 | Minimum Number of Steps to Make Two Strings Anagram Hash Table, String, Counting | Medium | 13 | 0.8% |
| 1420 | Design Browser History Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream | Medium | 13 | 0.8% |
| 1421 | Maximum Value at a Given Index in a Bounded Array Math, Binary Search, Greedy | Medium | 13 | 0.4% |
| 1422 | Find Greatest Common Divisor of Array Array, Math, Number Theory | Easy | 13 | 0.8% |
| 1423 | Longest Palindrome by Concatenating Two Letter Words Array, Hash Table, String, Greedy, Counting | Medium | 13 | 0.5% |
| 1424 | Find Closest Number to Zero Array | Easy | 13 | 0.5% |
| 1425 | Removing Stars From a String String, Stack, Simulation | Medium | 13 | 0.8% |
| 1426 | Count Subarrays With Fixed Bounds Array, Queue, Sliding Window, Monotonic Queue | Hard | 13 | 0.7% |
| 1427 | Minimum Common Value Array, Hash Table, Two Pointers, Binary Search | Easy | 13 | 0.6% |
| 1428 | Add Two Promises | Easy | 13 | 0.9% |
| 1429 | Find the Minimum and Maximum Number of Nodes Between Critical Points Linked List | Medium | 13 | 0.7% |
| 1430 | Compare Version Numbers Two Pointers, String | Medium | 13 | 0.5% |
| 1431 | Contains Duplicate III Array, Sliding Window, Sorting, Bucket Sort, Ordered Set | Hard | 13 | 0.2% |
| 1432 | Equal Row and Column Pairs Array, Hash Table, Matrix, Simulation | Medium | 13 | 0.7% |
| 1433 | Open the Lock Array, Hash Table, String, Breadth-First Search | Medium | 13 | 0.6% |
| 1434 | Painting the Walls Array, Dynamic Programming | Hard | 13 | 0.5% |
| 1435 | Nth Magical Number Math, Binary Search | Hard | 13 | 0.4% |
| 1436 | Sort Array By Parity II Array, Two Pointers, Sorting | Easy | 13 | 0.7% |
| 1437 | Balance a Binary Search Tree Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 13 | 0.9% |
| 1438 | Generate Binary Strings Without Adjacent Zeros String, Backtracking, Bit Manipulation | Medium | 13 | 0.9% |
| 1439 | Delete Leaves With a Given Value Tree, Depth-First Search, Binary Tree | Medium | 13 | 0.8% |
| 1440 | Number of Steps to Reduce a Number in Binary Representation to One String, Bit Manipulation, Simulation | Medium | 13 | 0.6% |
| 1441 | Find the Winner of the Circular Game Array, Math, Recursion, Queue, Simulation | Medium | 13 | 0.8% |
| 1442 | Sum of All Subset XOR Totals Array, Math, Backtracking, Bit Manipulation, Combinatorics, Enumeration | Easy | 13 | 0.9% |
| 1443 | Nearest Exit from Entrance in Maze Array, Breadth-First Search, Matrix | Medium | 13 | 0.5% |
| 1444 | Minimum Cost to Convert String I Array, String, Graph Theory, Shortest Path | Medium | 13 | 0.6% |
| 1445 | Count Number of Teams Array, Dynamic Programming, Binary Indexed Tree, Segment Tree | Medium | 13 | 0.7% |
| 1446 | Remove All Adjacent Duplicates in String II String, Stack | Medium | 13 | 0.6% |
| 1447 | Maximum Distance in Arrays Array, Greedy | Medium | 13 | 0.5% |
| 1448 | Minimum Moves to Equal Array Elements II Array, Math, Sorting | Medium | 13 | 0.6% |
| 1449 | Reach a Number Math, Binary Search | Medium | 13 | 0.5% |
| 1450 | Fraction Addition and Subtraction Math, String, Simulation | Medium | 13 | 0.7% |
| 1451 | Reverse Prefix of Word Two Pointers, String, Stack | Easy | 13 | 0.9% |
| 1452 | Divide Nodes Into the Maximum Number of Groups Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 13 | 0.7% |
| 1453 | Group Sold Products By The Date Database | Easy | 13 | 0.8% |
| 1454 | Smallest Number in Infinite Set Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 13 | 0.7% |
| 1455 | Sort Integers by The Number of 1 Bits Array, Bit Manipulation, Sorting, Counting | Easy | 13 | 0.8% |
| 1456 | Cousins in Binary Tree II Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 13 | 0.8% |
| 1457 | Determine Whether Matrix Can Be Obtained By Rotation Array, Matrix | Easy | 13 | 0.7% |
| 1458 | Take K of Each Character From Left and Right Hash Table, String, Sliding Window | Medium | 13 | 0.5% |
| 1459 | Next Greater Node In Linked List Array, Linked List, Stack, Monotonic Stack | Medium | 13 | 0.6% |
| 1460 | Prime Palindrome Math, Number Theory | Medium | 13 | 0.3% |
| 1461 | Identify the Largest Outlier in an Array Array, Hash Table, Counting, Enumeration | Medium | 13 | 0.4% |
| 1462 | Adding Spaces to a String Array, Two Pointers, String, Simulation | Medium | 13 | 0.7% |
| 1463 | Sort By | Easy | 13 | 0.8% |
| 1464 | Construct String With Repeat Limit Hash Table, String, Greedy, Heap (Priority Queue), Counting | Medium | 13 | 0.7% |
| 1465 | Classes With at Least 5 Students Database | Easy | 13 | 0.6% |
| 1466 | Reverse Odd Levels of Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 13 | 0.9% |
| 1467 | Day of the Year Math, String | Easy | 13 | 0.5% |
| 1468 | Construct K Palindrome Strings Hash Table, String, Greedy, Counting | Medium | 13 | 0.7% |
| 1469 | Minimize XOR Greedy, Bit Manipulation | Medium | 13 | 0.6% |
| 1470 | Bitwise XOR of All Pairings Array, Bit Manipulation, Brainteaser | Medium | 13 | 0.7% |
| 1471 | Grid Game Array, Matrix, Prefix Sum | Medium | 13 | 0.6% |
| 1472 | Find the Number of Distinct Colors Among the Balls Array, Hash Table, Simulation | Medium | 13 | 0.5% |
| 1473 | Degree of an Array Array, Hash Table | Easy | 13 | 0.6% |
| 1474 | Max Sum of a Pair With Equal Sum of Digits Array, Hash Table, Sorting, Heap (Priority Queue) | Medium | 13 | 0.7% |
| 1475 | Jump Game V Array, Dynamic Programming, Sorting | Hard | 13 | 0.8% |
| 1476 | Number of Sub-arrays With Odd Sum Array, Math, Dynamic Programming, Prefix Sum | Medium | 13 | 0.6% |
| 1477 | Hamming Distance Bit Manipulation | Easy | 13 | 0.8% |
| 1478 | Two Furthest Houses With Different Colors Array, Greedy | Easy | 13 | 0.7% |
| 1479 | Design Excel Sum Formula Array, Hash Table, String, Graph Theory, Design, Topological Sort, Matrix | Hard | 13 | 0.4% |
| 1480 | Minimum Recolors to Get K Consecutive Black Blocks String, Sliding Window | Easy | 13 | 0.7% |
| 1481 | Simple Bank System Array, Hash Table, Design, Simulation | Medium | 13 | 0.7% |
| 1482 | Merge In Between Linked Lists Linked List | Medium | 13 | 0.8% |
| 1483 | Calculate Special Bonus Database | Easy | 13 | 0.6% |
| 1484 | Maximum Units on a Truck Array, Greedy, Sorting | Easy | 13 | 0.7% |
| 1485 | Find the Count of Good Integers Hash Table, Math, Combinatorics, Enumeration | Hard | 13 | 0.7% |
| 1486 | Count Vowel Substrings of a String Hash Table, String | Easy | 13 | 0.7% |
| 1487 | Count the Number of Ideal Arrays Math, Dynamic Programming, Combinatorics, Number Theory | Hard | 13 | 0.6% |
| 1488 | Count Complete Subarrays in an Array Array, Hash Table, Sliding Window | Medium | 13 | 0.8% |
| 1489 | Get the Maximum Score Array, Two Pointers, Dynamic Programming, Greedy | Hard | 13 | 0.4% |
| 1490 | Count Operations to Obtain Zero Math, Simulation | Easy | 13 | 0.8% |
| 1491 | Rotate Function Array, Math, Dynamic Programming | Medium | 13 | 0.5% |
| 1492 | Maximum Students Taking Exam Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask | Hard | 13 | 0.5% |
| 1493 | Longest Subsequence Repeated k Times Hash Table, Two Pointers, String, Backtracking, Counting, Enumeration | Hard | 13 | 0.7% |
| 1494 | Find Subsequence of Length K With the Largest Sum Array, Hash Table, Sorting, Heap (Priority Queue) | Easy | 13 | 0.6% |
| 1495 | Find the Original Typed String I String | Easy | 13 | 0.7% |
| 1496 | Find Lucky Integer in an Array Array, Hash Table, Counting | Easy | 13 | 0.8% |
| 1497 | Maximum Fruits Harvested After at Most K Steps Array, Binary Search, Sliding Window, Prefix Sum | Hard | 13 | 0.6% |
| 1498 | Maximum 69 Number Math, Greedy | Easy | 13 | 0.8% |
| 1499 | Minimum Operations to Make Array Elements Zero Array, Math, Bit Manipulation | Hard | 13 | 0.6% |
| 1500 | Minimum Operations to Make the Integer Zero Bit Manipulation, Brainteaser, Enumeration | Medium | 13 | 0.6% |
| 1501 | The Two Sneaky Numbers of Digitville Array, Hash Table, Math | Easy | 13 | 0.9% |
| 1502 | Find Resultant Array After Removing Anagrams Array, Hash Table, String, Sorting | Easy | 13 | 0.7% |
| 1503 | Reshape the Matrix Array, Matrix, Simulation | Easy | 13 | 0.7% |
| 1504 | Check If All 1's Are at Least Length K Places Away Array | Easy | 13 | 0.6% |
| 1505 | Keep Multiplying Found Values by Two Array, Hash Table, Sorting, Simulation | Easy | 13 | 0.8% |
| 1506 | Set Intersection Size At Least Two Array, Greedy, Sorting | Hard | 13 | 0.6% |
| 1507 | Count Covered Buildings Array, Hash Table, Sorting | Medium | 13 | 0.6% |
| 1508 | Four Divisors Array, Math | Medium | 13 | 0.6% |
| 1509 | Max Dot Product of Two Subsequences Array, Dynamic Programming | Hard | 13 | 0.7% |
| 1510 | Design Parking System Design, Simulation, Counting | Easy | 13 | 0.9% |
| 1511 | Trionic Array II Array, Dynamic Programming | Hard | 13 | 0.5% |
| 1512 | Maximum Score From Grid Operations Array, Dynamic Programming, Matrix, Prefix Sum | Hard | 13 | 0.6% |
| 1513 | Minimum Initial Energy to Finish Tasks Array, Greedy, Sorting | Hard | 13 | 0.8% |
| 1514 | Block Placement Queries Array, Binary Search, Binary Indexed Tree, Segment Tree, Ordered Set | Hard | 13 | 0.4% |
| 1515 | Teemo Attacking Array, Simulation | Easy | 11 | 0.6% |
| 1516 | Brick Wall Array, Hash Table | Medium | 11 | 0.6% |
| 1517 | Find the Closest Palindrome Math, String | Hard | 11 | 0.3% |
| 1518 | Knight Probability in Chessboard Dynamic Programming | Medium | 11 | 0.6% |
| 1519 | Most Common Word Array, Hash Table, String, Counting | Easy | 11 | 0.5% |
| 1520 | Leaf-Similar Trees Tree, Depth-First Search, Binary Tree | Easy | 11 | 0.7% |
| 1521 | Increasing Order Search Tree Stack, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy | 11 | 0.8% |
| 1522 | Distinct Subsequences II String, Dynamic Programming | Hard | 11 | 0.4% |
| 1523 | Validate Stack Sequences Array, Stack, Simulation | Medium | 11 | 0.7% |
| 1524 | Minimum Score Triangulation of Polygon Array, Dynamic Programming | Medium | 11 | 0.7% |
| 1525 | Minimum Cost Tree From Leaf Values Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | Medium | 11 | 0.7% |
| 1526 | Three Consecutive Odds Array | Easy | 11 | 0.7% |
| 1527 | Find Users With Valid E-Mails Database | Easy | 11 | 0.4% |
| 1528 | Maximum Number of Visible Points Array, Math, Geometry, Sliding Window, Sorting | Hard | 11 | 0.4% |
| 1529 | Minimum Difference Between Highest and Lowest of K Scores Array, Sliding Window, Sorting | Easy | 11 | 0.7% |
| 1530 | Minimum Number of Operations to Make Array Continuous Array, Hash Table, Binary Search, Sliding Window | Hard | 11 | 0.5% |
| 1531 | Maximize the Confusion of an Exam String, Binary Search, Sliding Window, Prefix Sum | Medium | 11 | 0.7% |
| 1532 | Minimized Maximum of Products Distributed to Any Store Array, Binary Search, Greedy | Medium | 11 | 0.6% |
| 1533 | Escape the Spreading Fire Array, Binary Search, Breadth-First Search, Matrix | Hard | 11 | 0.4% |
| 1534 | Minimum Replacements to Sort the Array Array, Math, Greedy | Hard | 11 | 0.5% |
| 1535 | Minimum Penalty for a Shop String, Prefix Sum | Medium | 11 | 0.7% |
| 1536 | Pass the Pillow Math, Simulation | Easy | 11 | 0.6% |
| 1537 | Count Symmetric Integers Math, Enumeration | Easy | 11 | 0.8% |
| 1538 | Elimination Game Math, Recursion | Medium | 11 | 0.5% |
| 1539 | Remove Letter To Equalize Frequency Hash Table, String, Counting | Easy | 11 | 0.2% |
| 1540 | Design In-Memory File System Hash Table, String, Design, Trie, Sorting | Hard | 11 | 0.5% |
| 1541 | Merge Two Binary Trees Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 11 | 0.8% |
| 1542 | Print Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 11 | 0.7% |
| 1543 | Function Composition | Easy | 11 | 0.9% |
| 1544 | Allow One Function Call | Easy | 11 | 0.9% |
| 1545 | Sort Vowels in a String String, Sorting | Medium | 11 | 0.8% |
| 1546 | Count Pairs Whose Sum is Less than Target Array, Two Pointers, Binary Search, Sorting | Easy | 11 | 0.9% |
| 1547 | Possible Bipartition Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 11 | 0.5% |
| 1548 | Design File System Hash Table, String, Design, Trie | Medium | 11 | 0.7% |
| 1549 | Number of Dice Rolls With Target Sum Dynamic Programming | Medium | 11 | 0.6% |
| 1550 | Count Good Nodes in Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 11 | 0.7% |
| 1551 | Jump Game VI Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue | Medium | 11 | 0.5% |
| 1552 | Cousins in Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 11 | 0.6% |
| 1553 | Second Minimum Time to Reach Destination Breadth-First Search, Graph Theory, Shortest Path | Hard | 11 | 0.6% |
| 1554 | Number of Senior Citizens Array, String | Easy | 11 | 0.8% |
| 1555 | Stone Game II Array, Math, Dynamic Programming, Prefix Sum, Game Theory | Medium | 11 | 0.7% |
| 1556 | Minimum Swaps to Make Strings Equal Math, String, Greedy | Medium | 11 | 0.7% |
| 1557 | Count Elements With Maximum Frequency Array, Hash Table, Counting | Easy | 11 | 0.8% |
| 1558 | Find the Student that Will Replace the Chalk Array, Binary Search, Simulation, Prefix Sum | Medium | 11 | 0.5% |
| 1559 | Sort the People Array, Hash Table, String, Sorting | Easy | 11 | 0.8% |
| 1560 | Reach End of Array With Max Score Array, Greedy | Medium | 11 | 0.3% |
| 1561 | Count the Number of Consistent Strings Array, Hash Table, String, Bit Manipulation, Counting | Easy | 11 | 0.9% |
| 1562 | Number of Distinct Islands Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function | Medium | 11 | 0.6% |
| 1563 | Longest Subarray With Maximum Bitwise AND Array, Bit Manipulation, Brainteaser | Medium | 11 | 0.7% |
| 1564 | Find the Longest Substring Containing Vowels in Even Counts Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 11 | 0.8% |
| 1565 | Uncommon Words from Two Sentences Hash Table, String, Counting | Easy | 11 | 0.8% |
| 1566 | Taking Maximum Energy From the Mystic Dungeon Array, Dynamic Programming, Prefix Sum | Medium | 11 | 0.6% |
| 1567 | Maximum Height by Stacking Cuboids Array, Dynamic Programming, Sorting | Hard | 11 | 0.6% |
| 1568 | Maximum Sum of Subsequence With Non-adjacent Elements Array, Divide and Conquer, Dynamic Programming, Segment Tree | Hard | 11 | 0.2% |
| 1569 | Minimum String Length After Removing Substrings String, Stack, Simulation | Easy | 11 | 0.8% |
| 1570 | Minimum Number of Removals to Make Mountain Array Array, Binary Search, Dynamic Programming, Greedy | Hard | 11 | 0.5% |
| 1571 | Total Characters in String After Transformations II Hash Table, Math, String, Dynamic Programming, Counting | Hard | 11 | 0.6% |
| 1572 | Minimum Total Distance Traveled Array, Dynamic Programming, Sorting | Hard | 11 | 0.6% |
| 1573 | Minimum Number of Changes to Make Binary String Beautiful String | Medium | 11 | 0.8% |
| 1574 | Smallest Even Multiple Math, Number Theory | Easy | 11 | 0.9% |
| 1575 | Minimum Array End Bit Manipulation | Medium | 11 | 0.6% |
| 1576 | Nested List Weight Sum II Stack, Depth-First Search, Breadth-First Search | Medium | 11 | 0.7% |
| 1577 | Flip Columns For Maximum Number of Equal Rows Array, Hash Table, Matrix | Medium | 11 | 0.8% |
| 1578 | Count Unguarded Cells in the Grid Array, Matrix, Simulation | Medium | 11 | 0.7% |
| 1579 | Reconstruct Original Digits from English Hash Table, Math, String | Medium | 11 | 0.5% |
| 1580 | Word Frequency Shell | Medium | 11 | 0.3% |
| 1581 | Minimum Insertion Steps to Make a String Palindrome String, Dynamic Programming | Hard | 11 | 0.7% |
| 1582 | Find Center of Star Graph Graph Theory | Easy | 11 | 0.9% |
| 1583 | Maximize Subarray Sum After Removing All Occurrences of One Element Array, Hash Table, Divide and Conquer, Dynamic Programming, Segment Tree, Prefix Sum | Hard | 11 | 0.2% |
| 1584 | Super Pow Math, Divide and Conquer | Medium | 11 | 0.4% |
| 1585 | Average of Levels in Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 11 | 0.7% |
| 1586 | Course Schedule IV Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 11 | 0.6% |
| 1587 | Count of Interesting Subarrays Array, Hash Table, Prefix Sum | Medium | 11 | 0.6% |
| 1588 | Maximum Frequency After Subarray Operation Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sum | Medium | 11 | 0.3% |
| 1589 | Longest Strictly Increasing or Strictly Decreasing Subarray Array | Easy | 11 | 0.6% |
| 1590 | Maximum Total Damage With Spell Casting Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting | Medium | 11 | 0.5% |
| 1591 | Sum of Distances Array, Hash Table, Prefix Sum | Medium | 11 | 0.5% |
| 1592 | Length of Longest Fibonacci Subsequence Array, Hash Table, Dynamic Programming | Medium | 11 | 0.6% |
| 1593 | Minimum Score of a Path Between Two Cities Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 11 | 0.6% |
| 1594 | Find the Occurrence of First Almost Equal Substring String, String Matching | Hard | 11 | 0.2% |
| 1595 | Apply Operations to Maximize Score Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory | Hard | 11 | 0.5% |
| 1596 | Three Divisors Math, Enumeration, Number Theory | Easy | 11 | 0.6% |
| 1597 | Put Marbles in Bags Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 11 | 0.7% |
| 1598 | Tenth Line Shell | Easy | 11 | 0.4% |
| 1599 | Minimum Operations to Make Array Values Equal to K Array, Hash Table | Easy | 11 | 0.7% |
| 1600 | Count Good Triplets in an Array Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 11 | 0.7% |
| 1601 | Reformat Department Table Database | Easy | 11 | 0.8% |
| 1602 | Process Tasks Using Servers Array, Heap (Priority Queue) | Medium | 11 | 0.4% |
| 1603 | Patients With a Condition Database | Easy | 11 | 0.4% |
| 1604 | Custom Sort String Hash Table, String, Sorting | Medium | 11 | 0.7% |
| 1605 | Available Captures for Rook Array, Matrix, Simulation | Easy | 11 | 0.7% |
| 1606 | Count Subarrays Where Max Element Appears at Least K Times Array, Sliding Window | Medium | 11 | 0.6% |
| 1607 | Construct the Rectangle Math | Easy | 11 | 0.6% |
| 1608 | Find Most Frequent Vowel and Consonant Hash Table, String, Counting | Easy | 11 | 0.9% |
| 1609 | Can I Win Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmask | Medium | 11 | 0.3% |
| 1610 | Lexicographically Minimum String After Removing Stars Hash Table, String, Stack, Greedy, Heap (Priority Queue) | Medium | 11 | 0.5% |
| 1611 | Maximum Difference Between Even and Odd Frequency II String, Sliding Window, Enumeration, Prefix Sum | Hard | 11 | 0.5% |
| 1612 | Find the Pivot Integer Math, Prefix Sum | Easy | 11 | 0.8% |
| 1613 | Find the K-th Character in String Game II Math, Bit Manipulation, Recursion | Hard | 11 | 0.5% |
| 1614 | Finding Pairs With a Certain Sum Array, Hash Table, Design | Medium | 11 | 0.6% |
| 1615 | Valid Word String | Easy | 11 | 0.5% |
| 1616 | Add to Array-Form of Integer Array, Math | Easy | 11 | 0.5% |
| 1617 | Count Partitions With Max-Min Difference at Most K Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue | Medium | 11 | 0.6% |
| 1618 | Maximum Unique Subarray Sum After Deletion Array, Hash Table, Greedy | Easy | 11 | 0.4% |
| 1619 | Transpose File Shell | Medium | 11 | 0.3% |
| 1620 | Largest Number After Digit Swaps by Parity Sorting, Heap (Priority Queue) | Easy | 11 | 0.7% |
| 1621 | Fruits Into Baskets III Array, Binary Search, Segment Tree, Ordered Set | Medium | 11 | 0.4% |
| 1622 | Invalid Transactions Array, Hash Table, String, Sorting | Medium | 11 | 0.3% |
| 1623 | Sort Matrix by Diagonals Array, Sorting, Matrix | Medium | 11 | 0.8% |
| 1624 | Alice and Bob Playing Flower Game Math | Medium | 11 | 0.6% |
| 1625 | Minimum Number of People to Teach Array, Hash Table, Greedy | Medium | 11 | 0.7% |
| 1626 | Replace Non-Coprime Numbers in Array Array, Math, Stack, Number Theory | Hard | 11 | 0.6% |
| 1627 | Maximum Number of Words You Can Type Hash Table, String | Easy | 11 | 0.8% |
| 1628 | Power Grid Maintenance Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set | Medium | 11 | 0.6% |
| 1629 | Maximize the Minimum Powered City Array, Binary Search, Greedy, Queue, Sliding Window, Prefix Sum | Hard | 11 | 0.6% |
| 1630 | Minimum Operations to Convert All Elements to Zero Array, Hash Table, Stack, Greedy, Monotonic Stack | Medium | 11 | 0.5% |
| 1631 | Count of Matches in Tournament Math, Simulation | Easy | 11 | 0.9% |
| 1632 | 1-bit and 2-bit Characters Array | Easy | 11 | 0.5% |
| 1633 | Greatest Sum Divisible by Three Array, Dynamic Programming, Greedy, Sorting | Medium | 11 | 0.6% |
| 1634 | Process String with Special Operations II String, Simulation | Hard | 11 | 0.4% |
| 1635 | Count Special Triplets Array, Hash Table, Counting | Medium | 11 | 0.5% |
| 1636 | Number of Smooth Descent Periods of a Stock Array, Math, Two Pointers, Dynamic Programming, Sliding Window | Medium | 11 | 0.7% |
| 1637 | Number of Ways to Paint N × 3 Grid Dynamic Programming | Hard | 11 | 0.8% |
| 1638 | Find Missing Elements Array, Hash Table, Sorting | Easy | 11 | 0.8% |
| 1639 | Tallest Billboard Array, Dynamic Programming | Hard | 11 | 0.5% |
| 1640 | Minimum ASCII Delete Sum for Two Strings String, Dynamic Programming | Medium | 11 | 0.7% |
| 1641 | Maximum Square Area by Removing Fences From a Field Array, Hash Table, Enumeration | Medium | 11 | 0.5% |
| 1642 | Minimum Removals to Balance Array Array, Binary Search, Sliding Window, Sorting | Medium | 11 | 0.5% |
| 1643 | Restaurant Growth Database | Medium | 11 | 0.6% |
| 1644 | Longest Balanced Substring II Hash Table, String, Prefix Sum | Medium | 11 | 0.4% |
| 1645 | Jump Game IX Array, Dynamic Programming | Medium | 11 | 0.5% |
| 1646 | Minimum Jumps to Reach End via Prime Teleportation Array, Hash Table, Math, Breadth-First Search, Number Theory | Medium | 11 | 0.4% |
| 1647 | Minimum Moves to Make Array Complementary Array, Hash Table, Prefix Sum | Medium | 11 | 0.6% |
| 1648 | Check if Array is Good Array, Hash Table, Sorting | Easy | 11 | 0.6% |
| 1649 | Count the Number of Special Characters II Hash Table, String | Medium | 11 | 0.6% |
| 1650 | Earliest Finish Time for Land and Water Rides I Array, Two Pointers, Binary Search, Greedy, Sorting | Easy | 11 | 0.7% |
| 1651 | Number of Ways to Assign Edge Weights II Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search | Hard | 11 | 0.7% |
| 1652 | Find Right Interval Array, Binary Search, Sorting | Medium | 8 | 0.6% |
| 1653 | Minesweeper Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 8 | 0.7% |
| 1654 | K Inverse Pairs Array Dynamic Programming | Hard | 8 | 0.5% |
| 1655 | Number of Days Between Two Dates Math, String | Easy | 8 | 0.5% |
| 1656 | Constrained Subsequence Sum Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 8 | 0.6% |
| 1657 | Maximum Number of Vowels in a Substring of Given Length String, Sliding Window | Medium | 8 | 0.6% |
| 1658 | Path Crossing Hash Table, String | Easy | 8 | 0.6% |
| 1659 | Delete Duplicate Folders in System Array, Hash Table, String, Depth-First Search, Trie, Sorting, Hash Function | Hard | 8 | 0.8% |
| 1660 | Count Number of Pairs With Absolute Difference K Array, Hash Table, Counting | Easy | 8 | 0.9% |
| 1661 | Count Nodes Equal to Average of Subtree Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.9% |
| 1662 | Most Frequent Even Element Array, Hash Table, Counting | Easy | 8 | 0.5% |
| 1663 | Remove Digit From Number to Maximize Result String, Greedy, Enumeration | Easy | 8 | 0.5% |
| 1664 | Design a Food Rating System Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set | Medium | 8 | 0.5% |
| 1665 | Longest Cycle in a Graph Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 8 | 0.5% |
| 1666 | Amount of Time for Binary Tree to Be Infected Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 8 | 0.7% |
| 1667 | Arithmetic Slices II - Subsequence Array, Dynamic Programming | Hard | 8 | 0.6% |
| 1668 | Count the Digits That Divide a Number Math | Easy | 8 | 0.9% |
| 1669 | Strange Printer String, Dynamic Programming | Hard | 8 | 0.6% |
| 1670 | Check if Object Instance of Class | Medium | 8 | 0.3% |
| 1671 | N-ary Tree Level Order Traversal Tree, Breadth-First Search | Medium | 8 | 0.7% |
| 1672 | Number of Lines To Write String Array, String | Easy | 8 | 0.7% |
| 1673 | Most Profit Assigning Work Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 8 | 0.6% |
| 1674 | Rectangle Area II Array, Segment Tree, Sweep Line, Ordered Set | Hard | 8 | 0.6% |
| 1675 | Verifying an Alien Dictionary Array, Hash Table, String | Easy | 8 | 0.6% |
| 1676 | Binary Tree Cameras Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 8 | 0.5% |
| 1677 | Satisfiability of Equality Equations Array, String, Union-Find, Graph Theory | Medium | 8 | 0.5% |
| 1678 | Check If It Is a Good Array Array, Math, Number Theory | Hard | 8 | 0.7% |
| 1679 | Widest Vertical Area Between Two Points Containing No Points Array, Sorting | Easy | 8 | 0.9% |
| 1680 | Seat Reservation Manager Design, Heap (Priority Queue) | Medium | 8 | 0.7% |
| 1681 | Longest Nice Substring Hash Table, String, Divide and Conquer, Bit Manipulation, Sliding Window | Easy | 8 | 0.6% |
| 1682 | Check if the Rectangle Corner Is Reachable Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry | Hard | 8 | 0.3% |
| 1683 | Build Array Where You Can Find The Maximum Exactly K Comparisons Dynamic Programming, Prefix Sum | Hard | 8 | 0.7% |
| 1684 | Maximum Odd Binary Number Math, String, Greedy | Easy | 8 | 0.8% |
| 1685 | Minimum Bit Flips to Convert Number Bit Manipulation | Easy | 8 | 0.9% |
| 1686 | Basic Calculator IV Hash Table, Math, String, Stack, Recursion | Hard | 8 | 0.5% |
| 1687 | Number Complement Bit Manipulation | Easy | 8 | 0.7% |
| 1688 | Count Sub Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 8 | 0.7% |
| 1689 | Modify Graph Edge Weights Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 8 | 0.6% |
| 1690 | Find Minimum Operations to Make All Elements Divisible by Three Array, Math | Easy | 8 | 0.9% |
| 1691 | Count the Number of Special Characters I Hash Table, String | Easy | 8 | 0.8% |
| 1692 | Find Winner on a Tic Tac Toe Game Array, Hash Table, Matrix, Simulation | Easy | 8 | 0.5% |
| 1693 | Pairs of Songs With Total Durations Divisible by 60 Array, Hash Table, Counting | Medium | 8 | 0.5% |
| 1694 | Find a Safe Walk Through a Grid Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 8 | 0.3% |
| 1695 | Score of Parentheses String, Stack | Medium | 8 | 0.6% |
| 1696 | Divide Intervals Into Minimum Number of Groups Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 8 | 0.6% |
| 1697 | Tweet Counts Per Frequency Hash Table, String, Binary Search, Design, Sorting, Ordered Set | Medium | 8 | 0.5% |
| 1698 | Separate Black and White Balls Two Pointers, String, Greedy | Medium | 8 | 0.6% |
| 1699 | Sort Items by Groups Respecting Dependencies Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 8 | 0.7% |
| 1700 | Two City Scheduling Array, Greedy, Sorting | Medium | 8 | 0.7% |
| 1701 | Best Meeting Point Array, Math, Sorting, Matrix | Hard | 8 | 0.6% |
| 1702 | Largest Combination With Bitwise AND Greater Than Zero Array, Hash Table, Bit Manipulation, Counting | Medium | 8 | 0.8% |
| 1703 | Shortest Subarray With OR at Least K II Array, Bit Manipulation, Sliding Window | Medium | 8 | 0.5% |
| 1704 | Most Beautiful Item for Each Query Array, Binary Search, Sorting | Medium | 8 | 0.6% |
| 1705 | Find the Power of K-Size Subarrays I Array, Sliding Window | Medium | 8 | 0.6% |
| 1706 | Shortest Distance After Road Addition Queries I Array, Breadth-First Search, Graph Theory | Medium | 8 | 0.6% |
| 1707 | Find Score of an Array After Marking All Elements Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Medium | 8 | 0.6% |
| 1708 | Find Minimum Diameter After Merging Two Trees Tree, Depth-First Search, Breadth-First Search, Graph Theory | Hard | 8 | 0.6% |
| 1709 | Number of Segments in a String String | Easy | 8 | 0.4% |
| 1710 | Convert the Temperature Math | Easy | 8 | 0.9% |
| 1711 | Maximum Coins From K Consecutive Bags Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 8 | 0.3% |
| 1712 | Coloring A Border Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 8 | 0.5% |
| 1713 | Row With Maximum Ones Array, Matrix | Easy | 8 | 0.7% |
| 1714 | Analyze User Website Visit Pattern Array, Hash Table, String, Sorting | Medium | 8 | 0.4% |
| 1715 | Max Pair Sum in an Array Array, Hash Table | Easy | 8 | 0.6% |
| 1716 | Count Univalue Subtrees Tree, Depth-First Search, Binary Tree | Medium | 8 | 0.6% |
| 1717 | Find Good Days to Rob the Bank Array, Dynamic Programming, Prefix Sum | Medium | 8 | 0.5% |
| 1718 | Maximum Product of Two Elements in an Array Array, Sorting, Heap (Priority Queue) | Easy | 8 | 0.8% |
| 1719 | Check if One String Swap Can Make Strings Equal Hash Table, String, Counting | Easy | 8 | 0.5% |
| 1720 | Minimum Operations to Make the Array Increasing Array, Greedy | Easy | 8 | 0.8% |
| 1721 | Minimum Time to Complete Trips Array, Binary Search | Medium | 8 | 0.4% |
| 1722 | Univalued Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 8 | 0.7% |
| 1723 | Sum of Unique Elements Array, Hash Table, Counting | Easy | 8 | 0.8% |
| 1724 | Minimum Number Game Array, Sorting, Heap (Priority Queue), Simulation | Easy | 8 | 0.9% |
| 1725 | Find Indices of Stable Mountains Array | Easy | 8 | 0.9% |
| 1726 | Parse Lisp Expression Hash Table, String, Stack, Recursion | Hard | 8 | 0.5% |
| 1727 | Divide Array Into Equal Pairs Array, Hash Table, Bit Manipulation, Counting | Easy | 8 | 0.8% |
| 1728 | Maximum Repeating Substring String, Dynamic Programming, String Matching | Easy | 8 | 0.4% |
| 1729 | Minimum Operations to Make a Uni-Value Grid Array, Math, Sorting, Matrix | Medium | 8 | 0.7% |
| 1730 | Minimum Index of a Valid Split Array, Hash Table, Sorting | Medium | 8 | 0.8% |
| 1731 | Maximum Number of Points From Grid Queries Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix | Hard | 8 | 0.6% |
| 1732 | Minimum Cuts to Divide a Circle Math, Geometry | Easy | 8 | 0.6% |
| 1733 | Maximum Value of an Ordered Triplet I Array | Easy | 8 | 0.6% |
| 1734 | Find the String with LCP Array, String, Dynamic Programming, Greedy, Union-Find, Matrix | Hard | 8 | 0.6% |
| 1735 | Filter Elements from Array | Easy | 8 | 0.9% |
| 1736 | Mirror Reflection Math, Geometry, Number Theory | Medium | 8 | 0.6% |
| 1737 | Serialize and Deserialize BST String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Search Tree, Binary Tree | Medium | 8 | 0.6% |
| 1738 | Check if Matrix Is X-Matrix Array, Matrix | Easy | 8 | 0.7% |
| 1739 | Make Array Non-decreasing Array, Stack, Greedy, Monotonic Stack | Medium | 8 | 0.6% |
| 1740 | Count the Hidden Sequences Array, Prefix Sum | Medium | 8 | 0.6% |
| 1741 | All Paths From Source to Target Backtracking, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 8 | 0.8% |
| 1742 | Minimum Swaps to Sort by Digit Sum Array, Hash Table, Sorting | Medium | 8 | 0.5% |
| 1743 | Maximum Product of Two Digits Math, Sorting | Easy | 8 | 0.7% |
| 1744 | The Latest Login in 2020 Database | Easy | 8 | 0.8% |
| 1745 | Maximize the Number of Target Nodes After Connecting Trees I Tree, Depth-First Search, Breadth-First Search | Medium | 8 | 0.7% |
| 1746 | String Without AAA or BBB String, Greedy | Medium | 8 | 0.5% |
| 1747 | Maximize the Number of Target Nodes After Connecting Trees II Tree, Depth-First Search, Breadth-First Search | Hard | 8 | 0.7% |
| 1748 | Lexicographically Smallest Equivalent String String, Union-Find | Medium | 8 | 0.8% |
| 1749 | Maximum Difference Between Adjacent Elements in a Circular Array Array | Easy | 8 | 0.8% |
| 1750 | Max Difference You Can Get From Changing an Integer Math, Greedy | Medium | 8 | 0.5% |
| 1751 | Find Weighted Median Node in Tree Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search | Hard | 8 | 0.3% |
| 1752 | Number of Squareful Arrays Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 8 | 0.5% |
| 1753 | Validate IP Address String | Medium | 8 | 0.3% |
| 1754 | Matchsticks to Square Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 8 | 0.4% |
| 1755 | Maximum Nesting Depth of Two Valid Parentheses Strings String, Stack | Medium | 8 | 0.7% |
| 1756 | Minimum Difference in Sums After Removal of Elements Array, Dynamic Programming, Heap (Priority Queue) | Hard | 8 | 0.7% |
| 1757 | Reorder Routes to Make All Paths Lead to the City Zero Depth-First Search, Breadth-First Search, Graph Theory | Medium | 8 | 0.7% |
| 1758 | Decode the Message Hash Table, String | Easy | 8 | 0.9% |
| 1759 | Find Common Elements Between Two Arrays Array, Hash Table | Easy | 8 | 0.8% |
| 1760 | Maximum Subarray With Equal Products Array, Math, Sliding Window, Enumeration, Number Theory | Easy | 8 | 0.5% |
| 1761 | Vowel Spellchecker Array, Hash Table, String | Medium | 8 | 0.6% |
| 1762 | Friend Requests II: Who Has the Most Friends Database | Medium | 8 | 0.6% |
| 1763 | Subsequence Sum After Capping Elements Array, Two Pointers, Dynamic Programming, Sorting | Medium | 8 | 0.3% |
| 1764 | Design Spreadsheet Array, Hash Table, String, Design, Matrix | Medium | 8 | 0.7% |
| 1765 | Minimum Moves to Move a Box to Their Target Location Array, Breadth-First Search, Heap (Priority Queue), Matrix | Hard | 8 | 0.5% |
| 1766 | Successful Pairs of Spells and Potions Array, Two Pointers, Binary Search, Sorting | Medium | 8 | 0.5% |
| 1767 | Minimum Cost to Reach Destination in Time Array, Dynamic Programming, Graph Theory | Hard | 8 | 0.4% |
| 1768 | Check If Digits Are Equal in String After Operations I Math, String, Simulation, Combinatorics, Number Theory | Easy | 8 | 0.8% |
| 1769 | Make Array Elements Equal to Zero Array, Simulation, Prefix Sum | Easy | 8 | 0.7% |
| 1770 | Find and Replace Pattern Array, Hash Table, String | Medium | 8 | 0.8% |
| 1771 | Largest Magic Square Array, Matrix, Prefix Sum | Medium | 8 | 0.8% |
| 1772 | Find X-Sum of All K-Long Subarrays II Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 8 | 0.4% |
| 1773 | Actors and Directors Who Cooperated At Least Three Times Database | Easy | 8 | 0.7% |
| 1774 | Concatenate Non-Zero Digits and Multiply by Sum II Math, String, Prefix Sum | Medium | 8 | 0.2% |
| 1775 | Count Partitions with Even Sum Difference Array, Math, Prefix Sum | Easy | 8 | 0.9% |
| 1776 | Trim a Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 8 | 0.7% |
| 1777 | Total Waviness of Numbers in Range I Math, Dynamic Programming, Enumeration | Medium | 8 | 0.9% |
| 1778 | Count the Number of Computer Unlocking Permutations Array, Math, Brainteaser, Combinatorics | Medium | 8 | 0.6% |
| 1779 | Apple Redistribution into Boxes Array, Greedy, Sorting | Easy | 8 | 0.8% |
| 1780 | Smallest Subtree with all the Deepest Nodes Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 8 | 0.8% |
| 1781 | Find Words That Can Be Formed by Characters Array, Hash Table, String, Counting | Easy | 8 | 0.7% |
| 1782 | Find Players With Zero or One Losses Array, Hash Table, Sorting, Counting | Medium | 8 | 0.7% |
| 1783 | Find Nth Smallest Integer With K One Bits Math, Bit Manipulation, Combinatorics | Hard | 8 | 0.4% |
| 1784 | Minimum Cost Path with Teleportations Array, Dynamic Programming, Matrix | Hard | 8 | 0.5% |
| 1785 | Maximize Cyclic Partition Score Array, Dynamic Programming | Hard | 8 | 0.1% |
| 1786 | Minimum Deletions to Make Array Divisible Array, Math, Sorting, Heap (Priority Queue), Number Theory | Hard | 8 | 0.6% |
| 1787 | Prime Number of Set Bits in Binary Representation Math, Bit Manipulation | Easy | 8 | 0.8% |
| 1788 | Sum of Root To Leaf Binary Numbers Tree, Depth-First Search, Binary Tree | Easy | 8 | 0.8% |
| 1789 | Minimum Operations to Equalize Binary String Math, String, Breadth-First Search, Union-Find, Ordered Set | Hard | 8 | 0.5% |
| 1790 | Market Analysis I Database | Medium | 8 | 0.6% |
| 1791 | Concatenation of Consecutive Binary Numbers Math, Bit Manipulation, Simulation | Medium | 8 | 0.7% |
| 1792 | Maximize Spanning Tree Stability with Upgrades Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Tree | Hard | 8 | 0.7% |
| 1793 | Get Biggest Three Rhombus Sums in a Grid Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum | Medium | 8 | 0.7% |
| 1794 | Count Submatrices with Top-Left Element and Sum Less Than k Array, Matrix, Prefix Sum | Medium | 8 | 0.7% |
| 1795 | Minimum Absolute Difference in Sliding Submatrix Array, Sorting, Matrix | Medium | 8 | 0.8% |
| 1796 | Equal Sum Grid Partition I Array, Matrix, Enumeration, Prefix Sum | Medium | 8 | 0.5% |
| 1797 | Equal Sum Grid Partition II Array, Hash Table, Matrix, Enumeration, Prefix Sum | Hard | 8 | 0.4% |
| 1798 | Lexicographically Smallest Generated String String, Greedy, String Matching | Hard | 8 | 0.5% |
| 1799 | Maximize the Distance Between Points on a Square Array, Math, Binary Search, Geometry, Sorting | Hard | 8 | 0.5% |
| 1800 | Separate the Digits in an Array Array, Simulation | Easy | 8 | 0.9% |
| 1801 | Total Waviness of Numbers in Range II Math, Dynamic Programming | Hard | 8 | 0.6% |
| 1802 | Number of ZigZag Arrays II Math, Dynamic Programming | Hard | 8 | 0.7% |
| 1803 | Read N Characters Given Read4 Array, Simulation, Interactive | Easy | 6 | 0.4% |
| 1804 | Find the Celebrity Two Pointers, Graph Theory, Interactive | Medium | 6 | 0.5% |
| 1805 | Range Sum Query - Mutable Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Tree | Medium | 6 | 0.4% |
| 1806 | Data Stream as Disjoint Intervals Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Set | Hard | 6 | 0.6% |
| 1807 | Max Stack Linked List, Stack, Design, Doubly-Linked List, Ordered Set | Hard | 6 | 0.5% |
| 1808 | Remove Comments Array, String | Medium | 6 | 0.4% |
| 1809 | Consecutive Numbers Sum Math, Enumeration | Hard | 6 | 0.4% |
| 1810 | Building H2O Concurrency | Medium | 6 | 0.6% |
| 1811 | The K Weakest Rows in a Matrix Array, Binary Search, Sorting, Heap (Priority Queue), Matrix | Easy | 6 | 0.7% |
| 1812 | Linked List in Binary Tree Linked List, Tree, Depth-First Search, Binary Tree | Medium | 6 | 0.5% |
| 1813 | HTML Entity Parser Hash Table, String | Medium | 6 | 0.5% |
| 1814 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component | Hard | 6 | 0.7% |
| 1815 | Check If Two String Arrays are Equivalent Array, String | Easy | 6 | 0.9% |
| 1816 | Count Number of Homogenous Substrings Math, String | Medium | 6 | 0.6% |
| 1817 | Maximum Number of Accepted Invitations Array, Depth-First Search, Graph Theory, Matrix | Medium | 6 | 0.5% |
| 1818 | Count Unreachable Pairs of Nodes in an Undirected Graph Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 6 | 0.5% |
| 1819 | Minimum Cost to Make Array Equal Array, Binary Search, Greedy, Sorting, Prefix Sum | Hard | 6 | 0.5% |
| 1820 | Count Palindromic Subsequences String, Dynamic Programming | Hard | 6 | 0.4% |
| 1821 | Minimum Additions to Make Valid String String, Dynamic Programming, Stack, Greedy | Medium | 6 | 0.5% |
| 1822 | Strong Password Checker String, Greedy, Heap (Priority Queue) | Hard | 6 | 0.2% |
| 1823 | Find Bottom Left Tree Value Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 6 | 0.7% |
| 1824 | Append Characters to String to Make Subsequence Two Pointers, String, Greedy | Medium | 6 | 0.7% |
| 1825 | Maximum Length of Pair Chain Array, Dynamic Programming, Greedy, Sorting | Medium | 6 | 0.6% |
| 1826 | Robot Collisions Array, Stack, Sorting, Simulation | Hard | 6 | 0.6% |
| 1827 | Max Increase to Keep City Skyline Array, Greedy, Matrix | Medium | 6 | 0.9% |
| 1828 | Score After Flipping Matrix Array, Greedy, Bit Manipulation, Matrix | Medium | 6 | 0.8% |
| 1829 | Minimum Increment to Make Array Unique Array, Greedy, Sorting, Counting | Medium | 6 | 0.6% |
| 1830 | Height Checker Array, Sorting, Counting Sort | Easy | 6 | 0.8% |
| 1831 | Find the Maximum Sum of Node Values Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting | Hard | 6 | 0.7% |
| 1832 | Maximum Score Words Formed by Letters Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmask | Hard | 6 | 0.8% |
| 1833 | Verbal Arithmetic Puzzle Array, Math, String, Backtracking | Hard | 6 | 0.3% |
| 1834 | Number of Operations to Make Network Connected Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 6 | 0.7% |
| 1835 | Maximum Performance of a Team Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 6 | 0.5% |
| 1836 | Subrectangle Queries Array, Design, Matrix | Medium | 6 | 0.9% |
| 1837 | Egg Drop With 2 Eggs and N Floors Math, Dynamic Programming | Medium | 6 | 0.7% |
| 1838 | Minimum Swaps to Group All 1's Together II Array, Sliding Window | Medium | 6 | 0.7% |
| 1839 | N-ary Tree Postorder Traversal Stack, Tree, Depth-First Search | Easy | 6 | 0.8% |
| 1840 | N-ary Tree Preorder Traversal Stack, Tree, Depth-First Search | Easy | 6 | 0.8% |
| 1841 | Minimum Moves to Convert String String, Greedy | Easy | 6 | 0.6% |
| 1842 | Sum of Digits of String After Convert String, Simulation | Easy | 6 | 0.7% |
| 1843 | Spiral Matrix IV Array, Linked List, Matrix, Simulation | Medium | 6 | 0.8% |
| 1844 | Restore the Array From Adjacent Pairs Array, Hash Table, Depth-First Search | Medium | 6 | 0.8% |
| 1845 | Super Washing Machines Array, Greedy | Hard | 6 | 0.4% |
| 1846 | Shortest String That Contains Three Strings String, Greedy, Enumeration | Medium | 6 | 0.3% |
| 1847 | Maximum Subarray Sum with One Deletion Array, Dynamic Programming | Medium | 6 | 0.5% |
| 1848 | Chalkboard XOR Game Array, Math, Bit Manipulation, Brainteaser, Game Theory | Hard | 6 | 0.7% |
| 1849 | Make Array Non-decreasing or Non-increasing Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 6 | 0.7% |
| 1850 | K-th Largest Perfect Subtree Size in Binary Tree Tree, Depth-First Search, Sorting, Binary Tree | Medium | 6 | 0.6% |
| 1851 | Create Target Array in the Given Order Array, Simulation | Easy | 6 | 0.9% |
| 1852 | Maximum Number of Moves in a Grid Array, Dynamic Programming, Matrix | Medium | 6 | 0.6% |
| 1853 | Dot Product of Two Sparse Vectors Array, Hash Table, Two Pointers, Design | Medium | 6 | 0.9% |
| 1854 | Day of the Week Math | Easy | 6 | 0.6% |
| 1855 | Sliding Puzzle Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix | Hard | 6 | 0.7% |
| 1856 | Find the Middle Index in Array Array, Prefix Sum | Easy | 6 | 0.7% |
| 1857 | Check If a Word Occurs As a Prefix of Any Word in a Sentence Two Pointers, String, String Matching | Easy | 6 | 0.7% |
| 1858 | Binary Search Tree to Greater Sum Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 6 | 0.9% |
| 1859 | Maximum Possible Number by Binary Concatenation Array, Bit Manipulation, Enumeration | Medium | 6 | 0.7% |
| 1860 | Find Building Where Alice and Bob Can Meet Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack | Hard | 6 | 0.5% |
| 1861 | Find Triangular Sum of an Array Array, Math, Simulation, Combinatorics, Number Theory | Medium | 6 | 0.8% |
| 1862 | Minimum Number of Operations to Sort a Binary Tree by Level Tree, Breadth-First Search, Binary Tree | Medium | 6 | 0.7% |
| 1863 | Find the Key of the Numbers Math | Easy | 6 | 0.8% |
| 1864 | Count Ways To Build Good Strings Dynamic Programming | Medium | 6 | 0.6% |
| 1865 | Ways to Split Array Into Three Subarrays Array, Two Pointers, Binary Search, Prefix Sum | Medium | 6 | 0.3% |
| 1866 | Convert BST to Greater Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 6 | 0.7% |
| 1867 | Manhattan Distances of All Arrangements of Pieces Math, Combinatorics | Hard | 6 | 0.4% |
| 1868 | Count Items Matching a Rule Array, String | Easy | 6 | 0.9% |
| 1869 | Merge Nodes in Between Zeros Linked List, Simulation | Medium | 6 | 0.9% |
| 1870 | Swap For Longest Repeated Character Substring Hash Table, String, Sliding Window | Medium | 6 | 0.4% |
| 1871 | Find the Distance Value Between Two Arrays Array, Two Pointers, Binary Search, Sorting | Easy | 6 | 0.7% |
| 1872 | Uncrossed Lines Array, Dynamic Programming | Medium | 6 | 0.7% |
| 1873 | Maximum Number of Fish in a Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 6 | 0.7% |
| 1874 | Maximum Distance Between a Pair of Values Array, Two Pointers, Binary Search | Medium | 6 | 0.6% |
| 1875 | Minimum Operations to Exceed Threshold Value II Array, Heap (Priority Queue), Simulation | Medium | 6 | 0.5% |
| 1876 | Biggest Single Number Database | Easy | 6 | 0.7% |
| 1877 | Split Array into Fibonacci Sequence String, Backtracking | Medium | 6 | 0.4% |
| 1878 | Construct Smallest Number From DI String String, Backtracking, Stack, Greedy | Medium | 6 | 0.9% |
| 1879 | Select Data | Easy | 6 | 0.8% |
| 1880 | Length of Longest V-Shaped Diagonal Segment Array, Dynamic Programming, Memoization, Matrix | Hard | 6 | 0.6% |
| 1881 | Display the First Three Rows | Easy | 6 | 0.9% |
| 1882 | Maximum Subarray Min-Product Array, Stack, Monotonic Stack, Prefix Sum | Medium | 6 | 0.4% |
| 1883 | Number of Distinct Islands II Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function | Hard | 6 | 0.6% |
| 1884 | Count Total Number of Colored Cells Math | Medium | 6 | 0.7% |
| 1885 | Reshape Data: Concatenate | Easy | 6 | 0.9% |
| 1886 | Total Appeal of A String Hash Table, String, Dynamic Programming | Hard | 6 | 0.6% |
| 1887 | Longest Non-decreasing Subarray From Two Arrays Array, Dynamic Programming | Medium | 6 | 0.3% |
| 1888 | Minimum Fuel Cost to Report to the Capital Tree, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 6 | 0.7% |
| 1889 | Hash Divided String String, Simulation | Medium | 6 | 0.8% |
| 1890 | Generate Fibonacci Sequence | Easy | 6 | 0.8% |
| 1891 | Count the Number of Complete Components Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 6 | 0.8% |
| 1892 | A Number After a Double Reversal Math | Easy | 6 | 0.8% |
| 1893 | Top Travellers Database | Easy | 6 | 0.6% |
| 1894 | Find the Divisibility Array of a String Array, Math, String | Medium | 6 | 0.4% |
| 1895 | Shifting Letters Array, String, Prefix Sum | Medium | 6 | 0.5% |
| 1896 | Minimum Number of Operations to Make Elements in Array Distinct Array, Hash Table | Easy | 6 | 0.7% |
| 1897 | Inorder Successor in BST Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 6 | 0.5% |
| 1898 | Divide a String Into Groups of Size k String, Simulation | Easy | 6 | 0.8% |
| 1899 | Longest Special Path II Array, Hash Table, Tree, Depth-First Search, Prefix Sum | Hard | 6 | 0.2% |
| 1900 | Buildings With an Ocean View Array, Stack, Monotonic Stack | Medium | 6 | 0.8% |
| 1901 | Missing Element in Sorted Array Array, Binary Search | Medium | 6 | 0.6% |
| 1902 | Maximum Number of Tasks You Can Assign Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue | Hard | 6 | 0.5% |
| 1903 | Stone Game VII Array, Math, Dynamic Programming, Game Theory | Medium | 6 | 0.6% |
| 1904 | Total Characters in String After Transformations I Hash Table, Math, String, Dynamic Programming, Counting | Medium | 6 | 0.5% |
| 1905 | Number of Subarrays with Bounded Maximum Array, Two Pointers | Medium | 6 | 0.6% |
| 1906 | Generate a String With Characters That Have Odd Counts String | Easy | 6 | 0.8% |
| 1907 | Delete Greatest Value in Each Row Array, Sorting, Heap (Priority Queue), Matrix, Simulation | Easy | 6 | 0.8% |
| 1908 | Design Underground System Hash Table, String, Design | Medium | 6 | 0.7% |
| 1909 | Find Closest Node to Given Two Nodes Depth-First Search, Graph Theory | Medium | 6 | 0.5% |
| 1910 | Maximum Candies You Can Get from Boxes Array, Breadth-First Search, Graph Theory | Hard | 6 | 0.7% |
| 1911 | 3Sum With Multiplicity Array, Hash Table, Two Pointers, Sorting, Counting | Medium | 6 | 0.5% |
| 1912 | Maximum Difference Between Even and Odd Frequency I Hash Table, String, Counting | Easy | 6 | 0.6% |
| 1913 | Make the XOR of All Segments Equal to Zero Array, Hash Table, Dynamic Programming, Bit Manipulation, Counting | Hard | 6 | 0.4% |
| 1914 | Maximum Difference by Remapping a Digit Math, Greedy | Easy | 6 | 0.8% |
| 1915 | Count Special Quadruplets Array, Hash Table, Enumeration | Easy | 6 | 0.6% |
| 1916 | Unique 3-Digit Even Numbers Array, Hash Table, Recursion, Enumeration | Easy | 6 | 0.7% |
| 1917 | Card Flipping Game Array, Hash Table | Medium | 6 | 0.5% |
| 1918 | Find Nearest Point That Has the Same X or Y Coordinate Array | Easy | 6 | 0.7% |
| 1919 | Shortest Word Distance II Array, Hash Table, Two Pointers, String, Design | Medium | 6 | 0.6% |
| 1920 | Partition Array Such That Maximum Difference Is K Array, Greedy, Sorting | Medium | 6 | 0.8% |
| 1921 | Longest Subsequence With Limited Sum Array, Binary Search, Greedy, Sorting, Prefix Sum | Easy | 6 | 0.7% |
| 1922 | Closest Subsequence Sum Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmask | Hard | 6 | 0.4% |
| 1923 | Sum of Absolute Differences in a Sorted Array Array, Math, Prefix Sum | Medium | 6 | 0.7% |
| 1924 | Sum of All Odd Length Subarrays Array, Math, Prefix Sum | Easy | 6 | 0.8% |
| 1925 | Reducing Dishes Array, Dynamic Programming, Greedy, Sorting | Hard | 6 | 0.8% |
| 1926 | Unique Substrings in Wraparound String String, Dynamic Programming | Medium | 6 | 0.4% |
| 1927 | Count The Repetitions Two Pointers, String, Dynamic Programming | Hard | 6 | 0.3% |
| 1928 | Split the Array Array, Hash Table, Counting | Easy | 6 | 0.6% |
| 1929 | Maximum Matching of Players With Trainers Array, Two Pointers, Greedy, Sorting | Medium | 6 | 0.8% |
| 1930 | Task Scheduler II Array, Hash Table, Simulation | Medium | 6 | 0.5% |
| 1931 | Zigzag Grid Traversal With Skip Array, Matrix, Simulation | Easy | 6 | 0.7% |
| 1932 | Vowels Game in a String Math, String, Brainteaser, Game Theory | Medium | 6 | 0.8% |
| 1933 | Letter Case Permutation String, Backtracking, Bit Manipulation | Medium | 6 | 0.8% |
| 1934 | Partition Array for Maximum XOR and AND Array, Math, Greedy, Bit Manipulation, Enumeration | Hard | 6 | 0.2% |
| 1935 | Find the Maximum Number of Fruits Collected Array, Dynamic Programming, Matrix | Hard | 6 | 0.6% |
| 1936 | Collect Coins in a Tree Array, Tree, Graph Theory, Topological Sort | Hard | 6 | 0.4% |
| 1937 | Allocate Mailboxes Array, Math, Dynamic Programming, Sorting | Hard | 6 | 0.6% |
| 1938 | Maximum Frequency Stack Hash Table, Stack, Design, Ordered Set | Hard | 6 | 0.7% |
| 1939 | Find the Minimum Area to Cover All Ones II Array, Matrix, Enumeration | Hard | 6 | 0.6% |
| 1940 | Maximum Area of Longest Diagonal Rectangle Array | Easy | 6 | 0.5% |
| 1941 | Smallest Missing Integer Greater Than Sequential Prefix Sum Array, Hash Table, Sorting | Easy | 6 | 0.4% |
| 1942 | Find Closest Person Math | Easy | 6 | 0.9% |
| 1943 | Promise Time Limit | Medium | 6 | 0.8% |
| 1944 | Count Bowl Subarrays Array, Stack, Monotonic Stack | Medium | 6 | 0.5% |
| 1945 | Maximum Product of the Length of Two Palindromic Subsequences String, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 6 | 0.6% |
| 1946 | Find the Number of Winning Players Array, Hash Table, Counting | Easy | 6 | 0.6% |
| 1947 | Highest Grade For Each Student Database | Medium | 6 | 0.7% |
| 1948 | Implement Router Array, Hash Table, Binary Search, Design, Queue, Ordered Set | Medium | 6 | 0.4% |
| 1949 | Path Existence Queries in a Graph II Array, Two Pointers, Binary Search, Dynamic Programming, Greedy, Bit Manipulation, Graph Theory, Sorting | Hard | 6 | 0.3% |
| 1950 | XOR Operation in an Array Math, Bit Manipulation | Easy | 6 | 0.9% |
| 1951 | Water Bottles II Math, Simulation | Medium | 6 | 0.8% |
| 1952 | Find Beautiful Indices in the Given Array I Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function | Medium | 6 | 0.4% |
| 1953 | Calculate Delayed Arrival Time Math | Easy | 6 | 0.8% |
| 1954 | Minimum Difficulty of a Job Schedule Array, Dynamic Programming | Hard | 6 | 0.6% |
| 1955 | Find Minimum Time to Finish All Jobs Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 6 | 0.5% |
| 1956 | Maximum Count of Positive Integer and Negative Integer Array, Binary Search, Counting | Easy | 6 | 0.7% |
| 1957 | Candy Crush Array, Two Pointers, Matrix, Simulation | Medium | 6 | 0.8% |
| 1958 | Number of Even and Odd Bits Bit Manipulation | Easy | 6 | 0.7% |
| 1959 | Minimum One Bit Operations to Make Integers Zero Math, Dynamic Programming, Bit Manipulation, Recursion, Memoization | Hard | 6 | 0.8% |
| 1960 | Find Students Who Improved Database | Medium | 6 | 0.5% |
| 1961 | Count Distinct Integers After Removing Zeros Math, Dynamic Programming | Medium | 6 | 0.2% |
| 1962 | Best Team With No Conflicts Array, Dynamic Programming, Sorting | Medium | 6 | 0.5% |
| 1963 | Count Collisions on a Road String, Stack, Simulation | Medium | 6 | 0.6% |
| 1964 | Coupon Code Validator Array, Hash Table, String, Sorting | Easy | 6 | 0.6% |
| 1965 | Maximum Profit from Trading Stocks with Discounts Array, Dynamic Programming, Tree, Depth-First Search | Hard | 6 | 0.6% |
| 1966 | Design A Leaderboard Hash Table, Design, Sorting | Medium | 6 | 0.7% |
| 1967 | Two-Letter Card Game Array, Hash Table, String, Counting, Enumeration | Medium | 6 | 0.1% |
| 1968 | Difference Between Element Sum and Digit Sum of an Array Array, Math | Easy | 6 | 0.9% |
| 1969 | Broken Calculator Math, Greedy | Medium | 6 | 0.6% |
| 1970 | Sales Analysis III Database | Easy | 6 | 0.5% |
| 1971 | Longest Turbulent Subarray Array, Dynamic Programming, Sliding Window | Medium | 6 | 0.5% |
| 1972 | Maximize Area of Square Hole in Grid Array, Sorting | Medium | 6 | 0.6% |
| 1973 | Design Auction System Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 6 | 0.4% |
| 1974 | Construct the Minimum Bitwise Array I Array, Bit Manipulation | Easy | 6 | 0.9% |
| 1975 | Minimum Number of Pushes to Type Word I Math, String, Greedy | Easy | 6 | 0.7% |
| 1976 | Cache With Time Limit | Medium | 6 | 0.8% |
| 1977 | Divide an Array Into Subarrays With Minimum Cost II Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 6 | 0.5% |
| 1978 | Smallest Range I Array, Math | Easy | 6 | 0.7% |
| 1979 | Apply Operations to Maximize Frequency Score Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Hard | 6 | 0.4% |
| 1980 | Partitioning Into Minimum Number Of Deci-Binary Numbers String, Greedy | Medium | 6 | 0.9% |
| 1981 | Minimum Processing Time Array, Greedy, Sorting | Medium | 6 | 0.7% |
| 1982 | Reverse Nodes in Even Length Groups Linked List | Medium | 6 | 0.6% |
| 1983 | Flip Square Submatrix Vertically Array, Two Pointers, Matrix | Easy | 6 | 0.8% |
| 1984 | Construct Uniform Parity Array I Array, Math | Easy | 6 | 0.8% |
| 1985 | Check if Strings Can be Made Equal With Operations I String | Easy | 6 | 0.6% |
| 1986 | Check if Strings Can be Made Equal With Operations II Hash Table, String, Sorting | Medium | 6 | 0.7% |
| 1987 | Maximum Amount of Money Robot Can Earn Array, Dynamic Programming, Matrix | Medium | 6 | 0.5% |
| 1988 | Decode the Slanted Ciphertext String, Simulation | Medium | 6 | 0.7% |
| 1989 | Walking Robot Simulation Array, Hash Table, Simulation | Medium | 6 | 0.6% |
| 1990 | Minimum Operations to Transform Array into Alternating Prime Array, Math, Two Pointers, Binary Search, Sorting, Number Theory | Medium | 6 | 0.5% |
| 1991 | Closest Equal Element Queries Array, Hash Table, Binary Search | Medium | 6 | 0.5% |
| 1992 | Number of Ways to Reach a Position After Exactly k Steps Math, Dynamic Programming, Combinatorics | Medium | 6 | 0.4% |
| 1993 | Minimum Absolute Distance Between Mirror Pairs Array, Hash Table, Math | Medium | 6 | 0.6% |
| 1994 | Mirror Distance of an Integer Math | Easy | 6 | 0.9% |
| 1995 | Furthest Point From Origin String, Counting | Easy | 6 | 0.8% |
| 1996 | Apply Operations to Make All Array Elements Equal to Zero Array, Prefix Sum | Medium | 6 | 0.3% |
| 1997 | Cyclically Rotating a Grid Array, Matrix, Simulation | Medium | 6 | 0.7% |
| 1998 | Sum of Variable Length Subarrays Array, Prefix Sum | Easy | 6 | 0.9% |
| 1999 | Minimum Element After Replacement With Digit Sum Array, Math | Easy | 6 | 0.9% |
| 2000 | Maximum Total Subarray Value I Array, Greedy | Medium | 6 | 0.7% |
| 2001 | Count Salary Categories Database | Medium | 6 | 0.6% |
| 2002 | Paint House Array, Dynamic Programming | Medium | 5 | 0.6% |
| 2003 | Tree Node Database | Medium | 5 | 0.8% |
| 2004 | Find Duplicate File in System Array, Hash Table, String | Medium | 5 | 0.7% |
| 2005 | Stickers to Spell Word Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Hard | 5 | 0.5% |
| 2006 | Binary Trees With Factors Array, Hash Table, Dynamic Programming, Sorting | Medium | 5 | 0.5% |
| 2007 | Maximize Sum Of Array After K Negations Array, Greedy, Sorting | Easy | 5 | 0.5% |
| 2008 | Longest Repeating Substring String, Binary Search, Dynamic Programming, Rolling Hash, Suffix Array, Hash Function | Medium | 5 | 0.6% |
| 2009 | Sequential Digits Enumeration | Medium | 5 | 0.7% |
| 2010 | Count All Valid Pickup and Delivery Options Math, Dynamic Programming, Combinatorics | Hard | 5 | 0.6% |
| 2011 | Find All Good Strings String, Dynamic Programming, String Matching | Hard | 5 | 0.5% |
| 2012 | Minimum Deletions to Make Character Frequencies Unique Hash Table, String, Greedy, Sorting | Medium | 5 | 0.6% |
| 2013 | Count Nice Pairs in an Array Array, Hash Table, Math, Counting | Medium | 5 | 0.5% |
| 2014 | Minimum Sideway Jumps Array, Dynamic Programming, Greedy | Medium | 5 | 0.5% |
| 2015 | Check if There is a Valid Partition For The Array Array, Dynamic Programming | Medium | 5 | 0.5% |
| 2016 | Most Profitable Path in a Tree Array, Tree, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 5 | 0.7% |
| 2017 | Minimum Time to Complete All Tasks Array, Binary Search, Stack, Greedy, Sorting | Hard | 5 | 0.4% |
| 2018 | The Number of Beautiful Subsets Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics | Medium | 5 | 0.5% |
| 2019 | Convert an Array Into a 2D Array With Conditions Array, Hash Table | Medium | 5 | 0.9% |
| 2020 | Array Reduce Transformation | Easy | 5 | 0.9% |
| 2021 | Length of Longest Subarray With at Most K Frequency Array, Hash Table, Sliding Window | Medium | 5 | 0.6% |
| 2022 | Right Triangles Array, Hash Table, Math, Combinatorics, Counting | Medium | 5 | 0.5% |
| 2023 | Count Integers in Intervals Design, Segment Tree, Ordered Set | Hard | 5 | 0.4% |
| 2024 | Number of Arithmetic Triplets Array, Hash Table, Two Pointers, Enumeration | Easy | 5 | 0.9% |
| 2025 | Optimal Partition of String Hash Table, String, Greedy | Medium | 5 | 0.8% |
| 2026 | Poor Pigs Math, Dynamic Programming, Combinatorics | Hard | 5 | 0.6% |
| 2027 | Largest Positive Integer That Exists With Its Negative Array, Hash Table, Two Pointers, Sorting | Easy | 5 | 0.7% |
| 2028 | Add One Row to Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 5 | 0.6% |
| 2029 | Replace Words Array, Hash Table, String, Trie | Medium | 5 | 0.7% |
| 2030 | Differences Between Two Objects | Medium | 5 | 0.7% |
| 2031 | Double a Number Represented as a Linked List Linked List, Math, Stack | Medium | 5 | 0.6% |
| 2032 | Find Maximum Non-decreasing Array Length Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue | Hard | 5 | 0.2% |
| 2033 | Remove Zero Sum Consecutive Nodes from Linked List Hash Table, Linked List | Medium | 5 | 0.5% |
| 2034 | Validate Binary Tree Nodes Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Tree | Medium | 5 | 0.4% |
| 2035 | Reverse Substrings Between Each Pair of Parentheses String, Stack | Medium | 5 | 0.7% |
| 2036 | Count the Number of Inversions Array, Dynamic Programming | Hard | 5 | 0.3% |
| 2037 | Count Triplets That Can Form Two Arrays of Equal XOR Array, Hash Table, Math, Bit Manipulation, Prefix Sum | Medium | 5 | 0.8% |
| 2038 | Least Number of Unique Integers after K Removals Array, Hash Table, Greedy, Sorting, Counting | Medium | 5 | 0.6% |
| 2039 | Remove Max Number of Edges to Keep Graph Fully Traversable Union-Find, Graph Theory | Hard | 5 | 0.7% |
| 2040 | Bank Account Summary II Database | Easy | 5 | 0.8% |
| 2041 | Average Waiting Time Array, Simulation | Medium | 5 | 0.7% |
| 2042 | Alternating Groups I Array, Sliding Window | Easy | 5 | 0.7% |
| 2043 | Kth Distinct String in an Array Array, Hash Table, String, Counting | Easy | 5 | 0.8% |
| 2044 | Prefix and Suffix Search Array, Hash Table, String, Design, Trie | Hard | 5 | 0.4% |
| 2045 | Minimum Number of Days to Disconnect Island Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component | Hard | 5 | 0.6% |
| 2046 | Minimum Operations to Make Array Equal to Target Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | Hard | 5 | 0.4% |
| 2047 | Find the Largest Palindrome Divisible by K Math, String, Dynamic Programming, Greedy, Number Theory | Hard | 5 | 0.2% |
| 2048 | Maximum XOR Score Subarray Queries Array, Dynamic Programming | Hard | 5 | 0.4% |
| 2049 | Find Missing Observations Array, Math, Simulation | Medium | 5 | 0.6% |
| 2050 | Insert Greatest Common Divisors in Linked List Linked List, Math, Number Theory | Medium | 5 | 0.9% |
| 2051 | K-th Nearest Obstacle Queries Array, Heap (Priority Queue) | Medium | 5 | 0.5% |
| 2052 | Distinct Prime Factors of Product of Array Array, Hash Table, Math, Number Theory | Medium | 5 | 0.5% |
| 2053 | Sorted GCD Pair Queries Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum | Hard | 5 | 0.2% |
| 2054 | Snake in Matrix Array, String, Simulation | Easy | 5 | 0.8% |
| 2055 | Projection Area of 3D Shapes Array, Math, Geometry, Matrix | Easy | 5 | 0.8% |
| 2056 | Maximal Score After Applying K Operations Array, Greedy, Heap (Priority Queue) | Medium | 5 | 0.6% |
| 2057 | Maximum Number of Moves to Kill All Pawns Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmask | Hard | 5 | 0.3% |
| 2058 | String Compression II String, Dynamic Programming | Hard | 5 | 0.5% |
| 2059 | Minimum Division Operations to Make Array Non Decreasing Array, Math, Greedy, Number Theory | Medium | 5 | 0.3% |
| 2060 | Longest Square Streak in an Array Array, Hash Table, Binary Search, Dynamic Programming, Sorting | Medium | 5 | 0.5% |
| 2061 | Count Substrings With K-Frequency Characters I Hash Table, String, Sliding Window | Medium | 5 | 0.6% |
| 2062 | Find if Array Can Be Sorted Array, Bit Manipulation, Sorting | Medium | 5 | 0.7% |
| 2063 | Minimum Array Changes to Make Differences Equal Array, Hash Table, Prefix Sum | Medium | 5 | 0.2% |
| 2064 | Maximum Size Subarray Sum Equals k Array, Hash Table, Prefix Sum | Medium | 5 | 0.5% |
| 2065 | Minimum Operations to Reduce an Integer to 0 Dynamic Programming, Greedy, Bit Manipulation | Medium | 5 | 0.6% |
| 2066 | Kth Largest Sum in a Binary Tree Tree, Breadth-First Search, Sorting, Binary Tree | Medium | 5 | 0.6% |
| 2067 | Sparse Matrix Multiplication Array, Hash Table, Matrix | Medium | 5 | 0.7% |
| 2068 | Change Data Type | Easy | 5 | 0.9% |
| 2069 | Maximum Star Sum of a Graph Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue) | Medium | 5 | 0.4% |
| 2070 | Determine if String Halves Are Alike String, Counting | Easy | 5 | 0.8% |
| 2071 | Find Maximum Removals From Source String Array, Hash Table, Two Pointers, String, Dynamic Programming | Medium | 5 | 0.4% |
| 2072 | Maximize Amount After Two Days of Conversions Array, String, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 5 | 0.6% |
| 2073 | Cells with Odd Values in a Matrix Array, Math, Simulation | Easy | 5 | 0.8% |
| 2074 | Count Prefix and Suffix Pairs I Array, String, Trie, Rolling Hash, String Matching, Hash Function | Easy | 5 | 0.8% |
| 2075 | Neighboring Bitwise XOR Array, Bit Manipulation | Medium | 5 | 0.8% |
| 2076 | Make Lexicographically Smallest Array by Swapping Elements Array, Union-Find, Sorting | Medium | 5 | 0.6% |
| 2077 | Longest Subsequence With Decreasing Adjacent Difference Array, Dynamic Programming | Medium | 5 | 0.2% |
| 2078 | Minimum Operations to Make Character Frequencies Equal Hash Table, String, Dynamic Programming, Counting, Enumeration | Hard | 5 | 0.3% |
| 2079 | Count Substrings That Satisfy K-Constraint I String, Sliding Window | Easy | 5 | 0.8% |
| 2080 | Convert Date to Binary Math, String | Easy | 5 | 0.9% |
| 2081 | Goal Parser Interpretation String | Easy | 5 | 0.9% |
| 2082 | Split a String in Balanced Strings String, Greedy, Counting | Easy | 5 | 0.9% |
| 2083 | Check Knight Tour Configuration Array, Depth-First Search, Breadth-First Search, Matrix, Simulation | Medium | 5 | 0.6% |
| 2084 | Check if All Characters Have Equal Number of Occurrences Hash Table, String, Counting | Easy | 5 | 0.8% |
| 2085 | Find the XOR of Numbers Which Appear Twice Array, Hash Table, Bit Manipulation | Easy | 5 | 0.8% |
| 2086 | Closest Prime Numbers in Range Math, Number Theory | Medium | 5 | 0.5% |
| 2087 | Minimum Amount of Time to Fill Cups Array, Greedy, Sorting, Heap (Priority Queue) | Easy | 5 | 0.6% |
| 2088 | Find the Number of Copy Arrays Array, Math | Medium | 5 | 0.5% |
| 2089 | Maximum Alternating Subsequence Sum Array, Dynamic Programming | Medium | 5 | 0.6% |
| 2090 | Minimum Insertions to Balance a Parentheses String String, Stack, Greedy | Medium | 5 | 0.5% |
| 2091 | Count Vowel Strings in Ranges Array, String, Prefix Sum | Medium | 5 | 0.7% |
| 2092 | Smallest Substring With Identical Characters I Array, Binary Search, Enumeration | Hard | 5 | 0.2% |
| 2093 | Split With Minimum Sum Math, Greedy, Sorting | Easy | 5 | 0.7% |
| 2094 | Count Pairs That Form a Complete Day II Array, Hash Table, Counting | Medium | 5 | 0.4% |
| 2095 | Movement of Robots Array, Brainteaser, Sorting, Prefix Sum | Medium | 5 | 0.3% |
| 2096 | Contain Virus Array, Depth-First Search, Breadth-First Search, Matrix, Simulation | Hard | 5 | 0.6% |
| 2097 | Numbers With Same Consecutive Differences Backtracking, Breadth-First Search | Medium | 5 | 0.6% |
| 2098 | Zero Array Transformation IV Array, Dynamic Programming | Medium | 5 | 0.3% |
| 2099 | Is Object Empty | Easy | 5 | 0.8% |
| 2100 | Encrypt and Decrypt Strings Array, Hash Table, String, Design, Trie | Hard | 5 | 0.4% |
| 2101 | Final Array State After K Multiplication Operations I Array, Math, Heap (Priority Queue), Simulation | Easy | 5 | 0.9% |
| 2102 | Closest Node to Path in Tree Array, Tree, Depth-First Search, Breadth-First Search | Hard | 5 | 0.6% |
| 2103 | Minimize Malware Spread Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 5 | 0.4% |
| 2104 | Minimum Cost to Make Arrays Identical Array, Greedy, Sorting | Medium | 5 | 0.4% |
| 2105 | Count Subarrays of Length Three With a Condition Array | Easy | 5 | 0.6% |
| 2106 | Prime In Diagonal Array, Math, Matrix, Number Theory | Easy | 5 | 0.4% |
| 2107 | Length of the Longest Valid Substring Array, Hash Table, String, Sliding Window | Hard | 5 | 0.4% |
| 2108 | Merge Operations for Minimum Travel Time Array, Dynamic Programming, Prefix Sum | Hard | 5 | 0.3% |
| 2109 | Find Minimum Time to Reach Last Room II Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Medium | 5 | 0.7% |
| 2110 | Minimum Moves to Spread Stones Over Grid Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmask | Medium | 5 | 0.5% |
| 2111 | Web Crawler Multithreaded Depth-First Search, Breadth-First Search, Concurrency | Medium | 5 | 0.5% |
| 2112 | Inorder Successor in BST II Tree, Binary Search Tree, Binary Tree | Medium | 5 | 0.6% |
| 2113 | Find All Groups of Farmland Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 5 | 0.8% |
| 2114 | Robot Bounded In Circle Math, String, Simulation | Medium | 5 | 0.6% |
| 2115 | Equal Rational Numbers Math, String | Hard | 5 | 0.5% |
| 2116 | Stone Game V Array, Math, Dynamic Programming, Game Theory | Hard | 5 | 0.4% |
| 2117 | Shift Distance Between Two Strings Array, String, Prefix Sum | Medium | 5 | 0.5% |
| 2118 | Maximum Length of a Concatenated String with Unique Characters Array, String, Backtracking, Bit Manipulation | Medium | 5 | 0.5% |
| 2119 | Sum of Good Numbers Array | Easy | 5 | 0.7% |
| 2120 | Longest Word in Dictionary Array, Hash Table, String, Trie, Sorting | Medium | 5 | 0.5% |
| 2121 | The Maze III Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Hard | 5 | 0.5% |
| 2122 | Create Sorted Array through Instructions Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 5 | 0.4% |
| 2123 | Count the Number of Arrays with K Matching Adjacent Elements Math, Combinatorics | Hard | 5 | 0.6% |
| 2124 | Minimum Deletions to Make String K-Special Hash Table, String, Greedy, Sorting, Counting | Medium | 5 | 0.7% |
| 2125 | Find Maximum Area of a Triangle Array, Hash Table, Math, Greedy, Geometry, Enumeration | Medium | 5 | 0.3% |
| 2126 | Earliest Second to Mark Indices II Array, Binary Search, Greedy, Heap (Priority Queue) | Hard | 5 | 0.2% |
| 2127 | Maximum Product After K Increments Array, Greedy, Heap (Priority Queue) | Medium | 5 | 0.4% |
| 2128 | Non-decreasing Subsequences Array, Hash Table, Backtracking, Bit Manipulation | Medium | 5 | 0.6% |
| 2129 | Distribute Candies Array, Hash Table | Easy | 5 | 0.7% |
| 2130 | Longest Palindrome After Substring Concatenation I Two Pointers, String, Dynamic Programming, Enumeration | Medium | 5 | 0.4% |
| 2131 | Find the Kth Largest Integer in the Array Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 5 | 0.5% |
| 2132 | Find the K-Sum of an Array Array, Sorting, Heap (Priority Queue) | Hard | 5 | 0.4% |
| 2133 | Minimize Maximum Component Cost Binary Search, Union-Find, Graph Theory, Sorting | Medium | 5 | 0.4% |
| 2134 | Restore The Array String, Dynamic Programming | Hard | 5 | 0.5% |
| 2135 | Chunk Array | Easy | 5 | 0.8% |
| 2136 | Count Different Palindromic Subsequences String, Dynamic Programming | Hard | 5 | 0.5% |
| 2137 | Minimum Score After Removals on a Tree Array, Bit Manipulation, Tree, Depth-First Search | Hard | 5 | 0.8% |
| 2138 | Partition Array Into Three Parts With Equal Sum Array, Greedy | Easy | 5 | 0.4% |
| 2139 | Count Islands With Total Value Divisible by K Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 5 | 0.6% |
| 2140 | Count Prime-Gap Balanced Subarrays Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue | Medium | 5 | 0.2% |
| 2141 | Increasing Decreasing String Hash Table, String, Counting | Easy | 5 | 0.8% |
| 2142 | Maximum Total from Optimal Activation Order Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue) | Medium | 5 | 0.3% |
| 2143 | Minimum Array Sum Array, Dynamic Programming | Medium | 5 | 0.3% |
| 2144 | Check If Digits Are Equal in String After Operations II Math, String, Combinatorics, Number Theory | Hard | 5 | 0.1% |
| 2145 | Solve the Equation Math, String, Simulation | Medium | 5 | 0.5% |
| 2146 | Maximum Path Quality of a Graph Array, Backtracking, Graph Theory | Hard | 5 | 0.6% |
| 2147 | Map Sum Pairs Hash Table, String, Design, Trie | Medium | 5 | 0.6% |
| 2148 | Minimum Index Sum of Two Lists Array, Hash Table, String | Easy | 5 | 0.6% |
| 2149 | Sum of Digits in Base K Math | Easy | 5 | 0.8% |
| 2150 | Find Substring With Given Hash Value String, Sliding Window, Rolling Hash, Hash Function | Hard | 5 | 0.3% |
| 2151 | Partition Array Into K-Distinct Groups Array, Hash Table, Counting | Medium | 5 | 0.5% |
| 2152 | Find Mirror Score of a String Hash Table, String, Stack, Simulation | Medium | 5 | 0.4% |
| 2153 | Reorder Data in Log Files Array, String, Sorting | Medium | 5 | 0.6% |
| 2154 | Minimum Average of Smallest and Largest Elements Array, Two Pointers, Sorting | Easy | 5 | 0.9% |
| 2155 | Count The Number of Winning Sequences String, Dynamic Programming | Hard | 5 | 0.3% |
| 2156 | Shortest Path in a Hidden Grid Array, Depth-First Search, Breadth-First Search, Matrix, Interactive | Medium | 5 | 0.4% |
| 2157 | Sum of Beautiful Subsequences Array, Math, Binary Indexed Tree, Number Theory | Hard | 5 | 0.3% |
| 2158 | Print Zero Even Odd Concurrency | Medium | 5 | 0.7% |
| 2159 | Fill Missing Data | Easy | 5 | 0.7% |
| 2160 | Balanced K-Factor Decomposition Math, Backtracking, Number Theory | Medium | 5 | 0.4% |
| 2161 | Minimize String Length Hash Table, String | Easy | 5 | 0.8% |
| 2162 | Find The Original Array of Prefix Xor Array, Bit Manipulation | Medium | 5 | 0.9% |
| 2163 | Count Elements With Strictly Smaller and Greater Elements Array, Sorting, Counting | Easy | 5 | 0.6% |
| 2164 | Maximum Area Rectangle With Point Constraints II Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting | Hard | 5 | 0.2% |
| 2165 | Group the People Given the Group Size They Belong To Array, Hash Table, Greedy | Medium | 5 | 0.9% |
| 2166 | Longest Palindrome After Substring Concatenation II Two Pointers, String, Dynamic Programming | Hard | 5 | 0.2% |
| 2167 | Maximum Xor Product Math, Greedy, Bit Manipulation | Medium | 5 | 0.3% |
| 2168 | Binary Tree Upside Down Tree, Depth-First Search, Binary Tree | Medium | 5 | 0.7% |
| 2169 | Split Array With Same Average Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 5 | 0.3% |
| 2170 | Sum of Perfect Square Ancestors Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theory | Hard | 5 | 0.4% |
| 2171 | Lexicographically Smallest Permutation Greater Than Target Hash Table, String, Greedy, Counting, Enumeration | Medium | 5 | 0.3% |
| 2172 | Number of Valid Move Combinations On Chessboard Array, String, Backtracking, Simulation | Hard | 5 | 0.5% |
| 2173 | Find Minimum Cost to Remove Array Elements Array, Dynamic Programming | Medium | 5 | 0.2% |
| 2174 | Minimum Time to Complete All Deliveries Math, Binary Search | Medium | 5 | 0.4% |
| 2175 | Find the Longest Valid Obstacle Course at Each Position Array, Binary Search, Binary Indexed Tree | Hard | 5 | 0.6% |
| 2176 | Maximum Containers on a Ship Math | Easy | 5 | 0.8% |
| 2177 | Non-negative Integers without Consecutive Ones Dynamic Programming | Hard | 5 | 0.4% |
| 2178 | Partition Array into Disjoint Intervals Array | Medium | 5 | 0.5% |
| 2179 | Sort Even and Odd Indices Independently Array, Sorting | Easy | 5 | 0.6% |
| 2180 | Make Array Empty Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set | Hard | 5 | 0.3% |
| 2181 | Escape a Large Maze Array, Hash Table, Depth-First Search, Breadth-First Search | Hard | 5 | 0.4% |
| 2182 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts Array, Greedy, Sorting | Medium | 5 | 0.4% |
| 2183 | Find the Largest Almost Missing Integer Array, Hash Table | Easy | 5 | 0.4% |
| 2184 | Count Number of Ways to Place Houses Dynamic Programming | Medium | 5 | 0.4% |
| 2185 | Smallest Index With Digit Sum Equal to Index Array, Math | Easy | 5 | 0.8% |
| 2186 | Binary Prefix Divisible By 5 Array, Bit Manipulation | Easy | 5 | 0.5% |
| 2187 | Strong Friendship Database | Medium | 5 | 0.5% |
| 2188 | Find Servers That Handled Most Number of Requests Array, Heap (Priority Queue), Simulation, Ordered Set | Hard | 5 | 0.5% |
| 2189 | Zuma Game String, Dynamic Programming, Stack, Breadth-First Search, Memoization | Hard | 5 | 0.3% |
| 2190 | Sum of Squares of Special Elements Array, Enumeration | Easy | 5 | 0.8% |
| 2191 | Maximum Value of a String in an Array Array, String | Easy | 5 | 0.7% |
| 2192 | Append K Integers With Minimal Sum Array, Math, Greedy, Sorting | Medium | 5 | 0.3% |
| 2193 | Maximize Happiness of Selected Children Array, Greedy, Sorting | Medium | 5 | 0.6% |
| 2194 | Maximize Active Section with Trade I String, Enumeration | Medium | 5 | 0.3% |
| 2195 | Flatten Deeply Nested Array | Medium | 5 | 0.7% |
| 2196 | IP to CIDR String, Bit Manipulation | Medium | 5 | 0.5% |
| 2197 | Find Valid Pair of Adjacent Digits in String Hash Table, String, Counting | Easy | 5 | 0.6% |
| 2198 | Memoize II | Hard | 5 | 0.4% |
| 2199 | Minimum Deletions for At Most K Distinct Characters Hash Table, String, Greedy, Sorting, Counting | Easy | 5 | 0.7% |
| 2200 | Sort the Matrix Diagonally Array, Sorting, Matrix | Medium | 5 | 0.8% |
| 2201 | Count Paths That Can Form a Palindrome in a Tree Hash Table, Bit Manipulation, Tree, Depth-First Search | Hard | 5 | 0.5% |
| 2202 | Count Residue Prefixes Hash Table, String | Easy | 5 | 0.7% |
| 2203 | Merge BSTs to Create Single BST Array, Hash Table, Tree, Depth-First Search, Binary Search Tree, Binary Tree | Hard | 5 | 0.4% |
| 2204 | Dinner Plate Stacks Hash Table, Stack, Design, Heap (Priority Queue) | Hard | 5 | 0.3% |
| 2205 | Smallest Divisible Digit Product II Math, String, Backtracking, Greedy, Number Theory | Hard | 5 | 0.1% |
| 2206 | As Far from Land as Possible Array, Dynamic Programming, Breadth-First Search, Matrix | Medium | 5 | 0.5% |
| 2207 | K-Concatenation Maximum Sum Array, Dynamic Programming | Medium | 5 | 0.3% |
| 2208 | Number of Orders in the Backlog Array, Heap (Priority Queue), Simulation | Medium | 5 | 0.5% |
| 2209 | Minimum Pair Removal to Sort Array II Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set | Hard | 5 | 0.4% |
| 2210 | Largest Element in an Array after Merge Operations Array, Greedy | Medium | 5 | 0.5% |
| 2211 | Count Sorted Vowel Strings Math, Dynamic Programming, Combinatorics | Medium | 5 | 0.8% |
| 2212 | Minimum Cost to Convert String II Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Path | Hard | 5 | 0.6% |
| 2213 | Partition Array to Minimize XOR Array, Dynamic Programming, Bit Manipulation, Prefix Sum | Medium | 5 | 0.4% |
| 2214 | Reverse Degree of a String String, Simulation | Easy | 5 | 0.9% |
| 2215 | Minimum K to Reduce Array Within Limit Array, Binary Search | Medium | 5 | 0.4% |
| 2216 | Transformed Array Array, Simulation | Easy | 5 | 0.7% |
| 2217 | Longest Balanced Subarray I Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum | Medium | 5 | 0.7% |
| 2218 | Longest Balanced Substring I Hash Table, String, Counting, Enumeration | Medium | 5 | 0.7% |
| 2219 | Find the K-Beauty of a Number Math, String, Sliding Window | Easy | 5 | 0.6% |
| 2220 | Minimum Amount of Time to Collect Garbage Array, String, Prefix Sum | Medium | 5 | 0.9% |
| 2221 | Second Largest Digit in a String Hash Table, String | Easy | 5 | 0.5% |
| 2222 | DNA Pattern Recognition Database | Medium | 5 | 0.9% |
| 2223 | Human Traffic of Stadium Database | Hard | 5 | 0.5% |
| 2224 | Find COVID Recovery Patients Database | Medium | 5 | 0.4% |
| 2225 | Number of Subarrays With LCM Equal to K Array, Math, Number Theory | Medium | 5 | 0.5% |
| 2226 | Maximum Product of Three Elements After One Replacement Array, Math, Greedy, Sorting | Medium | 5 | 0.5% |
| 2227 | Number of Black Blocks Array, Hash Table, Enumeration | Medium | 5 | 0.4% |
| 2228 | K Radius Subarray Averages Array, Sliding Window | Medium | 5 | 0.5% |
| 2229 | Find the Number of Subsequences With Equal GCD Array, Math, Dynamic Programming, Number Theory | Hard | 5 | 0.3% |
| 2230 | Decrypt String from Alphabet to Integer Mapping String | Easy | 5 | 0.8% |
| 2231 | Maximum Number of Groups Entering a Competition Array, Math, Binary Search, Greedy | Medium | 5 | 0.7% |
| 2232 | Check if Binary String Has at Most One Segment of Ones String | Easy | 5 | 0.5% |
| 2233 | Count Sequences to K Array, Math, Dynamic Programming, Memoization, Number Theory | Hard | 5 | 0.4% |
| 2234 | GCD of Odd and Even Sums Math, Number Theory | Easy | 5 | 0.9% |
| 2235 | Distribute Money to Maximum Children Math, Greedy | Easy | 5 | 0.2% |
| 2236 | Minimum Number of Seconds to Make Mountain Height Zero Array, Math, Binary Search, Greedy, Heap (Priority Queue) | Medium | 5 | 0.6% |
| 2237 | Count Unhappy Friends Array, Simulation | Medium | 5 | 0.6% |
| 2238 | Minimum Flips to Make a OR b Equal to c Bit Manipulation | Medium | 5 | 0.7% |
| 2239 | Convert to Base -2 Math | Medium | 5 | 0.6% |
| 2240 | Construct Product Matrix Array, Matrix, Prefix Sum | Medium | 5 | 0.5% |
| 2241 | Matrix Similarity After Cyclic Shifts Array, Math, Matrix, Simulation | Easy | 5 | 0.7% |
| 2242 | Count Beautiful Numbers Dynamic Programming | Hard | 5 | 0.2% |
| 2243 | Rearrange Products Table Database | Easy | 5 | 0.9% |
| 2244 | Daily Leads and Partners Database | Easy | 5 | 0.9% |
| 2245 | Reachable Nodes With Restrictions Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 5 | 0.6% |
| 2246 | Maximum Partition Factor Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 5 | 0.3% |
| 2247 | Random Pick Index Hash Table, Math, Reservoir Sampling, Randomized | Medium | 5 | 0.7% |
| 2248 | Numbers At Most N Given Digit Set Array, Math, String, Binary Search, Dynamic Programming | Hard | 5 | 0.5% |
| 2249 | Timeout Cancellation | Easy | 5 | 0.9% |
| 2250 | Valid Arrangement of Pairs Array, Depth-First Search, Graph Theory, Eulerian Circuit | Hard | 5 | 0.7% |
| 2251 | Minimum Distance Between Three Equal Elements I Array, Hash Table | Easy | 5 | 0.7% |
| 2252 | Minimum XOR Path in a Grid Array, Dynamic Programming, Bit Manipulation, Matrix | Medium | 5 | 0.4% |
| 2253 | Minimum Distance Between Three Equal Elements II Array, Hash Table | Medium | 5 | 0.7% |
| 2254 | Final Array State After K Multiplication Operations II Array, Heap (Priority Queue), Simulation | Hard | 5 | 0.1% |
| 2255 | Minimum Distance to the Target Element Array | Easy | 5 | 0.6% |
| 2256 | Traffic Signal Color Math, String, Simulation | Easy | 5 | 0.8% |
| 2257 | Minimum Edge Reversals So Every Node Is Reachable Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory | Hard | 5 | 0.6% |
| 2258 | Count Substrings Divisible By Last Digit String, Dynamic Programming | Hard | 5 | 0.2% |
| 2259 | Find the Smallest Balanced Index Array, Prefix Sum | Medium | 5 | 0.2% |
| 2260 | Maximize Sum of Squares of Digits Math, Greedy | Medium | 5 | 0.6% |
| 2261 | Fizz Buzz Multithreaded Concurrency | Medium | 5 | 0.7% |
| 2262 | Longest Balanced Substring After One Swap Hash Table, String, Prefix Sum | Medium | 5 | 0.1% |
| 2263 | Count Stepping Numbers in Range String, Dynamic Programming | Hard | 5 | 0.3% |
| 2264 | Monotone Increasing Digits Math, Greedy | Medium | 5 | 0.5% |
| 2265 | Check if There is a Valid Path in a Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 5 | 0.6% |
| 2266 | Find the Sum of the Power of All Subsequences Array, Dynamic Programming | Hard | 5 | 0.4% |
| 2267 | One Edit Distance Two Pointers, String | Medium | 5 | 0.3% |
| 2268 | First Unique Number Array, Hash Table, Design, Queue, Data Stream | Medium | 5 | 0.6% |
| 2269 | Maximize Count of Distinct Primes After Split Array, Hash Table, Math, Segment Tree, Number Theory, Ordered Set | Hard | 5 | 0.2% |
| 2270 | Maximum Binary Tree Array, Divide and Conquer, Stack, Tree, Monotonic Stack, Binary Tree | Medium | 5 | 0.9% |
| 2271 | Sales Person Database | Easy | 5 | 0.7% |
| 2272 | Count K-th Roots in a Range Math, Binary Search | Medium | 5 | 0.2% |
| 2273 | Shortest Path with Alternating Colors Breadth-First Search, Graph Theory | Medium | 5 | 0.5% |
| 2274 | Circular Array Loop Array, Hash Table, Two Pointers | Medium | 5 | 0.4% |
| 2275 | Masking Personal Information String | Medium | 5 | 0.6% |
| 2276 | Minimum Swaps To Make Sequences Increasing Array, Dynamic Programming | Hard | 5 | 0.4% |
| 2277 | Digit Operations to Make Two Integers Equal Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path | Medium | 5 | 0.3% |
| 2278 | Maximum of Absolute Value Expression Array, Math | Medium | 5 | 0.5% |
| 2279 | Find Subarrays With Equal Sum Array, Hash Table | Easy | 5 | 0.7% |
| 2280 | Longest Palindromic Path in Graph String, Dynamic Programming, Bit Manipulation, Graph Theory, Bitmask | Hard | 5 | 0.2% |
| 2281 | Count Good Meals Array, Hash Table | Medium | 5 | 0.3% |
| 2282 | Find the Peaks Array, Enumeration | Easy | 5 | 0.8% |
| 2283 | Weighted Word Mapping Array, String, Simulation | Easy | 5 | 0.9% |
| 2284 | Get Maximum in Generated Array Array, Simulation | Easy | 5 | 0.5% |
| 2285 | Maximum Total Subarray Value II Array, Greedy, Segment Tree, Heap (Priority Queue) | Hard | 5 | 0.4% |
| 2286 | Shortest Cycle in a Graph Breadth-First Search, Graph Theory | Hard | 5 | 0.4% |
| 2287 | Plates Between Candles Array, String, Binary Search, Prefix Sum | Medium | 5 | 0.5% |
| 2288 | Maximize Sum of Device Ratings | Medium | 5 | 0.4% |
| 2289 | Number of Pairs of Interchangeable Rectangles Array, Hash Table, Math, Counting, Number Theory | Medium | 5 | 0.5% |
| 2290 | Process String with Special Operations I String, Simulation | Medium | 5 | 0.7% |
| 2291 | Minimize the Difference Between Target and Chosen Elements Array, Dynamic Programming, Matrix | Medium | 5 | 0.4% |
| 2292 | Queens That Can Attack the King Array, Matrix, Simulation | Medium | 5 | 0.7% |
| 2293 | Subarrays Distinct Element Sum of Squares I Array, Hash Table, Segment Tree | Easy | 5 | 0.8% |
| 2294 | Reachable Nodes In Subdivided Graph Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 5 | 0.5% |
| 2295 | Maximum Building Height Array, Math, Sorting | Hard | 5 | 0.7% |
| 2296 | Longest Substring Of All Vowels in Order String, Sliding Window | Medium | 5 | 0.5% |
| 2297 | Maximum Ice Cream Bars Array, Greedy, Sorting, Counting Sort | Medium | 5 | 0.8% |
| 2298 | Maximum Number of Balloons Hash Table, String, Counting | Easy | 5 | 0.6% |
| 2299 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold Array, Sliding Window | Medium | 5 | 0.7% |
| 2300 | Maximum Subarray Sum After at Most K Swaps | Hard | 5 | 0.1% |
| 2301 | Maximum Sum Obtained of Any Permutation Array, Greedy, Sorting, Prefix Sum | Medium | 5 | 0.4% |
| 2302 | Maximum Number of Occurrences of a Substring Hash Table, String, Sliding Window | Medium | 5 | 0.5% |
| 2303 | Buy Two Chocolates Array, Greedy, Sorting | Easy | 5 | 0.7% |
| 2304 | Dice Roll Simulation Array, Dynamic Programming | Hard | 5 | 0.5% |
| 2305 | Count Subarrays With Majority Element I Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum | Medium | 5 | 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.