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