LeetCode is one of the platforms I use to improve my programming and problem-solving skills. It provides a wide range of problems covering algorithms, data structures, databases, and other areas of computer science.
I am using this space to keep track of the problems I practice and the lessons I learn along the way. Rather than focusing only on solving a large number of problems, my goal is to understand the concepts, learn from mistakes, and gradually become better at approaching unfamiliar problems.
Problems 1–1000
| S.No | Problem | Acceptance | Level |
|---|---|---|---|
| 1 | Two Sum | 57.9% | Easy |
| 2 | Add Two Numbers | 49.0% | Med. |
| 3 | Longest Substring Without Repeating Characters | 39.6% | Med. |
| 4 | Median of Two Sorted Arrays | 47.2% | Hard |
| 5 | Longest Palindromic Substring | 38.3% | Med. |
| 6 | Zigzag Conversion | 54.7% | Med. |
| 7 | Reverse Integer | 32.2% | Med. |
| 8 | String to Integer (atoi) | 21.4% | Med. |
| 9 | Palindrome Number | 60.8% | Easy |
| 10 | Regular Expression Matching | 31.4% | Hard |
| 11 | Container With Most Water | 60.5% | Med. |
| 12 | Integer to Roman | 71.3% | Med. |
| 13 | Roman to Integer | 66.9% | Easy |
| 14 | Longest Common Prefix | 48.0% | Easy |
| 15 | 3Sum | 39.5% | Med. |
| 16 | 3Sum Closest | 49.0% | Med. |
| 17 | Letter Combinations of a Phone Number | 66.5% | Med. |
| 18 | 4Sum | 41.2% | Med. |
| 19 | Remove Nth Node From End of List | 52.2% | Med. |
| 20 | Valid Parentheses | 44.6% | Easy |
| 21 | Merge Two Sorted Lists | 68.6% | Easy |
| 22 | Generate Parentheses | 79.0% | Med. |
| 23 | Merge k Sorted Lists | 60.1% | Hard |
| 24 | Swap Nodes in Pairs | 70.0% | Med. |
| 25 | Reverse Nodes in k-Group | 66.7% | Hard |
| 26 | Remove Duplicates from Sorted Array | 63.4% | Easy |
| 27 | Remove Element | 62.2% | Easy |
| 28 | Find the Index of the First Occurrence in a String | 47.0% | Easy |
| 29 | Divide Two Integers | 20.1% | Med. |
| 30 | Substring with Concatenation of All Words | 34.8% | Hard |
| 31 | Next Permutation | 45.8% | Med. |
| 32 | Longest Valid Parentheses | 39.3% | Hard |
| 33 | Search in Rotated Sorted Array | 45.3% | Med. |
| 34 | Find First and Last Position of Element in Sorted Array | 49.4% | Med. |
| 35 | Search Insert Position | 51.8% | Easy |
| 36 | Valid Sudoku | 64.8% | Med. |
| 37 | Sudoku Solver | 65.6% | Hard |
| 38 | Count and Say | 63.4% | Med. |
| 39 | Combination Sum | 76.9% | Med. |
| 40 | Combination Sum II | 59.8% | Med. |
| 41 | First Missing Positive | 43.4% | Hard |
| 42 | Trapping Rain Water | 67.9% | Hard |
| 43 | Multiply Strings | 44.5% | Med. |
| 44 | Wildcard Matching | 32.4% | Hard |
| 45 | Jump Game II | 43.2% | Med. |
| 46 | Permutations | 82.2% | Med. |
| 47 | Permutations II | 63.8% | Med. |
| 48 | Rotate Image | 80.4% | Med. |
| 49 | Group Anagrams | 73.0% | Med. |
| 50 | Pow(x, n) | 39.0% | Med. |
| 51 | N-Queens | 76.1% | Hard |
| 52 | N-Queens II | 79.1% | Hard |
| 53 | Maximum Subarray | 53.6% | Med. |
| 54 | Spiral Matrix | 57.4% | Med. |
| 55 | Jump Game | 41.2% | Med. |
| 56 | Merge Intervals | 52.4% | Med. |
| 57 | Insert Interval | 45.6% | Med. |
| 58 | Length of Last Word | 59.3% | Easy |
| 59 | Spiral Matrix II | 75.5% | Med. |
| 60 | Permutation Sequence | 53.7% | Hard |
| 61 | Rotate List | 43.0% | Med. |
| 62 | Unique Paths | 67.1% | Med. |
| 63 | Unique Paths II | 44.8% | Med. |
| 64 | Minimum Path Sum | 68.6% | Med. |
| 65 | Valid Number | 23.3% | Hard |
| 66 | Plus One | 50.3% | Easy |
| 67 | Add Binary | 58.4% | Easy |
| 68 | Text Justification | 51.7% | Hard |
| 69 | Sqrt(x) | 42.2% | Easy |
| 70 | Climbing Stairs | 54.2% | Easy |
| 71 | Simplify Path | 51.0% | Med. |
| 72 | Edit Distance | 61.0% | Med. |
| 73 | Set Matrix Zeroes | 63.4% | Med. |
| 74 | Search a 2D Matrix | 54.4% | Med. |
| 75 | Sort Colors | 70.1% | Med. |
| 76 | Minimum Window Substring | 48.1% | Hard |
| 77 | Combinations | 74.9% | Med. |
| 78 | Subsets | 82.6% | Med. |
| 79 | Word Search | 47.8% | Med. |
| 80 | Remove Duplicates from Sorted Array II | 65.0% | Med. |
| 81 | Search in Rotated Sorted Array II | 40.3% | Med. |
| 82 | Remove Duplicates from Sorted List II | 52.2% | Med. |
| 83 | Remove Duplicates from Sorted List | 57.2% | Easy |
| 84 | Largest Rectangle in Histogram | 50.5% | Hard |
| 85 | Maximal Rectangle | 59.4% | Hard |
| 86 | Partition List | 61.6% | Med. |
| 87 | Scramble String | 45.1% | Hard |
| 88 | Merge Sorted Array | 55.3% | Easy |
| 89 | Gray Code | 65.5% | Med. |
| 90 | Subsets II | 61.7% | Med. |
| 91 | Decode Ways | 38.3% | Med. |
| 92 | Reverse Linked List II | 52.0% | Med. |
| 93 | Restore IP Addresses | 56.6% | Med. |
| 94 | Binary Tree Inorder Traversal | 80.4% | Easy |
| 95 | Unique Binary Search Trees II | 62.9% | Med. |
| 96 | Unique Binary Search Trees | 64.0% | Med. |
| 97 | Interleaving String | 44.4% | Med. |
| 98 | Validate Binary Search Tree | 36.1% | Med. |
| 99 | Recover Binary Search Tree | 60.4% | Med. |
| 100 | Same Tree | 67.6% | Easy |
| 101 | Symmetric Tree | 61.7% | Easy |
| 102 | Binary Tree Level Order Traversal | 73.1% | Med. |
| 103 | Binary Tree Zigzag Level Order Traversal | 64.2% | Med. |
| 104 | Maximum Depth of Binary Tree | 78.4% | Easy |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | 69.2% | Med. |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | 69.2% | Med. |
| 107 | Binary Tree Level Order Traversal II | 68.7% | Med. |
| 108 | Convert Sorted Array to Binary Search Tree | 75.9% | Easy |
| 109 | Convert Sorted List to Binary Search Tree | 67.0% | Med. |
| 110 | Balanced Binary Tree | 58.8% | Easy |
| 111 | Minimum Depth of Binary Tree | 53.4% | Easy |
| 112 | Path Sum | 55.4% | Easy |
| 113 | Path Sum II | 62.6% | Med. |
| 114 | Flatten Binary Tree to Linked List | 71.2% | Med. |
| 115 | Distinct Subsequences | 52.3% | Hard |
| 116 | Populating Next Right Pointers in Each Node | 67.5% | Med. |
| 117 | Populating Next Right Pointers in Each Node II | 57.9% | Med. |
| 118 | Pascal's Triangle | 79.2% | Easy |
| 119 | Pascal's Triangle II | 67.8% | Easy |
| 120 | Triangle | 59.9% | Med. |
| 121 | Best Time to Buy and Sell Stock | 57.1% | Easy |
| 122 | Best Time to Buy and Sell Stock II | 71.4% | Med. |
| 123 | Best Time to Buy and Sell Stock III | 54.3% | Hard |
| 124 | Binary Tree Maximum Path Sum | 42.6% | Hard |
| 125 | Valid Palindrome | 53.9% | Easy |
| 126 | Word Ladder II | 27.9% | Hard |
| 127 | Word Ladder | 46.1% | Hard |
| 128 | Longest Consecutive Sequence | 47.2% | Med. |
| 129 | Sum Root to Leaf Numbers | 70.2% | Med. |
| 130 | Surrounded Regions | 45.9% | Med. |
| 131 | Palindrome Partitioning | 74.4% | Med. |
| 132 | Palindrome Partitioning II | 37.5% | Hard |
| 133 | Clone Graph | 65.8% | Med. |
| 134 | Gas Station | 48.4% | Med. |
| 135 | Candy | 48.9% | Hard |
| 136 | Single Number | 78.0% | Easy |
| 137 | Single Number II | 67.5% | Med. |
| 138 | Copy List with Random Pointer | 63.4% | Med. |
| 139 | Word Break | 49.7% | Med. |
| 140 | Word Break II | 55.9% | Hard |
| 141 | Linked List Cycle | 54.8% | Easy |
| 142 | Linked List Cycle II | 58.7% | Med. |
| 143 | Reorder List | 65.8% | Med. |
| 144 | Binary Tree Preorder Traversal | 76.3% | Easy |
| 145 | Binary Tree Postorder Traversal | 78.7% | Easy |
| 146 | LRU Cache | 47.7% | Med. |
| 147 | Insertion Sort List | 59.7% | Med. |
| 148 | Sort List | 65.0% | Med. |
| 149 | Max Points on a Line | 31.1% | Hard |
| 150 | Evaluate Reverse Polish Notation | 58.3% | Med. |
| 151 | Reverse Words in a String | 57.2% | Med. |
| 152 | Maximum Product Subarray | 36.7% | Med. |
| 153 | Find Minimum in Rotated Sorted Array | 55.0% | Med. |
| 154 | Find Minimum in Rotated Sorted Array II | 46.8% | Hard |
| 155 | Min Stack | 58.5% | Med. |
| 156 | Binary Tree Upside Down | 65.5% | Med. |
| 157 | Read N Characters Given Read4 | 42.6% | Easy |
| 158 | Read N Characters Given read4 II - Call Multiple Times | 43.3% | Hard |
| 159 | Longest Substring with At Most Two Distinct Characters | 57.1% | Med. |
| 160 | Intersection of Two Linked Lists | 64.3% | Easy |
| 161 | One Edit Distance | 34.6% | Med. |
| 162 | Find Peak Element | 47.1% | Med. |
| 163 | Missing Ranges | 35.7% | Easy |
| 164 | Maximum Gap | 52.6% | Med. |
| 165 | Compare Version Numbers | 46.7% | Med. |
| 166 | Fraction to Recurring Decimal | 31.2% | Med. |
| 167 | Two Sum II - Input Array Is Sorted | 65.5% | Med. |
| 168 | Excel Sheet Column Title | 47.1% | Easy |
| 169 | Majority Element | 66.4% | Easy |
| 170 | Two Sum III - Data structure design | 39.2% | Easy |
| 171 | Excel Sheet Column Number | 68.1% | Easy |
| 172 | Factorial Trailing Zeroes | 47.1% | Med. |
| 173 | Binary Search Tree Iterator | 76.8% | Med. |
| 174 | Dungeon Game | 41.8% | Hard |
| 175 | Combine Two Tables | 79.8% | Easy |
| 176 | Second Highest Salary | 47.7% | Med. |
| 177 | Nth Highest Salary | 39.7% | Med. |
| 178 | Rank Scores | 68.3% | Med. |
| 179 | Largest Number | 43.4% | Med. |
| 180 | Consecutive Numbers | 48.9% | Med. |
| 181 | Employees Earning More Than Their Managers | 73.6% | Easy |
| 182 | Duplicate Emails | 74.1% | Easy |
| 183 | Customers Who Never Order | 72.1% | Easy |
| 184 | Department Highest Salary | 58.8% | Med. |
| 185 | Department Top Three Salaries | 61.1% | Hard |
| 186 | Reverse Words in a String II | 56.8% | Med. |
| 187 | Repeated DNA Sequences | 53.7% | Med. |
| 188 | Best Time to Buy and Sell Stock IV | 50.8% | Hard |
| 189 | Rotate Array | 45.3% | Med. |
| 190 | Reverse Bits | 68.9% | Easy |
| 191 | Number of 1 Bits | 77.2% | Easy |
| 192 | Word Frequency | 29.6% | Med. |
| 193 | Valid Phone Numbers | 30.3% | Easy |
| 194 | Transpose File | 32.6% | Med. |
| 195 | Tenth Line | 37.1% | Easy |
| 196 | Delete Duplicate Emails | 66.4% | Easy |
| 197 | Rising Temperature | 51.7% | Easy |
| 198 | House Robber | 53.4% | Med. |
| 199 | Binary Tree Right Side View | 70.8% | Med. |
| 200 | Number of Islands | 64.8% | Med. |
| 201 | Bitwise AND of Numbers Range | 49.0% | Med. |
| 202 | Happy Number | 60.0% | Easy |
| 203 | Remove Linked List Elements | 55.0% | Easy |
| 204 | Count Primes | 36.3% | Med. |
| 205 | Isomorphic Strings | 48.8% | Easy |
| 206 | Reverse Linked List | 80.8% | Easy |
| 207 | Course Schedule | 51.9% | Med. |
| 208 | Implement Trie (Prefix Tree) | 69.8% | Med. |
| 209 | Minimum Size Subarray Sum | 52.3% | Med. |
| 210 | Course Schedule II | 55.9% | Med. |
| 211 | Design Add and Search Words Data Structure | 48.8% | Med. |
| 212 | Word Search II | 38.7% | Hard |
| 213 | House Robber II | 45.3% | Med. |
| 214 | Shortest Palindrome | 42.8% | Hard |
| 215 | Kth Largest Element in an Array | 69.2% | Med. |
| 216 | Combination Sum III | 73.5% | Med. |
| 217 | Contains Duplicate | 64.6% | Easy |
| 218 | The Skyline Problem | 45.6% | Hard |
| 219 | Contains Duplicate II | 51.6% | Easy |
| 220 | Contains Duplicate III | 25.0% | Hard |
| 221 | Maximal Square | 50.6% | Med. |
| 222 | Count Complete Tree Nodes | 73.2% | Med. |
| 223 | Rectangle Area | 49.9% | Med. |
| 224 | Basic Calculator | 47.0% | Hard |
| 225 | Implement Stack using Queues | 70.5% | Easy |
| 226 | Invert Binary Tree | 80.3% | Easy |
| 227 | Basic Calculator II | 47.0% | Med. |
| 228 | Summary Ranges | 54.5% | Easy |
| 229 | Majority Element II | 56.6% | Med. |
| 230 | Kth Smallest Element in a BST | 77.1% | Med. |
| 231 | Power of Two | 50.3% | Easy |
| 232 | Implement Queue using Stacks | 70.2% | Easy |
| 233 | Number of Digit One | 39.3% | Hard |
| 234 | Palindrome Linked List | 58.4% | Easy |
| 235 | Lowest Common Ancestor of a Binary Search Tree | 71.0% | Med. |
| 236 | Lowest Common Ancestor of a Binary Tree | 69.8% | Med. |
| 237 | Delete Node in a Linked List | 84.2% | Med. |
| 238 | Product of Array Except Self | 69.1% | Med. |
| 239 | Sliding Window Maximum | 49.0% | Hard |
| 240 | Search a 2D Matrix II | 57.7% | Med. |
| 241 | Different Ways to Add Parentheses | 73.4% | Med. |
| 242 | Valid Anagram | 68.4% | Easy |
| 243 | Shortest Word Distance | 66.4% | Easy |
| 244 | Shortest Word Distance II | 63.0% | Med. |
| 245 | Shortest Word Distance III | 59.5% | Med. |
| 246 | Strobogrammatic Number | 47.5% | Easy |
| 247 | Strobogrammatic Number II | 53.5% | Med. |
| 248 | Strobogrammatic Number III | 42.7% | Hard |
| 249 | Group Shifted Strings | 67.8% | Med. |
| 250 | Count Univalue Subtrees | 57.5% | Med. |
| 251 | Flatten 2D Vector | 50.5% | Med. |
| 252 | Meeting Rooms | 59.5% | Easy |
| 253 | Meeting Rooms II | 52.8% | Med. |
| 254 | Factor Combinations | 50.6% | Med. |
| 255 | Verify Preorder Sequence in Binary Search Tree | 51.8% | Med. |
| 256 | Paint House | 64.5% | Med. |
| 257 | Binary Tree Paths | 69.0% | Easy |
| 258 | Add Digits | 69.1% | Easy |
| 259 | 3Sum Smaller | 51.4% | Med. |
| 260 | Single Number III | 70.2% | Med. |
| 261 | Graph Valid Tree | 50.1% | Med. |
| 262 | Trips and Users | 38.8% | Hard |
| 263 | Ugly Number | 43.9% | Easy |
| 264 | Ugly Number II | 49.7% | Med. |
| 265 | Paint House II | 57.2% | Hard |
| 266 | Palindrome Permutation | 68.7% | Easy |
| 267 | Palindrome Permutation II | 42.4% | Med. |
| 268 | Missing Number | 72.4% | Easy |
| 269 | Alien Dictionary | 37.3% | Hard |
| 270 | Closest Binary Search Tree Value | 49.2% | Easy |
| 271 | Encode and Decode Strings | 51.8% | Med. |
| 272 | Closest Binary Search Tree Value II | 61.3% | Hard |
| 273 | Integer to English Words | 35.1% | Hard |
| 274 | H-Index | 41.7% | Med. |
| 275 | H-Index II | 39.8% | Med. |
| 276 | Paint Fence | 48.5% | Med. |
| 277 | Find the Celebrity | 49.0% | Med. |
| 278 | First Bad Version | 47.4% | Easy |
| 279 | Perfect Squares | 56.7% | Med. |
| 280 | Wiggle Sort | 68.5% | Med. |
| 281 | Zigzag Iterator | 67.1% | Med. |
| 282 | Expression Add Operators | 43.5% | Hard |
| 283 | Move Zeroes | 64.1% | Easy |
| 284 | Peeking Iterator | 61.7% | Med. |
| 285 | Inorder Successor in BST | 51.3% | Med. |
| 286 | Walls and Gates | 64.1% | Med. |
| 287 | Find the Duplicate Number | 64.7% | Med. |
| 288 | Unique Word Abbreviation | 28.0% | Med. |
| 289 | Game of Life | 72.8% | Med. |
| 290 | Word Pattern | 44.4% | Easy |
| 291 | Word Pattern II | 49.1% | Med. |
| 292 | Nim Game | 60.2% | Easy |
| 293 | Flip Game | 65.1% | Easy |
| 294 | Flip Game II | 52.4% | Med. |
| 295 | Find Median from Data Stream | 54.8% | Hard |
| 296 | Best Meeting Point | 61.4% | Hard |
| 297 | Serialize and Deserialize Binary Tree | 61.2% | Hard |
| 298 | Binary Tree Longest Consecutive Sequence | 54.8% | Med. |
| 299 | Bulls and Cows | 52.8% | Med. |
| 300 | Longest Increasing Subsequence | 59.7% | Med. |
| 301 | Remove Invalid Parentheses | 50.0% | Hard |
| 302 | Smallest Rectangle Enclosing Black Pixels | 61.0% | Hard |
| 303 | Range Sum Query - Immutable | 72.9% | Easy |
| 304 | Range Sum Query 2D - Immutable | 58.7% | Med. |
| 305 | Number of Islands II | 40.7% | Hard |
| 306 | Additive Number | 34.1% | Med. |
| 307 | Range Sum Query - Mutable | 43.4% | Med. |
| 308 | Range Sum Query 2D - Mutable | 45.5% | Med. |
| 309 | Best Time to Buy and Sell Stock with Cooldown | 62.5% | Med. |
| 310 | Minimum Height Trees | 42.7% | Med. |
| 311 | Sparse Matrix Multiplication | 69.3% | Med. |
| 312 | Burst Balloons | 64.0% | Hard |
| 313 | Super Ugly Number | 46.3% | Med. |
| 314 | Binary Tree Vertical Order Traversal | 57.9% | Med. |
| 315 | Count of Smaller Numbers After Self | 43.8% | Hard |
| 316 | Remove Duplicate Letters | 54.1% | Med. |
| 317 | Shortest Distance from All Buildings | 45.0% | Hard |
| 318 | Maximum Product of Word Lengths | 61.4% | Med. |
| 319 | Bulb Switcher | 56.2% | Med. |
| 320 | Generalized Abbreviation | 60.9% | Med. |
| 321 | Create Maximum Number | 36.1% | Hard |
| 322 | Coin Change | 48.8% | Med. |
| 323 | Number of Connected Components in an Undirected Graph | 65.1% | Med. |
| 324 | Wiggle Sort II | 37.8% | Med. |
| 325 | Maximum Size Subarray Sum Equals k | 50.9% | Med. |
| 326 | Power of Three | 51.4% | Easy |
| 327 | Count of Range Sum | 39.4% | Hard |
| 328 | Odd Even Linked List | 62.7% | Med. |
| 329 | Longest Increasing Path in a Matrix | 56.9% | Hard |
| 330 | Patching Array | 54.5% | Hard |
| 331 | Verify Preorder Serialization of a Binary Tree | 47.6% | Med. |
| 332 | Reconstruct Itinerary | 44.8% | Hard |
| 333 | Largest BST Subtree | 45.9% | Med. |
| 334 | Increasing Triplet Subsequence | 39.5% | Med. |
| 335 | Self Crossing | 35.5% | Hard |
| 336 | Palindrome Pairs | 37.4% | Hard |
| 337 | House Robber III | 56.1% | Med. |
| 338 | Counting Bits | 80.8% | Easy |
| 339 | Nested List Weight Sum | 86.0% | Med. |
| 340 | Longest Substring with At Most K Distinct Characters | 50.1% | Med. |
| 341 | Flatten Nested List Iterator | 65.8% | Med. |
| 342 | Power of Four | 52.4% | Easy |
| 343 | Integer Break | 62.5% | Med. |
| 344 | Reverse String | 81.1% | Easy |
| 345 | Reverse Vowels of a String | 61.9% | Easy |
| 346 | Moving Average from Data Stream | 80.2% | Easy |
| 347 | Top K Frequent Elements | 67.0% | Med. |
| 348 | Design Tic-Tac-Toe | 58.8% | Med. |
| 349 | Intersection of Two Arrays | 78.1% | Easy |
| 350 | Intersection of Two Arrays II | 60.1% | Easy |
| 351 | Android Unlock Patterns | 53.9% | Med. |
| 352 | Data Stream as Disjoint Intervals | 60.4% | Hard |
| 353 | Design Snake Game | 40.1% | Med. |
| 354 | Russian Doll Envelopes | 38.1% | Hard |
| 355 | Design Twitter | 45.2% | Med. |
| 356 | Line Reflection | 36.4% | Med. |
| 357 | Count Numbers with Unique Digits | 56.0% | Med. |
| 358 | Rearrange String k Distance Apart | 40.0% | Hard |
| 359 | Logger Rate Limiter | 76.9% | Easy |
| 360 | Sort Transformed Array | 58.2% | Med. |
| 361 | Bomb Enemy | 52.9% | Med. |
| 362 | Design Hit Counter | 69.7% | Med. |
| 363 | Max Sum of Rectangle No Larger Than K | 45.8% | Hard |
| 364 | Nested List Weight Sum II | 67.0% | Med. |
| 365 | Water and Jug Problem | 46.0% | Med. |
| 366 | Find Leaves of Binary Tree | 81.3% | Med. |
| 367 | Valid Perfect Square | 45.1% | Easy |
| 368 | Largest Divisible Subset | 49.9% | Med. |
| 369 | Plus One Linked List | 61.2% | Med. |
| 370 | Range Addition | 73.1% | Med. |
| 371 | Sum of Two Integers | 55.9% | Med. |
| 372 | Super Pow | 37.2% | Med. |
| 373 | Find K Pairs with Smallest Sums | 42.2% | Med. |
| 374 | Guess Number Higher or Lower | 58.0% | Easy |
| 375 | Guess Number Higher or Lower II | 53.1% | Med. |
| 376 | Wiggle Subsequence | 49.6% | Med. |
| 377 | Combination Sum IV | 55.2% | Med. |
| 378 | Kth Smallest Element in a Sorted Matrix | 64.9% | Med. |
| 379 | Design Phone Directory | 53.2% | Med. |
| 380 | Insert Delete GetRandom O(1) | 55.4% | Med. |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | 36.8% | Hard |
| 382 | Linked List Random Node | 65.0% | Med. |
| 383 | Ransom Note | 66.2% | Easy |
| 384 | Shuffle an Array | 59.9% | Med. |
| 385 | Mini Parser | 43.1% | Med. |
| 386 | Lexicographical Numbers | 76.3% | Med. |
| 387 | First Unique Character in a String | 65.9% | Easy |
| 388 | Longest Absolute File Path | 49.7% | Med. |
| 389 | Find the Difference | 60.5% | Easy |
| 390 | Elimination Game | 46.5% | Med. |
| 391 | Perfect Rectangle | 38.6% | Hard |
| 392 | Is Subsequence | 49.2% | Easy |
| 393 | UTF-8 Validation | 46.4% | Med. |
| 394 | Decode String | 63.0% | Med. |
| 395 | Longest Substring with At Least K Repeating Characters | 46.5% | Med. |
| 396 | Rotate Function | 54.2% | Med. |
| 397 | Integer Replacement | 37.8% | Med. |
| 398 | Random Pick Index | 65.1% | Med. |
| 399 | Evaluate Division | 64.4% | Med. |
| 400 | Nth Digit | 38.6% | Med. |
| 401 | Binary Watch | 65.9% | Easy |
| 402 | Remove K Digits | 37.3% | Med. |
| 403 | Frog Jump | 47.5% | Hard |
| 404 | Sum of Left Leaves | 63.0% | Easy |
| 405 | Convert a Number to Hexadecimal | 54.6% | Easy |
| 406 | Queue Reconstruction by Height | 74.9% | Med. |
| 407 | Trapping Rain Water II | 64.1% | Hard |
| 408 | Valid Word Abbreviation | 37.0% | Easy |
| 409 | Longest Palindrome | 56.1% | Easy |
| 410 | Split Array Largest Sum | 61.0% | Hard |
| 411 | Minimum Unique Word Abbreviation | 40.5% | Hard |
| 412 | Fizz Buzz | 75.7% | Easy |
| 413 | Arithmetic Slices | 64.9% | Med. |
| 414 | Third Maximum Number | 39.9% | Easy |
| 415 | Add Strings | 52.2% | Easy |
| 416 | Partition Equal Subset Sum | 49.8% | Med. |
| 417 | Pacific Atlantic Water Flow | 61.2% | Med. |
| 418 | Sentence Screen Fitting | 36.4% | Med. |
| 419 | Battleships in a Board | 77.7% | Med. |
| 420 | Strong Password Checker | 16.1% | Hard |
| 421 | Maximum XOR of Two Numbers in an Array | 53.7% | Med. |
| 422 | Valid Word Square | 42.9% | Easy |
| 423 | Reconstruct Original Digits from English | 53.1% | Med. |
| 424 | Longest Repeating Character Replacement | 60.2% | Med. |
| 425 | Word Squares | 54.7% | Hard |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | 65.6% | Med. |
| 427 | Construct Quad Tree | 78.5% | Med. |
| 428 | Serialize and Deserialize N-ary Tree | 68.9% | Hard |
| 429 | N-ary Tree Level Order Traversal | 71.6% | Med. |
| 430 | Flatten a Multilevel Doubly Linked List | 63.2% | Med. |
| 431 | Encode N-ary Tree to Binary Tree | 80.7% | Hard |
| 432 | All O`one Data Structure | 44.4% | Hard |
| 433 | Minimum Genetic Mutation | 57.0% | Med. |
| 434 | Number of Segments in a String | 37.5% | Easy |
| 435 | Non-overlapping Intervals | 57.5% | Med. |
| 436 | Find Right Interval | 56.2% | Med. |
| 437 | Path Sum III | 46.5% | Med. |
| 438 | Find All Anagrams in a String | 54.2% | Med. |
| 439 | Ternary Expression Parser | 62.7% | Med. |
| 440 | K-th Smallest in Lexicographical Order | 46.4% | Hard |
| 441 | Arranging Coins | 48.4% | Easy |
| 442 | Find All Duplicates in an Array | 77.1% | Med. |
| 443 | String Compression | 60.4% | Med. |
| 444 | Sequence Reconstruction | 31.0% | Med. |
| 445 | Add Two Numbers II | 62.9% | Med. |
| 446 | Arithmetic Slices II - Subsequence | 55.1% | Hard |
| 447 | Number of Boomerangs | 57.8% | Med. |
| 448 | Find All Numbers Disappeared in an Array | 64.4% | Easy |
| 449 | Serialize and Deserialize BST | 59.8% | Med. |
| 450 | Delete Node in a BST | 55.1% | Med. |
| 451 | Sort Characters By Frequency | 75.6% | Med. |
| 452 | Minimum Number of Arrows to Burst Balloons | 61.7% | Med. |
| 453 | Minimum Moves to Equal Array Elements | 58.9% | Med. |
| 454 | 4Sum II | 58.1% | Med. |
| 455 | Assign Cookies | 55.3% | Easy |
| 456 | 132 Pattern | 35.0% | Med. |
| 457 | Circular Array Loop | 37.9% | Med. |
| 458 | Poor Pigs | 59.1% | Hard |
| 459 | Repeated Substring Pattern | 48.6% | Easy |
| 460 | LFU Cache | 49.8% | Hard |
| 461 | Hamming Distance | 76.9% | Easy |
| 462 | Minimum Moves to Equal Array Elements II | 62.2% | Med. |
| 463 | Island Perimeter | 74.3% | Easy |
| 464 | Can I Win | 31.6% | Med. |
| 465 | Optimal Account Balancing | 50.6% | Hard |
| 466 | Count The Repetitions | 35.3% | Hard |
| 467 | Unique Substrings in Wraparound String | 43.5% | Med. |
| 468 | Validate IP Address | 28.4% | Med. |
| 469 | Convex Polygon | 40.3% | Med. |
| 470 | Implement Rand10() Using Rand7() | 46.5% | Med. |
| 471 | Encode String with Shortest Length | 50.6% | Hard |
| 472 | Concatenated Words | 49.9% | Hard |
| 473 | Matchsticks to Square | 42.1% | Med. |
| 474 | Ones and Zeroes | 53.6% | Med. |
| 475 | Heaters | 42.3% | Med. |
| 476 | Number Complement | 70.5% | Easy |
| 477 | Total Hamming Distance | 55.1% | Med. |
| 478 | Generate Random Point in a Circle | 43.3% | Med. |
| 479 | Largest Palindrome Product | 39.4% | Hard |
| 480 | Sliding Window Median | 39.1% | Hard |
| 481 | Magical String | 55.9% | Med. |
| 482 | License Key Formatting | 46.3% | Easy |
| 483 | Smallest Good Base | 46.7% | Hard |
| 484 | Find Permutation | 66.8% | Med. |
| 485 | Max Consecutive Ones | 65.7% | Easy |
| 486 | Predict the Winner | 56.4% | Med. |
| 487 | Max Consecutive Ones II | 52.1% | Med. |
| 488 | Zuma Game | 29.4% | Hard |
| 489 | Robot Room Cleaner | 78.0% | Hard |
| 490 | The Maze | 60.5% | Med. |
| 491 | Non-decreasing Subsequences | 62.9% | Med. |
| 492 | Construct the Rectangle | 64.3% | Easy |
| 493 | Reverse Pairs | 34.8% | Hard |
| 494 | Target Sum | 52.6% | Med. |
| 495 | Teemo Attacking | 57.9% | Easy |
| 496 | Next Greater Element I | 76.6% | Easy |
| 497 | Random Point in Non-overlapping Rectangles | 40.2% | Med. |
| 498 | Diagonal Traverse | 67.3% | Med. |
| 499 | The Maze III | 52.5% | Hard |
| 500 | Keyboard Row | 74.2% | Easy |
| 501 | Find Mode in Binary Search Tree | 59.1% | Easy |
| 502 | IPO | 53.7% | Hard |
| 503 | Next Greater Element II | 68.8% | Med. |
| 504 | Base 7 | 54.9% | Easy |
| 505 | The Maze II | 55.2% | Med. |
| 506 | Relative Ranks | 75.0% | Easy |
| 507 | Perfect Number | 49.5% | Easy |
| 508 | Most Frequent Subtree Sum | 69.5% | Med. |
| 509 | Fibonacci Number | 74.4% | Easy |
| 510 | Inorder Successor in BST II | 61.1% | Med. |
| 511 | Game Play Analysis I | 76.5% | Easy |
| 512 | Game Play Analysis II | 54.8% | Easy |
| 513 | Find Bottom Left Tree Value | 72.5% | Med. |
| 514 | Freedom Trail | 59.4% | Hard |
| 515 | Find Largest Value in Each Tree Row | 66.3% | Med. |
| 516 | Longest Palindromic Subsequence | 65.7% | Med. |
| 517 | Super Washing Machines | 44.9% | Hard |
| 518 | Coin Change II | 59.5% | Med. |
| 519 | Random Flip Matrix | 46.4% | Med. |
| 520 | Detect Capital | 56.9% | Easy |
| 521 | Longest Uncommon Subsequence I | 62.5% | Easy |
| 522 | Longest Uncommon Subsequence II | 45.2% | Med. |
| 523 | Continuous Subarray Sum | 31.5% | Med. |
| 524 | Longest Word in Dictionary through Deleting | 52.9% | Med. |
| 525 | Contiguous Array | 51.9% | Med. |
| 526 | Beautiful Arrangement | 64.9% | Med. |
| 527 | Word Abbreviation | 62.8% | Hard |
| 528 | Random Pick with Weight | 49.2% | Med. |
| 529 | Minesweeper | 68.8% | Med. |
| 530 | Minimum Absolute Difference in BST | 59.6% | Easy |
| 531 | Lonely Pixel I | 62.7% | Med. |
| 532 | K-diff Pairs in an Array | 46.1% | Med. |
| 533 | Lonely Pixel II | 48.9% | Med. |
| 534 | Game Play Analysis III | 81.3% | Med. |
| 535 | Encode and Decode TinyURL | 86.7% | Med. |
| 536 | Construct Binary Tree from String | 58.7% | Med. |
| 537 | Complex Number Multiplication | 73.7% | Med. |
| 538 | Convert BST to Greater Tree | 71.8% | Med. |
| 539 | Minimum Time Difference | 62.6% | Med. |
| 540 | Single Element in a Sorted Array | 59.3% | Med. |
| 541 | Reverse String II | 54.2% | Easy |
| 542 | 01 Matrix | 54.5% | Med. |
| 543 | Diameter of Binary Tree | 65.9% | Easy |
| 544 | Output Contest Matches | 77.5% | Med. |
| 545 | Boundary of Binary Tree | 48.2% | Med. |
| 546 | Remove Boxes | 49.6% | Hard |
| 547 | Number of Provinces | 70.8% | Med. |
| 548 | Split Array with Equal Sum | 50.1% | Hard |
| 549 | Binary Tree Longest Consecutive Sequence II | 50.2% | Med. |
| 550 | Game Play Analysis IV | 41.9% | Med. |
| 551 | Student Attendance Record I | 50.4% | Easy |
| 552 | Student Attendance Record II | 56.8% | Hard |
| 553 | Optimal Division | 63.3% | Med. |
| 554 | Brick Wall | 56.1% | Med. |
| 555 | Split Concatenated Strings | 43.6% | Med. |
| 556 | Next Greater Element III | 35.5% | Med. |
| 557 | Reverse Words in a String III | 84.1% | Easy |
| 558 | Logical OR of Two Binary Grids Represented as Quad-Trees | 52.9% | Med. |
| 559 | Maximum Depth of N-ary Tree | 73.7% | Easy |
| 560 | Subarray Sum Equals K | 47.8% | Med. |
| 561 | Array Partition | 82.0% | Easy |
| 562 | Longest Line of Consecutive One in Matrix | 50.6% | Med. |
| 563 | Binary Tree Tilt | 66.2% | Easy |
| 564 | Find the Closest Palindrome | 32.0% | Hard |
| 565 | Array Nesting | 56.8% | Med. |
| 566 | Reshape the Matrix | 65.2% | Easy |
| 567 | Permutation in String | 49.3% | Med. |
| 568 | Maximum Vacation Days | 46.8% | Hard |
| 569 | Median Employee Salary | 65.8% | Hard |
| 570 | Managers with at Least 5 Direct Reports | 49.3% | Med. |
| 571 | Find Median Given Frequency of Numbers | 42.2% | Hard |
| 572 | Subtree of Another Tree | 51.9% | Easy |
| 573 | Squirrel Simulation | 57.4% | Med. |
| 574 | Winning Candidate | 62.8% | Med. |
| 575 | Distribute Candies | 71.4% | Easy |
| 576 | Out of Boundary Paths | 48.5% | Med. |
| 577 | Employee Bonus | 77.8% | Easy |
| 578 | Get Highest Answer Rate Question | 40.0% | Med. |
| 579 | Find Cumulative Salary of an Employee | 49.6% | Hard |
| 580 | Count Student Number in Departments | 60.0% | Med. |
| 581 | Shortest Unsorted Continuous Subarray | 38.5% | Med. |
| 582 | Kill Process | 70.7% | Med. |
| 583 | Delete Operation for Two Strings | 66.0% | Med. |
| 584 | Find Customer Referee | 73.2% | Easy |
| 585 | Investments in 2016 | 51.5% | Med. |
| 586 | Customer Placing the Largest Number of Orders | 64.6% | Easy |
| 587 | Erect the Fence | 53.2% | Hard |
| 588 | Design In-Memory File System | 48.3% | Hard |
| 589 | N-ary Tree Preorder Traversal | 76.9% | Easy |
| 590 | N-ary Tree Postorder Traversal | 81.2% | Easy |
| 591 | Tag Validator | 41.0% | Hard |
| 592 | Fraction Addition and Subtraction | 66.5% | Med. |
| 593 | Valid Square | 45.3% | Med. |
| 594 | Longest Harmonious Subsequence | 64.9% | Easy |
| 595 | Big Countries | 68.7% | Easy |
| 596 | Classes With at Least 5 Students | 64.4% | Easy |
| 597 | Friend Requests I: Overall Acceptance Rate | 41.0% | Easy |
| 598 | Range Addition II | 59.0% | Easy |
| 599 | Minimum Index Sum of Two Lists | 60.2% | Easy |
| 600 | Non-negative Integers without Consecutive Ones | 43.0% | Hard |
| 601 | Human Traffic of Stadium | 51.7% | Hard |
| 602 | Friend Requests II: Who Has the Most Friends | 63.2% | Med. |
| 603 | Consecutive Available Seats | 64.9% | Easy |
| 604 | Design Compressed String Iterator | 40.5% | Easy |
| 605 | Can Place Flowers | 29.2% | Easy |
| 606 | Construct String from Binary Tree | 70.8% | Med. |
| 607 | Sales Person | 66.2% | Easy |
| 608 | Tree Node | 76.2% | Med. |
| 609 | Find Duplicate File in System | 67.4% | Med. |
| 610 | Triangle Judgement | 75.0% | Easy |
| 611 | Valid Triangle Number | 57.1% | Med. |
| 612 | Shortest Distance in a Plane | 60.9% | Med. |
| 613 | Shortest Distance in a Line | 79.6% | Easy |
| 614 | Second Degree Follower | 40.9% | Med. |
| 615 | Average Salary: Departments VS Company | 56.6% | Hard |
| 616 | Add Bold Tag in String | 51.5% | Med. |
| 617 | Merge Two Binary Trees | 79.1% | Easy |
| 618 | Students Report By Geography | 63.5% | Hard |
| 619 | Biggest Single Number | 71.7% | Easy |
| 620 | Not Boring Movies | 75.1% | Easy |
| 621 | Task Scheduler | 63.5% | Med. |
| 622 | Design Circular Queue | 55.1% | Med. |
| 623 | Add One Row to Tree | 64.1% | Med. |
| 624 | Maximum Distance in Arrays | 45.6% | Med. |
| 625 | Minimum Factorization | 34.1% | Med. |
| 626 | Exchange Seats | 74.5% | Med. |
| 627 | Swap Sex of Employees | 84.8% | Easy |
| 628 | Maximum Product of Three Numbers | 47.1% | Easy |
| 629 | K Inverse Pairs Array | 49.0% | Hard |
| 630 | Course Schedule III | 41.9% | Hard |
| 631 | Design Excel Sum Formula | 39.6% | Hard |
| 632 | Smallest Range Covering Elements from K Lists | 70.3% | Hard |
| 633 | Sum of Square Numbers | 37.0% | Med. |
| 634 | Find the Derangement of An Array | 41.7% | Med. |
| 635 | Design Log Storage System | 59.7% | Med. |
| 636 | Exclusive Time of Functions | 66.3% | Med. |
| 637 | Average of Levels in Binary Tree | 75.1% | Easy |
| 638 | Shopping Offers | 52.6% | Med. |
| 639 | Decode Ways II | 32.1% | Hard |
| 640 | Solve the Equation | 46.4% | Med. |
| 641 | Design Circular Deque | 64.8% | Med. |
| 642 | Design Search Autocomplete System | 50.0% | Hard |
| 643 | Maximum Average Subarray I | 48.6% | Easy |
| 644 | Maximum Average Subarray II | 37.8% | Hard |
| 645 | Set Mismatch | 43.4% | Easy |
| 646 | Maximum Length of Pair Chain | 62.0% | Med. |
| 647 | Palindromic Substrings | 73.0% | Med. |
| 648 | Replace Words | 68.9% | Med. |
| 649 | Dota2 Senate | 50.2% | Med. |
| 650 | 2 Keys Keyboard | 59.4% | Med. |
| 651 | 4 Keys Keyboard | 56.5% | Med. |
| 652 | Find Duplicate Subtrees | 60.8% | Med. |
| 653 | Two Sum IV - Input is a BST | 63.5% | Easy |
| 654 | Maximum Binary Tree | 86.4% | Med. |
| 655 | Print Binary Tree | 66.7% | Med. |
| 656 | Coin Path | 34.4% | Hard |
| 657 | Robot Return to Origin | 78.2% | Easy |
| 658 | Find K Closest Elements | 49.9% | Med. |
| 659 | Split Array into Consecutive Subsequences | 52.4% | Med. |
| 660 | Remove 9 | 57.5% | Hard |
| 661 | Image Smoother | 69.4% | Easy |
| 662 | Maximum Width of Binary Tree | 45.9% | Med. |
| 663 | Equal Tree Partition | 42.3% | Med. |
| 664 | Strange Printer | 60.9% | Hard |
| 665 | Non-decreasing Array | 25.5% | Med. |
| 666 | Path Sum IV | 62.9% | Med. |
| 667 | Beautiful Arrangement II | 61.2% | Med. |
| 668 | Kth Smallest Number in Multiplication Table | 54.5% | Hard |
| 669 | Trim a Binary Search Tree | 66.8% | Med. |
| 670 | Maximum Swap | 52.1% | Med. |
| 671 | Second Minimum Node In a Binary Tree | 46.3% | Easy |
| 672 | Bulb Switcher II | 50.4% | Med. |
| 673 | Number of Longest Increasing Subsequence | 52.4% | Med. |
| 674 | Longest Continuous Increasing Subsequence | 52.2% | Easy |
| 675 | Cut Off Trees for Golf Event | 36.6% | Hard |
| 676 | Implement Magic Dictionary | 58.0% | Med. |
| 677 | Map Sum Pairs | 57.3% | Med. |
| 678 | Valid Parenthesis String | 40.3% | Med. |
| 679 | 24 Game | 59.6% | Hard |
| 680 | Valid Palindrome II | 44.5% | Easy |
| 681 | Next Closest Time | 47.0% | Med. |
| 682 | Baseball Game | 80.9% | Easy |
| 683 | K Empty Slots | 38.0% | Hard |
| 684 | Redundant Connection | 68.0% | Med. |
| 685 | Redundant Connection II | 36.4% | Hard |
| 686 | Repeated String Match | 39.5% | Med. |
| 687 | Longest Univalue Path | 44.2% | Med. |
| 688 | Knight Probability in Chessboard | 57.2% | Med. |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | 59.9% | Hard |
| 690 | Employee Importance | 69.6% | Med. |
| 691 | Stickers to Spell Word | 51.0% | Hard |
| 692 | Top K Frequent Words | 60.4% | Med. |
| 693 | Binary Number with Alternating Bits | 70.0% | Easy |
| 694 | Number of Distinct Islands | 62.9% | Med. |
| 695 | Max Area of Island | 74.1% | Med. |
| 696 | Count Binary Substrings | 70.5% | Easy |
| 697 | Degree of an Array | 58.5% | Easy |
| 698 | Partition to K Equal Sum Subsets | 38.8% | Med. |
| 699 | Falling Squares | 48.4% | Hard |
| 700 | Search in a Binary Search Tree | 83.0% | Easy |
| 701 | Insert into a Binary Search Tree | 73.6% | Med. |
| 702 | Search in a Sorted Array of Unknown Size | 73.1% | Med. |
| 703 | Kth Largest Element in a Stream | 61.4% | Easy |
| 704 | Binary Search | 61.2% | Easy |
| 705 | Design HashSet | 68.3% | Easy |
| 706 | Design HashMap | 66.7% | Easy |
| 707 | Design Linked List | 30.6% | Med. |
| 708 | Insert into a Sorted Circular Linked List | 38.6% | Med. |
| 709 | To Lower Case | 85.0% | Easy |
| 710 | Random Pick with Blacklist | 35.2% | Hard |
| 711 | Number of Distinct Islands II | 55.5% | Hard |
| 712 | Minimum ASCII Delete Sum for Two Strings | 71.1% | Med. |
| 713 | Subarray Product Less Than K | 54.8% | Med. |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | 72.4% | Med. |
| 715 | Range Module | 45.3% | Hard |
| 716 | Max Stack | 46.0% | Hard |
| 717 | 1-bit and 2-bit Characters | 49.7% | Easy |
| 718 | Maximum Length of Repeated Subarray | 51.5% | Med. |
| 719 | Find K-th Smallest Pair Distance | 46.7% | Hard |
| 720 | Longest Word in Dictionary | 55.2% | Med. |
| 721 | Accounts Merge | 61.7% | Med. |
| 722 | Remove Comments | 40.3% | Med. |
| 723 | Candy Crush | 77.6% | Med. |
| 724 | Find Pivot Index | 63.3% | Easy |
| 725 | Split Linked List in Parts | 70.7% | Med. |
| 726 | Number of Atoms | 65.2% | Hard |
| 727 | Minimum Window Subsequence | 43.9% | Hard |
| 728 | Self Dividing Numbers | 81.0% | Easy |
| 729 | My Calendar I | 58.3% | Med. |
| 730 | Count Different Palindromic Subsequences | 48.0% | Hard |
| 731 | My Calendar II | 63.3% | Med. |
| 732 | My Calendar III | 72.0% | Hard |
| 733 | Flood Fill | 68.7% | Easy |
| 734 | Sentence Similarity | 44.9% | Easy |
| 735 | Asteroid Collision | 48.5% | Med. |
| 736 | Parse Lisp Expression | 53.8% | Hard |
| 737 | Sentence Similarity II | 51.4% | Med. |
| 738 | Monotone Increasing Digits | 49.8% | Med. |
| 739 | Daily Temperatures | 69.0% | Med. |
| 740 | Delete and Earn | 57.4% | Med. |
| 741 | Cherry Pickup | 40.0% | Hard |
| 742 | Closest Leaf in a Binary Tree | 47.5% | Med. |
| 743 | Network Delay Time | 61.1% | Med. |
| 744 | Find Smallest Letter Greater Than Target | 59.4% | Easy |
| 745 | Prefix and Suffix Search | 41.0% | Hard |
| 746 | Min Cost Climbing Stairs | 68.5% | Easy |
| 747 | Largest Number At Least Twice of Others | 52.8% | Easy |
| 748 | Shortest Completing Word | 63.5% | Easy |
| 749 | Contain Virus | 55.4% | Hard |
| 750 | Number Of Corner Rectangles | 67.9% | Med. |
| 751 | IP to CIDR | 53.8% | Med. |
| 752 | Open the Lock | 61.5% | Med. |
| 753 | Cracking the Safe | 58.6% | Hard |
| 754 | Reach a Number | 45.4% | Med. |
| 755 | Pour Water | 49.1% | Med. |
| 756 | Pyramid Transition Matrix | 60.6% | Med. |
| 757 | Set Intersection Size At Least Two | 58.1% | Hard |
| 758 | Bold Words in String | 53.3% | Med. |
| 759 | Employee Free Time | 72.9% | Hard |
| 760 | Find Anagram Mappings | 84.0% | Easy |
| 761 | Special Binary String | 79.4% | Hard |
| 762 | Prime Number of Set Bits in Binary Representation | 78.9% | Easy |
| 763 | Partition Labels | 82.0% | Med. |
| 764 | Largest Plus Sign | 49.4% | Med. |
| 765 | Couples Holding Hands | 59.5% | Hard |
| 766 | Toeplitz Matrix | 69.7% | Easy |
| 767 | Reorganize String | 57.4% | Med. |
| 768 | Max Chunks To Make Sorted II | 55.0% | Hard |
| 769 | Max Chunks To Make Sorted | 64.2% | Med. |
| 770 | Basic Calculator IV | 49.8% | Hard |
| 771 | Jewels and Stones | 89.6% | Easy |
| 772 | Basic Calculator III | 53.5% | Hard |
| 773 | Sliding Puzzle | 74.5% | Hard |
| 774 | Minimize Max Distance to Gas Station | 54.0% | Hard |
| 775 | Global and Local Inversions | 42.9% | Med. |
| 776 | Split BST | 82.2% | Med. |
| 777 | Swap Adjacent in LR String | 38.3% | Med. |
| 778 | Swim in Rising Water | 68.1% | Hard |
| 779 | K-th Symbol in Grammar | 48.5% | Med. |
| 780 | Reaching Points | 34.5% | Hard |
| 781 | Rabbits in Forest | 58.0% | Med. |
| 782 | Transform to Chessboard | 51.5% | Hard |
| 783 | Minimum Distance Between BST Nodes | 61.7% | Easy |
| 784 | Letter Case Permutation | 76.0% | Med. |
| 785 | Is Graph Bipartite? | 59.6% | Med. |
| 786 | K-th Smallest Prime Fraction | 69.2% | Med. |
| 787 | Cheapest Flights Within K Stops | 42.3% | Med. |
| 788 | Rotated Digits | 64.1% | Med. |
| 789 | Escape The Ghosts | 63.9% | Med. |
| 790 | Domino and Tromino Tiling | 51.3% | Med. |
| 791 | Custom Sort String | 72.3% | Med. |
| 792 | Number of Matching Subsequences | 50.6% | Med. |
| 793 | Preimage Size of Factorial Zeroes Function | 47.3% | Hard |
| 794 | Valid Tic-Tac-Toe State | 34.9% | Med. |
| 795 | Number of Subarrays with Bounded Maximum | 55.2% | Med. |
| 796 | Rotate String | 66.8% | Easy |
| 797 | All Paths From Source to Target | 83.7% | Med. |
| 798 | Smallest Rotation with Highest Score | 54.4% | Hard |
| 799 | Champagne Tower | 64.0% | Med. |
| 800 | Similar RGB Color | 68.0% | Easy |
| 801 | Minimum Swaps To Make Sequences Increasing | 41.8% | Hard |
| 802 | Find Eventual Safe States | 71.3% | Med. |
| 803 | Bricks Falling When Hit | 37.6% | Hard |
| 804 | Unique Morse Code Words | 83.7% | Easy |
| 805 | Split Array With Same Average | 27.2% | Hard |
| 806 | Number of Lines To Write String | 72.9% | Easy |
| 807 | Max Increase to Keep City Skyline | 86.4% | Med. |
| 808 | Soup Servings | 59.6% | Med. |
| 809 | Expressive Words | 46.9% | Med. |
| 810 | Chalkboard XOR Game | 66.6% | Hard |
| 811 | Subdomain Visit Count | 77.2% | Med. |
| 812 | Largest Triangle Area | 71.8% | Easy |
| 813 | Largest Sum of Averages | 55.3% | Med. |
| 814 | Binary Tree Pruning | 72.5% | Med. |
| 815 | Bus Routes | 47.4% | Hard |
| 816 | Ambiguous Coordinates | 56.4% | Med. |
| 817 | Linked List Components | 58.1% | Med. |
| 818 | Race Car | 44.9% | Hard |
| 819 | Most Common Word | 45.3% | Easy |
| 820 | Short Encoding of Words | 60.9% | Med. |
| 821 | Shortest Distance to a Character | 72.9% | Easy |
| 822 | Card Flipping Game | 50.6% | Med. |
| 823 | Binary Trees With Factors | 53.1% | Med. |
| 824 | Goat Latin | 70.1% | Easy |
| 825 | Friends Of Appropriate Ages | 49.9% | Med. |
| 826 | Most Profit Assigning Work | 56.3% | Med. |
| 827 | Making A Large Island | 57.0% | Hard |
| 828 | Count Unique Characters of All Substrings of a Given String | 53.8% | Hard |
| 829 | Consecutive Numbers Sum | 42.8% | Hard |
| 830 | Positions of Large Groups | 54.2% | Easy |
| 831 | Masking Personal Information | 55.9% | Med. |
| 832 | Flipping an Image | 83.9% | Easy |
| 833 | Find And Replace in String | 50.8% | Med. |
| 834 | Sum of Distances in Tree | 65.7% | Hard |
| 835 | Image Overlap | 64.1% | Med. |
| 836 | Rectangle Overlap | 46.9% | Easy |
| 837 | New 21 Game | 51.9% | Med. |
| 838 | Push Dominoes | 63.1% | Med. |
| 839 | Similar String Groups | 56.4% | Hard |
| 840 | Magic Squares In Grid | 55.2% | Med. |
| 841 | Keys and Rooms | 76.0% | Med. |
| 842 | Split Array into Fibonacci Sequence | 40.5% | Med. |
| 843 | Guess the Word | 36.6% | Hard |
| 844 | Backspace String Compare | 50.1% | Easy |
| 845 | Longest Mountain in Array | 42.4% | Med. |
| 846 | Hand of Straights | 58.2% | Med. |
| 847 | Shortest Path Visiting All Nodes | 66.2% | Hard |
| 848 | Shifting Letters | 46.4% | Med. |
| 849 | Maximize Distance to Closest Person | 49.9% | Med. |
| 850 | Rectangle Area II | 56.4% | Hard |
| 851 | Loud and Rich | 63.9% | Med. |
| 852 | Peak Index in a Mountain Array | 66.7% | Med. |
| 853 | Car Fleet | 55.4% | Med. |
| 854 | K-Similar Strings | 41.1% | Hard |
| 855 | Exam Room | 43.7% | Med. |
| 856 | Score of Parentheses | 63.5% | Med. |
| 857 | Minimum Cost to Hire K Workers | 63.7% | Hard |
| 858 | Mirror Reflection | 62.0% | Med. |
| 859 | Buddy Strings | 34.1% | Easy |
| 860 | Lemonade Change | 59.3% | Easy |
| 861 | Score After Flipping Matrix | 80.3% | Med. |
| 862 | Shortest Subarray with Sum at Least K | 32.9% | Hard |
| 863 | All Nodes Distance K in Binary Tree | 67.9% | Med. |
| 864 | Shortest Path to Get All Keys | 54.8% | Hard |
| 865 | Smallest Subtree with all the Deepest Nodes | 77.7% | Med. |
| 866 | Prime Palindrome | 28.4% | Med. |
| 867 | Transpose Matrix | 76.8% | Easy |
| 868 | Binary Gap | 74.4% | Easy |
| 869 | Reordered Power of 2 | 65.9% | Med. |
| 870 | Advantage Shuffle | 54.8% | Med. |
| 871 | Minimum Number of Refueling Stops | 41.7% | Hard |
| 872 | Leaf-Similar Trees | 70.3% | Easy |
| 873 | Length of Longest Fibonacci Subsequence | 57.5% | Med. |
| 874 | Walking Robot Simulation | 64.6% | Med. |
| 875 | Koko Eating Bananas | 50.3% | Med. |
| 876 | Middle of the Linked List | 82.2% | Easy |
| 877 | Stone Game | 73.5% | Med. |
| 878 | Nth Magical Number | 36.9% | Hard |
| 879 | Profitable Schemes | 48.5% | Hard |
| 880 | Decoded String at Index | 37.4% | Med. |
| 881 | Boats to Save People | 62.1% | Med. |
| 882 | Reachable Nodes In Subdivided Graph | 52.5% | Hard |
| 883 | Projection Area of 3D Shapes | 76.4% | Easy |
| 884 | Uncommon Words from Two Sentences | 75.8% | Easy |
| 885 | Spiral Matrix III | 84.6% | Med. |
| 886 | Possible Bipartition | 52.9% | Med. |
| 887 | Super Egg Drop | 30.6% | Hard |
| 888 | Fair Candy Swap | 65.3% | Easy |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | 78.0% | Med. |
| 890 | Find and Replace Pattern | 77.1% | Med. |
| 891 | Sum of Subsequence Widths | 40.9% | Hard |
| 892 | Surface Area of 3D Shapes | 71.1% | Easy |
| 893 | Groups of Special-Equivalent Strings | 73.7% | Med. |
| 894 | All Possible Full Binary Trees | 82.8% | Med. |
| 895 | Maximum Frequency Stack | 67.0% | Hard |
| 896 | Monotonic Array | 62.4% | Easy |
| 897 | Increasing Order Search Tree | 79.0% | Easy |
| 898 | Bitwise ORs of Subarrays | 56.9% | Med. |
| 899 | Orderly Queue | 67.1% | Hard |
| 900 | RLE Iterator | 59.5% | Med. |
| 901 | Online Stock Span | 69.5% | Med. |
| 902 | Numbers At Most N Given Digit Set | 45.6% | Hard |
| 903 | Valid Permutations for DI Sequence | 56.5% | Hard |
| 904 | Fruit Into Baskets | 51.9% | Med. |
| 905 | Sort Array By Parity | 76.6% | Easy |
| 906 | Super Palindromes | 40.1% | Hard |
| 907 | Sum of Subarray Minimums | 38.9% | Med. |
| 908 | Smallest Range I | 73.8% | Easy |
| 909 | Snakes and Ladders | 48.2% | Med. |
| 910 | Smallest Range II | 38.1% | Med. |
| 911 | Online Election | 53.0% | Med. |
| 912 | Sort an Array | 55.9% | Med. |
| 913 | Cat and Mouse | 35.6% | Hard |
| 914 | X of a Kind in a Deck of Cards | 30.4% | Easy |
| 915 | Partition Array into Disjoint Intervals | 49.5% | Med. |
| 916 | Word Subsets | 56.0% | Med. |
| 917 | Reverse Only Letters | 68.8% | Easy |
| 918 | Maximum Sum Circular Subarray | 50.9% | Med. |
| 919 | Complete Binary Tree Inserter | 65.1% | Med. |
| 920 | Number of Music Playlists | 60.1% | Hard |
| 921 | Minimum Add to Make Parentheses Valid | 74.3% | Med. |
| 922 | Sort Array By Parity II | 71.3% | Easy |
| 923 | 3Sum With Multiplicity | 46.4% | Med. |
| 924 | Minimize Malware Spread | 43.3% | Hard |
| 925 | Long Pressed Name | 33.0% | Easy |
| 926 | Flip String to Monotone Increasing | 61.9% | Med. |
| 927 | Three Equal Parts | 41.5% | Hard |
| 928 | Minimize Malware Spread II | 45.9% | Hard |
| 929 | Unique Email Addresses | 67.9% | Easy |
| 930 | Binary Subarrays With Sum | 69.5% | Med. |
| 931 | Minimum Falling Path Sum | 60.8% | Med. |
| 932 | Beautiful Array | 70.0% | Med. |
| 933 | Number of Recent Calls | 78.8% | Easy |
| 934 | Shortest Bridge | 59.6% | Med. |
| 935 | Knight Dialer | 62.0% | Med. |
| 936 | Stamping The Sequence | 62.3% | Hard |
| 937 | Reorder Data in Log Files | 56.8% | Med. |
| 938 | Range Sum of BST | 87.6% | Easy |
| 939 | Minimum Area Rectangle | 55.4% | Med. |
| 940 | Distinct Subsequences II | 44.2% | Hard |
| 941 | Valid Mountain Array | 35.5% | Easy |
| 942 | DI String Match | 81.2% | Easy |
| 943 | Find the Shortest Superstring | 45.5% | Hard |
| 944 | Delete Columns to Make Sorted | 78.1% | Easy |
| 945 | Minimum Increment to Make Array Unique | 60.7% | Med. |
| 946 | Validate Stack Sequences | 70.6% | Med. |
| 947 | Most Stones Removed with Same Row or Column | 63.3% | Med. |
| 948 | Bag of Tokens | 59.7% | Med. |
| 949 | Largest Time for Given Digits | 36.0% | Med. |
| 950 | Reveal Cards In Increasing Order | 83.7% | Med. |
| 951 | Flip Equivalent Binary Trees | 69.5% | Med. |
| 952 | Largest Component Size by Common Factor | 43.5% | Hard |
| 953 | Verifying an Alien Dictionary | 56.1% | Easy |
| 954 | Array of Doubled Pairs | 39.9% | Med. |
| 955 | Delete Columns to Make Sorted II | 49.7% | Med. |
| 956 | Tallest Billboard | 51.9% | Hard |
| 957 | Prison Cells After N Days | 39.2% | Med. |
| 958 | Check Completeness of a Binary Tree | 59.4% | Med. |
| 959 | Regions Cut By Slashes | 77.5% | Med. |
| 960 | Delete Columns to Make Sorted III | 72.6% | Hard |
| 961 | N-Repeated Element in Size 2N Array | 80.0% | Easy |
| 962 | Maximum Width Ramp | 55.9% | Med. |
| 963 | Minimum Area Rectangle II | 55.9% | Med. |
| 964 | Least Operators to Express Number | 48.4% | Hard |
| 965 | Univalued Binary Tree | 73.2% | Easy |
| 966 | Vowel Spellchecker | 61.4% | Med. |
| 967 | Numbers With Same Consecutive Differences | 59.3% | Med. |
| 968 | Binary Tree Cameras | 48.0% | Hard |
| 969 | Pancake Sorting | 71.8% | Med. |
| 970 | Powerful Integers | 44.6% | Med. |
| 971 | Flip Binary Tree To Match Preorder Traversal | 52.0% | Med. |
| 972 | Equal Rational Numbers | 46.4% | Hard |
| 973 | K Closest Points to Origin | 69.2% | Med. |
| 974 | Subarray Sums Divisible by K | 56.5% | Med. |
| 975 | Odd Even Jump | 41.4% | Hard |
| 976 | Largest Perimeter Triangle | 62.3% | Easy |
| 977 | Squares of a Sorted Array | 74.0% | Easy |
| 978 | Longest Turbulent Subarray | 49.3% | Med. |
| 979 | Distribute Coins in Binary Tree | 77.3% | Med. |
| 980 | Unique Paths III | 82.9% | Hard |
| 981 | Time Based Key-Value Store | 50.1% | Med. |
| 982 | Triples with Bitwise AND Equal To Zero | 60.2% | Hard |
| 983 | Minimum Cost For Tickets | 67.5% | Med. |
| 984 | String Without AAA or BBB | 45.5% | Med. |
| 985 | Sum of Even Numbers After Queries | 68.9% | Med. |
| 986 | Interval List Intersections | 73.1% | Med. |
| 987 | Vertical Order Traversal of a Binary Tree | 54.4% | Hard |
| 988 | Smallest String Starting From Leaf | 61.3% | Med. |
| 989 | Add to Array-Form of Integer | 45.6% | Easy |
| 990 | Satisfiability of Equality Equations | 52.0% | Med. |
| 991 | Broken Calculator | 56.3% | Med. |
| 992 | Subarrays with K Different Integers | 68.7% | Hard |
| 993 | Cousins in Binary Tree | 59.6% | Easy |
| 994 | Rotting Oranges | 59.1% | Med. |
| 995 | Minimum Number of K Consecutive Bit Flips | 62.4% | Hard |
| 996 | Number of Squareful Arrays | 51.6% | Hard |
| 997 | Find the Town Judge | 51.0% | Easy |
| 998 | Maximum Binary Tree II | 70.7% | Med. |
| 999 | Available Captures for Rook | 72.0% | Easy |
| 1000 | Minimum Cost to Merge Stones | 46.5% | Hard |
Problems 1001-2000
| S.No | Problem | Acceptance | Level |
|---|---|---|---|
| 1001 | Grid Illumination | 39.7% | Hard |
| 1002 | Find Common Characters | 74.8% | Easy |
| 1003 | Check If Word Is Valid After Substitutions | 61.3% | Med. |
| 1004 | Max Consecutive Ones III | 68.1% | Med. |
| 1005 | Maximize Sum Of Array After K Negations | 54.1% | Easy |
| 1006 | Clumsy Factorial | 61.7% | Med. |
| 1007 | Minimum Domino Rotations For Equal Row | 56.5% | Med. |
| 1008 | Construct Binary Search Tree from Preorder Traversal | 84.5% | Med. |
| 1009 | Complement of Base 10 Integer | 63.4% | Easy |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | 53.5% | Med. |
| 1011 | Capacity To Ship Packages Within D Days | 74.4% | Med. |
| 1012 | Numbers With Repeated Digits | 48.0% | Hard |
| 1013 | Partition Array Into Three Parts With Equal Sum | 42.9% | Easy |
| 1014 | Best Sightseeing Pair | 62.7% | Med. |
| 1015 | Smallest Integer Divisible by K | 54.2% | Med. |
| 1016 | Binary String With Substrings Representing 1 To N | 58.6% | Med. |
| 1017 | Convert to Base -2 | 61.9% | Med. |
| 1018 | Binary Prefix Divisible By 5 | 53.7% | Easy |
| 1019 | Next Greater Node In Linked List | 64.6% | Med. |
| 1020 | Number of Enclaves | 72.1% | Med. |
| 1021 | Remove Outermost Parentheses | 87.3% | Easy |
| 1022 | Sum of Root To Leaf Binary Numbers | 76.7% | Easy |
| 1023 | Camelcase Matching | 65.7% | Med. |
| 1024 | Video Stitching | 52.8% | Med. |
| 1025 | Divisor Game | 72.3% | Easy |
| 1026 | Maximum Difference Between Node and Ancestor | 78.2% | Med. |
| 1027 | Longest Arithmetic Subsequence | 50.1% | Med. |
| 1028 | Recover a Tree From Preorder Traversal | 83.2% | Hard |
| 1029 | Two City Scheduling | 68.7% | Med. |
| 1030 | Matrix Cells in Distance Order | 74.4% | Easy |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | 61.1% | Med. |
| 1032 | Stream of Characters | 52.6% | Hard |
| 1033 | Moving Stones Until Consecutive | 52.5% | Med. |
| 1034 | Coloring A Border | 51.5% | Med. |
| 1035 | Uncrossed Lines | 65.4% | Med. |
| 1036 | Escape a Large Maze | 36.9% | Hard |
| 1037 | Valid Boomerang | 40.0% | Easy |
| 1038 | Binary Search Tree to Greater Sum Tree | 88.4% | Med. |
| 1039 | Minimum Score Triangulation of Polygon | 67.5% | Med. |
| 1040 | Moving Stones Until Consecutive II | 59.1% | Med. |
| 1041 | Robot Bounded In Circle | 56.6% | Med. |
| 1042 | Flower Planting With No Adjacent | 53.9% | Med. |
| 1043 | Partition Array for Maximum Sum | 77.5% | Med. |
| 1044 | Longest Duplicate Substring | 31.3% | Hard |
| 1045 | Customers Who Bought All Products | 64.3% | Med. |
| 1046 | Last Stone Weight | 66.6% | Easy |
| 1047 | Remove All Adjacent Duplicates In String | 73.7% | Easy |
| 1048 | Longest String Chain | 63.3% | Med. |
| 1049 | Last Stone Weight II | 60.4% | Med. |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | 71.2% | Easy |
| 1051 | Height Checker | 81.9% | Easy |
| 1052 | Grumpy Bookstore Owner | 64.1% | Med. |
| 1053 | Previous Permutation With One Swap | 49.2% | Med. |
| 1054 | Distant Barcodes | 49.2% | Med. |
| 1055 | Shortest Way to Form String | 61.7% | Med. |
| 1056 | Confusing Number | 49.9% | Easy |
| 1057 | Campus Bikes | 59.1% | Med. |
| 1058 | Minimize Rounding Error to Meet Target | 45.9% | Med. |
| 1059 | All Paths from Source Lead to Destination | 37.3% | Med. |
| 1060 | Missing Element in Sorted Array | 59.7% | Med. |
| 1061 | Lexicographically Smallest Equivalent String | 81.1% | Med. |
| 1062 | Longest Repeating Substring | 63.5% | Med. |
| 1063 | Number of Valid Subarrays | 80.1% | Hard |
| 1064 | Fixed Point | 64.3% | Easy |
| 1065 | Index Pairs of a String | 68.7% | Easy |
| 1066 | Campus Bikes II | 55.9% | Med. |
| 1067 | Digit Count in Range | 46.5% | Hard |
| 1068 | Product Sales Analysis I | 86.0% | Easy |
| 1069 | Product Sales Analysis II | 82.7% | Easy |
| 1070 | Product Sales Analysis III | 46.3% | Med. |
| 1071 | Greatest Common Divisor of Strings | 54.1% | Easy |
| 1072 | Flip Columns For Maximum Number of Equal Rows | 78.5% | Med. |
| 1073 | Adding Two Negabinary Numbers | 38.0% | Med. |
| 1074 | Number of Submatrices That Sum to Target | 74.6% | Hard |
| 1075 | Project Employees I | 67.1% | Easy |
| 1076 | Project Employees II | 50.5% | Easy |
| 1077 | Project Employees III | 77.2% | Med. |
| 1078 | Occurrences After Bigram | 64.0% | Easy |
| 1079 | Letter Tile Possibilities | 83.5% | Med. |
| 1080 | Insufficient Nodes in Root to Leaf Paths | 55.4% | Med. |
| 1081 | Smallest Subsequence of Distinct Characters | 70.5% | Med. |
| 1082 | Sales Analysis I | 74.8% | Easy |
| 1083 | Sales Analysis II | 50.2% | Easy |
| 1084 | Sales Analysis III | 48.0% | Easy |
| 1085 | Sum of Digits in the Minimum Number | 76.7% | Easy |
| 1086 | High Five | 74.2% | Easy |
| 1087 | Brace Expansion | 66.9% | Med. |
| 1088 | Confusing Number II | 47.2% | Hard |
| 1089 | Duplicate Zeros | 53.8% | Easy |
| 1090 | Largest Values From Labels | 64.5% | Med. |
| 1091 | Shortest Path in Binary Matrix | 51.9% | Med. |
| 1092 | Shortest Common Supersequence | 62.2% | Hard |
| 1093 | Statistics from a Large Sample | 43.3% | Med. |
| 1094 | Car Pooling | 56.4% | Med. |
| 1095 | Find in Mountain Array | 41.9% | Hard |
| 1096 | Brace Expansion II | 63.8% | Hard |
| 1097 | Game Play Analysis V | 50.4% | Hard |
| 1098 | Unpopular Books | 43.4% | Med. |
| 1099 | Two Sum Less Than K | 62.2% | Easy |
| 1100 | Find K-Length Substrings With No Repeated Characters | 76.5% | Med. |
| 1101 | The Earliest Moment When Everyone Become Friends | 66.1% | Med. |
| 1102 | Path With Maximum Minimum Value | 54.7% | Med. |
| 1103 | Distribute Candies to People | 67.8% | Easy |
| 1104 | Path In Zigzag Labelled Binary Tree | 75.8% | Med. |
| 1105 | Filling Bookcase Shelves | 68.6% | Med. |
| 1106 | Parsing A Boolean Expression | 69.8% | Hard |
| 1107 | New Users Daily Count | 44.4% | Med. |
| 1108 | Defanging an IP Address | 90.1% | Easy |
| 1109 | Corporate Flight Bookings | 68.1% | Med. |
| 1110 | Delete Nodes And Return Forest | 72.5% | Med. |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | 72.0% | Med. |
| 1112 | Highest Grade For Each Student | 71.2% | Med. |
| 1113 | Reported Posts | 64.8% | Easy |
| 1114 | Print in Order | 73.3% | Easy |
| 1115 | Print FooBar Alternately | 72.9% | Med. |
| 1116 | Print Zero Even Odd | 65.9% | Med. |
| 1117 | Building H2O | 58.4% | Med. |
| 1118 | Number of Days in a Month | 59.4% | Easy |
| 1119 | Remove Vowels from a String | 91.3% | Easy |
| 1120 | Maximum Average Subtree | 67.0% | Med. |
| 1121 | Divide Array Into Increasing Sequences | 65.5% | Hard |
| 1122 | Relative Sort Array | 75.3% | Easy |
| 1123 | Lowest Common Ancestor of Deepest Leaves | 79.5% | Med. |
| 1124 | Longest Well-Performing Interval | 38.0% | Med. |
| 1125 | Smallest Sufficient Team | 55.7% | Hard |
| 1126 | Active Businesses | 66.0% | Med. |
| 1127 | User Purchase Platform | 46.3% | Hard |
| 1128 | Number of Equivalent Domino Pairs | 60.7% | Easy |
| 1129 | Shortest Path with Alternating Colors | 48.2% | Med. |
| 1130 | Minimum Cost Tree From Leaf Values | 67.9% | Med. |
| 1131 | Maximum of Absolute Value Expression | 48.8% | Med. |
| 1132 | Reported Posts II | 32.0% | Med. |
| 1133 | Largest Unique Number | 71.3% | Easy |
| 1134 | Armstrong Number | 77.8% | Easy |
| 1135 | Connecting Cities With Minimum Cost | 63.6% | Med. |
| 1136 | Parallel Courses | 62.3% | Med. |
| 1137 | N-th Tribonacci Number | 63.1% | Easy |
| 1138 | Alphabet Board Path | 51.9% | Med. |
| 1139 | Largest 1-Bordered Square | 52.3% | Med. |
| 1140 | Stone Game II | 72.8% | Med. |
| 1141 | User Activity for the Past 30 Days I | 51.2% | Easy |
| 1142 | User Activity for the Past 30 Days II | 35.6% | Easy |
| 1143 | Longest Common Subsequence | 59.4% | Med. |
| 1144 | Decrease Elements To Make Array Zigzag | 49.3% | Med. |
| 1145 | Binary Tree Coloring Game | 53.0% | Med. |
| 1146 | Snapshot Array | 36.8% | Med. |
| 1147 | Longest Chunked Palindrome Decomposition | 58.9% | Hard |
| 1148 | Article Views I | 76.7% | Easy |
| 1149 | Article Views II | 47.3% | Med. |
| 1150 | Check If a Number Is Majority Element in a Sorted Array | 60.0% | Easy |
| 1151 | Minimum Swaps to Group All 1's Together | 61.3% | Med. |
| 1152 | Analyze User Website Visit Pattern | 44.3% | Med. |
| 1153 | String Transforms Into Another String | 34.6% | Hard |
| 1154 | Day of the Year | 50.0% | Easy |
| 1155 | Number of Dice Rolls With Target Sum | 62.5% | Med. |
| 1156 | Swap For Longest Repeated Character Substring | 44.7% | Med. |
| 1157 | Online Majority Element In Subarray | 40.6% | Hard |
| 1158 | Market Analysis I | 57.6% | Med. |
| 1159 | Market Analysis II | 57.8% | Hard |
| 1160 | Find Words That Can Be Formed by Characters | 71.7% | Easy |
| 1161 | Maximum Level Sum of a Binary Tree | 70.0% | Med. |
| 1162 | As Far from Land as Possible | 52.4% | Med. |
| 1163 | Last Substring in Lexicographical Order | 35.2% | Hard |
| 1164 | Product Price at a Given Date | 58.2% | Med. |
| 1165 | Single-Row Keyboard | 87.8% | Easy |
| 1166 | Design File System | 65.2% | Med. |
| 1167 | Minimum Cost to Connect Sticks | 72.0% | Med. |
| 1168 | Optimize Water Distribution in a Village | 65.6% | Hard |
| 1169 | Invalid Transactions | 32.4% | Med. |
| 1170 | Compare Strings by Frequency of the Smallest Character | 63.5% | Med. |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | 53.2% | Med. |
| 1172 | Dinner Plate Stacks | 33.8% | Hard |
| 1173 | Immediate Food Delivery I | 80.6% | Easy |
| 1174 | Immediate Food Delivery II | 56.5% | Med. |
| 1175 | Prime Arrangements | 61.6% | Easy |
| 1176 | Diet Plan Performance | 56.1% | Easy |
| 1177 | Can Make Palindrome from Substring | 41.9% | Med. |
| 1178 | Number of Valid Words for Each Puzzle | 48.0% | Hard |
| 1179 | Reformat Department Table | 76.4% | Easy |
| 1180 | Count Substrings with Only One Distinct Letter | 80.9% | Easy |
| 1181 | Before and After Puzzle | 51.9% | Med. |
| 1182 | Shortest Distance to Target Color | 56.5% | Med. |
| 1183 | Maximum Number of Ones | 70.7% | Hard |
| 1184 | Distance Between Bus Stops | 55.6% | Easy |
| 1185 | Day of the Week | 59.4% | Easy |
| 1186 | Maximum Subarray Sum with One Deletion | 48.7% | Med. |
| 1187 | Make Array Strictly Increasing | 58.1% | Hard |
| 1188 | Design Bounded Blocking Queue | 73.9% | Med. |
| 1189 | Maximum Number of Balloons | 64.2% | Easy |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | 72.1% | Med. |
| 1191 | K-Concatenation Maximum Sum | 25.9% | Med. |
| 1192 | Critical Connections in a Network | 60.2% | Hard |
| 1193 | Monthly Transactions I | 59.5% | Med. |
| 1194 | Tournament Winners | 50.1% | Hard |
| 1195 | Fizz Buzz Multithreaded | 75.0% | Med. |
| 1196 | How Many Apples Can You Put into the Basket | 67.2% | Easy |
| 1197 | Minimum Knight Moves | 42.0% | Med. |
| 1198 | Find Smallest Common Element in All Rows | 76.8% | Med. |
| 1199 | Minimum Time to Build Blocks | 46.8% | Hard |
| 1200 | Minimum Absolute Difference | 75.2% | Easy |
| 1201 | Ugly Number III | 31.7% | Med. |
| 1202 | Smallest String With Swaps | 60.8% | Med. |
| 1203 | Sort Items by Groups Respecting Dependencies | 66.0% | Hard |
| 1204 | Last Person to Fit in the Bus | 69.6% | Med. |
| 1205 | Monthly Transactions II | 42.0% | Med. |
| 1206 | Design Skiplist | 59.8% | Hard |
| 1207 | Unique Number of Occurrences | 78.8% | Easy |
| 1208 | Get Equal Substrings Within Budget | 59.9% | Med. |
| 1209 | Remove All Adjacent Duplicates in String II | 61.6% | Med. |
| 1210 | Minimum Moves to Reach Target with Rotations | 52.4% | Hard |
| 1211 | Queries Quality and Percentage | 54.0% | Easy |
| 1212 | Team Scores in Football Tournament | 55.8% | Med. |
| 1213 | Intersection of Three Sorted Arrays | 80.0% | Easy |
| 1214 | Two Sum BSTs | 68.2% | Med. |
| 1215 | Stepping Numbers | 48.6% | Med. |
| 1216 | Valid Palindrome III | 49.2% | Hard |
| 1217 | Minimum Cost to Move Chips to The Same Position | 73.1% | Easy |
| 1218 | Longest Arithmetic Subsequence of Given Difference | 54.3% | Med. |
| 1219 | Path with Maximum Gold | 68.5% | Med. |
| 1220 | Count Vowels Permutation | 61.3% | Hard |
| 1221 | Split a String in Balanced Strings | 87.5% | Easy |
| 1222 | Queens That Can Attack the King | 72.8% | Med. |
| 1223 | Dice Roll Simulation | 51.1% | Hard |
| 1224 | Maximum Equal Frequency | 38.3% | Hard |
| 1225 | Report Contiguous Dates | 57.1% | Hard |
| 1226 | The Dining Philosophers | 53.9% | Med. |
| 1227 | Airplane Seat Assignment Probability | 67.5% | Med. |
| 1228 | Missing Number In Arithmetic Progression | 52.2% | Easy |
| 1229 | Meeting Scheduler | 55.2% | Med. |
| 1230 | Toss Strange Coins | 58.1% | Med. |
| 1231 | Divide Chocolate | 60.6% | Hard |
| 1232 | Check If It Is a Straight Line | 40.2% | Easy |
| 1233 | Remove Sub-Folders from the Filesystem | 78.6% | Med. |
| 1234 | Replace the Substring for Balanced String | 41.2% | Med. |
| 1235 | Maximum Profit in Job Scheduling | 54.8% | Hard |
| 1236 | Web Crawler | 68.8% | Med. |
| 1237 | Find Positive Integer Solution for a Given Equation | 70.1% | Med. |
| 1238 | Circular Permutation in Binary Representation | 72.9% | Med. |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | 54.9% | Med. |
| 1240 | Tiling a Rectangle with the Fewest Squares | 55.2% | Hard |
| 1241 | Number of Comments per Post | 65.6% | Easy |
| 1242 | Web Crawler Multithreaded | 51.3% | Med. |
| 1243 | Array Transformation | 53.8% | Easy |
| 1244 | Design A Leaderboard | 68.1% | Med. |
| 1245 | Tree Diameter | 61.3% | Med. |
| 1246 | Palindrome Removal | 46.2% | Hard |
| 1247 | Minimum Swaps to Make Strings Equal | 65.5% | Med. |
| 1248 | Count Number of Nice Subarrays | 75.5% | Med. |
| 1249 | Minimum Remove to Make Valid Parentheses | 71.5% | Med. |
| 1250 | Check If It Is a Good Array | 65.6% | Hard |
| 1251 | Average Selling Price | 37.6% | Easy |
| 1252 | Cells with Odd Values in a Matrix | 79.9% | Easy |
| 1253 | Reconstruct a 2-Row Binary Matrix | 49.1% | Med. |
| 1254 | Number of Closed Islands | 67.2% | Med. |
| 1255 | Maximum Score Words Formed by Letters | 81.5% | Hard |
| 1256 | Encode Number | 70.3% | Med. |
| 1257 | Smallest Common Region | 68.3% | Med. |
| 1258 | Synonymous Sentences | 57.5% | Med. |
| 1259 | Handshakes That Don't Cross | 61.5% | Hard |
| 1260 | Shift 2D Grid | 74.4% | Easy |
| 1261 | Find Elements in a Contaminated Binary Tree | 84.1% | Med. |
| 1262 | Greatest Sum Divisible by Three | 57.0% | Med. |
| 1263 | Minimum Moves to Move a Box to Their Target Location | 49.9% | Hard |
| 1264 | Page Recommendations | 65.5% | Med. |
| 1265 | Print Immutable Linked List in Reverse | 94.1% | Med. |
| 1266 | Minimum Time Visiting All Points | 84.8% | Easy |
| 1267 | Count Servers that Communicate | 73.6% | Med. |
| 1268 | Search Suggestions System | 65.2% | Med. |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | 50.2% | Hard |
| 1270 | All People Report to the Given Manager | 83.9% | Med. |
| 1271 | Hexspeak | 58.4% | Easy |
| 1272 | Remove Interval | 67.3% | Med. |
| 1273 | Delete Tree Nodes | 61.6% | Med. |
| 1274 | Number of Ships in a Rectangle | 68.8% | Hard |
| 1275 | Find Winner on a Tic Tac Toe Game | 54.6% | Easy |
| 1276 | Number of Burgers with No Waste of Ingredients | 51.1% | Med. |
| 1277 | Count Square Submatrices with All Ones | 80.8% | Med. |
| 1278 | Palindrome Partitioning III | 62.2% | Hard |
| 1279 | Traffic Light Controlled Intersection | 73.1% | Easy |
| 1280 | Students and Examinations | 61.6% | Easy |
| 1281 | Subtract the Product and Sum of Digits of an Integer | 86.6% | Easy |
| 1282 | Group the People Given the Group Size They Belong To | 87.5% | Med. |
| 1283 | Find the Smallest Divisor Given a Threshold | 66.4% | Med. |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | 72.9% | Hard |
| 1285 | Find the Start and End Number of Continuous Ranges | 81.9% | Med. |
| 1286 | Iterator for Combination | 72.7% | Med. |
| 1287 | Element Appearing More Than 25% In Sorted Array | 61.3% | Easy |
| 1288 | Remove Covered Intervals | 60.1% | Med. |
| 1289 | Minimum Falling Path Sum II | 63.0% | Hard |
| 1290 | Convert Binary Number in a Linked List to Integer | 82.4% | Easy |
| 1291 | Sequential Digits | 68.6% | Med. |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 65.4% | Med. |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | 46.6% | Hard |
| 1294 | Weather Type in Each Country | 67.1% | Easy |
| 1295 | Find Numbers with Even Number of Digits | 79.9% | Easy |
| 1296 | Divide Array in Sets of K Consecutive Numbers | 59.4% | Med. |
| 1297 | Maximum Number of Occurrences of a Substring | 54.7% | Med. |
| 1298 | Maximum Candies You Can Get from Boxes | 67.2% | Hard |
| 1299 | Replace Elements with Greatest Element on Right Side | 72.4% | Easy |
| 1300 | Sum of Mutated Array Closest to Target | 46.5% | Med. |
| 1301 | Number of Paths with Max Score | 63.9% | Hard |
| 1302 | Deepest Leaves Sum | 86.6% | Med. |
| 1303 | Find the Team Size | 89.5% | Easy |
| 1304 | Find N Unique Integers Sum up to Zero | 78.4% | Easy |
| 1305 | All Elements in Two Binary Search Trees | 80.3% | Med. |
| 1306 | Jump Game III | 70.4% | Med. |
| 1307 | Verbal Arithmetic Puzzle | 33.4% | Hard |
| 1308 | Running Total for Different Genders | 86.1% | Med. |
| 1309 | Decrypt String from Alphabet to Integer Mapping | 80.6% | Easy |
| 1310 | XOR Queries of a Subarray | 78.0% | Med. |
| 1311 | Get Watched Videos by Your Friends | 53.6% | Med. |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | 74.3% | Hard |
| 1313 | Decompress Run-Length Encoded List | 86.3% | Easy |
| 1314 | Matrix Block Sum | 76.8% | Med. |
| 1315 | Sum of Nodes with Even-Valued Grandparent | 86.0% | Med. |
| 1316 | Distinct Echo Substrings | 53.4% | Hard |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | 59.2% | Easy |
| 1318 | Minimum Flips to Make a OR b Equal to c | 72.0% | Med. |
| 1319 | Number of Operations to Make Network Connected | 67.0% | Med. |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | 72.3% | Hard |
| 1321 | Restaurant Growth | 59.3% | Med. |
| 1322 | Ads Performance | 58.4% | Easy |
| 1323 | Maximum 69 Number | 84.6% | Easy |
| 1324 | Print Words Vertically | 67.9% | Med. |
| 1325 | Delete Leaves With a Given Value | 77.2% | Med. |
| 1326 | Minimum Number of Taps to Open to Water a Garden | 51.0% | Hard |
| 1327 | List the Products Ordered in a Period | 71.9% | Easy |
| 1328 | Break a Palindrome | 51.6% | Med. |
| 1329 | Sort the Matrix Diagonally | 83.2% | Med. |
| 1330 | Reverse Subarray To Maximize Array Value | 44.3% | Hard |
| 1331 | Rank Transform of an Array | 73.9% | Easy |
| 1332 | Remove Palindromic Subsequences | 77.2% | Easy |
| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | 64.4% | Med. |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 73.4% | Med. |
| 1335 | Minimum Difficulty of a Job Schedule | 59.8% | Hard |
| 1336 | Number of Transactions per Visit | 47.8% | Hard |
| 1337 | The K Weakest Rows in a Matrix | 74.4% | Easy |
| 1338 | Reduce Array Size to The Half | 69.4% | Med. |
| 1339 | Maximum Product of Splitted Binary Tree | 55.8% | Med. |
| 1340 | Jump Game V | 75.8% | Hard |
| 1341 | Movie Rating | 44.0% | Med. |
| 1342 | Number of Steps to Reduce a Number to Zero | 85.9% | Easy |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | 73.6% | Med. |
| 1344 | Angle Between Hands of a Clock | 69.7% | Med. |
| 1345 | Jump Game IV | 51.0% | Hard |
| 1346 | Check If N and Its Double Exist | 41.9% | Easy |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | 82.6% | Med. |
| 1348 | Tweet Counts Per Frequency | 46.4% | Med. |
| 1349 | Maximum Students Taking Exam | 54.1% | Hard |
| 1350 | Students With Invalid Departments | 89.7% | Easy |
| 1351 | Count Negative Numbers in a Sorted Matrix | 79.7% | Easy |
| 1352 | Product of the Last K Numbers | 63.0% | Med. |
| 1353 | Maximum Number of Events That Can Be Attended | 39.0% | Med. |
| 1354 | Construct Target Array With Multiple Sums | 37.1% | Hard |
| 1355 | Activity Participants | 72.0% | Med. |
| 1356 | Sort Integers by The Number of 1 Bits | 82.4% | Easy |
| 1357 | Apply Discount Every n Orders | 65.8% | Med. |
| 1358 | Number of Substrings Containing All Three Characters | 74.4% | Med. |
| 1359 | Count All Valid Pickup and Delivery Options | 64.9% | Hard |
| 1360 | Number of Days Between Two Dates | 53.0% | Easy |
| 1361 | Validate Binary Tree Nodes | 44.2% | Med. |
| 1362 | Closest Divisors | 62.4% | Med. |
| 1363 | Largest Multiple of Three | 33.4% | Hard |
| 1364 | Number of Trusted Contacts of a Customer | 74.7% | Med. |
| 1365 | How Many Numbers Are Smaller Than the Current Number | 87.5% | Easy |
| 1366 | Rank Teams by Votes | 60.0% | Med. |
| 1367 | Linked List in Binary Tree | 52.0% | Med. |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | 71.1% | Hard |
| 1369 | Get the Second Most Recent Activity | 67.3% | Hard |
| 1370 | Increasing Decreasing String | 77.3% | Easy |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | 75.6% | Med. |
| 1372 | Longest ZigZag Path in a Binary Tree | 67.3% | Med. |
| 1373 | Maximum Sum BST in Binary Tree | 48.4% | Hard |
| 1374 | Generate a String With Characters That Have Odd Counts | 78.6% | Easy |
| 1375 | Number of Times Binary String Is Prefix-Aligned | 66.1% | Med. |
| 1376 | Time Needed to Inform All Employees | 60.6% | Med. |
| 1377 | Frog Position After T Seconds | 38.7% | Hard |
| 1378 | Replace Employee ID With The Unique Identifier | 83.7% | Easy |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | 85.8% | Easy |
| 1380 | Lucky Numbers in a Matrix | 80.1% | Easy |
| 1381 | Design a Stack With Increment Operation | 79.9% | Med. |
| 1382 | Balance a Binary Search Tree | 86.3% | Med. |
| 1383 | Maximum Performance of a Team | 48.0% | Hard |
| 1384 | Total Sales Amount by Year | 61.2% | Hard |
| 1385 | Find the Distance Value Between Two Arrays | 72.1% | Easy |
| 1386 | Cinema Seat Allocation | 44.8% | Med. |
| 1387 | Sort Integers by The Power Value | 71.7% | Med. |
| 1388 | Pizza With 3n Slices | 54.1% | Hard |
| 1389 | Create Target Array in the Given Order | 86.6% | Easy |
| 1390 | Four Divisors | 56.5% | Med. |
| 1391 | Check if There is a Valid Path in a Grid | 64.5% | Med. |
| 1392 | Longest Happy Prefix | 53.6% | Hard |
| 1393 | Capital Gain/Loss | 84.4% | Med. |
| 1394 | Find Lucky Integer in an Array | 75.6% | Easy |
| 1395 | Count Number of Teams | 70.2% | Med. |
| 1396 | Design Underground System | 74.6% | Med. |
| 1397 | Find All Good Strings | 45.8% | Hard |
| 1398 | Customers Who Bought Products A and B but Not C | 71.5% | Med. |
| 1399 | Count Largest Group | 74.7% | Easy |
| 1400 | Construct K Palindrome Strings | 68.5% | Med. |
| 1401 | Circle and Rectangle Overlapping | 50.3% | Med. |
| 1402 | Reducing Dishes | 76.8% | Hard |
| 1403 | Minimum Subsequence in Non-Increasing Order | 74.0% | Easy |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | 63.8% | Med. |
| 1405 | Longest Happy String | 65.5% | Med. |
| 1406 | Stone Game III | 63.3% | Hard |
| 1407 | Top Travellers | 57.5% | Easy |
| 1408 | String Matching in an Array | 69.8% | Easy |
| 1409 | Queries on a Permutation With Key | 84.9% | Med. |
| 1410 | HTML Entity Parser | 50.0% | Med. |
| 1411 | Number of Ways to Paint N × 3 Grid | 80.5% | Hard |
| 1412 | Find the Quiet Students in All Exams | 58.0% | Hard |
| 1413 | Minimum Value to Get Positive Step by Step Sum | 64.8% | Easy |
| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | 65.0% | Med. |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | 87.1% | Med. |
| 1416 | Restore The Array | 46.7% | Hard |
| 1417 | Reformat The String | 52.2% | Easy |
| 1418 | Display Table of Food Orders in a Restaurant | 76.4% | Med. |
| 1419 | Minimum Number of Frogs Croaking | 51.2% | Med. |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | 65.5% | Hard |
| 1421 | NPV Queries | 82.9% | Easy |
| 1422 | Maximum Score After Splitting a String | 65.1% | Easy |
| 1423 | Maximum Points You Can Obtain from Cards | 58.1% | Med. |
| 1424 | Diagonal Traverse II | 58.3% | Med. |
| 1425 | Constrained Subsequence Sum | 56.5% | Hard |
| 1426 | Counting Elements | 60.8% | Easy |
| 1427 | Perform String Shifts | 56.0% | Easy |
| 1428 | Leftmost Column with at Least a One | 55.3% | Med. |
| 1429 | First Unique Number | 57.8% | Med. |
| 1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | 47.5% | Med. |
| 1431 | Kids With the Greatest Number of Candies | 88.0% | Easy |
| 1432 | Max Difference You Can Get From Changing an Integer | 48.6% | Med. |
| 1433 | Check If a String Can Break Another String | 71.1% | Med. |
| 1434 | Number of Ways to Wear Different Hats to Each Other | 46.5% | Hard |
| 1435 | Create a Session Bar Chart | 74.3% | Easy |
| 1436 | Destination City | 79.5% | Easy |
| 1437 | Check If All 1's Are at Least Length K Places Away | 64.3% | Easy |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | 57.9% | Med. |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | 62.4% | Hard |
| 1440 | Evaluate Boolean Expression | 71.7% | Med. |
| 1441 | Build an Array With Stack Operations | 80.8% | Med. |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | 84.8% | Med. |
| 1443 | Minimum Time to Collect All Apples in a Tree | 63.8% | Med. |
| 1444 | Number of Ways of Cutting a Pizza | 61.6% | Hard |
| 1445 | Apples & Oranges | 86.0% | Med. |
| 1446 | Consecutive Characters | 60.4% | Easy |
| 1447 | Simplified Fractions | 70.0% | Med. |
| 1448 | Count Good Nodes in Binary Tree | 73.9% | Med. |
| 1449 | Form Largest Integer With Digits That Add up to Target | 49.8% | Hard |
| 1450 | Number of Students Doing Homework at a Given Time | 75.9% | Easy |
| 1451 | Rearrange Words in a Sentence | 67.2% | Med. |
| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | 60.7% | Med. |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | 41.2% | Hard |
| 1454 | Active Users | 36.6% | Med. |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | 68.8% | Easy |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | 62.4% | Med. |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | 68.4% | Med. |
| 1458 | Max Dot Product of Two Subsequences | 69.4% | Hard |
| 1459 | Rectangles Area | 68.8% | Med. |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | 75.8% | Easy |
| 1461 | Check If a String Contains All Binary Codes of Size K | 61.6% | Med. |
| 1462 | Course Schedule IV | 60.1% | Med. |
| 1463 | Cherry Pickup II | 72.6% | Hard |
| 1464 | Maximum Product of Two Elements in an Array | 83.6% | Easy |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 41.5% | Med. |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | 66.0% | Med. |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | 61.4% | Hard |
| 1468 | Calculate Salaries | 77.2% | Med. |
| 1469 | Find All The Lonely Nodes | 84.1% | Easy |
| 1470 | Shuffle the Array | 88.7% | Easy |
| 1471 | The k Strongest Values in an Array | 62.8% | Med. |
| 1472 | Design Browser History | 78.4% | Med. |
| 1473 | Paint House III | 61.2% | Hard |
| 1474 | Delete N Nodes After M Nodes of a Linked List | 74.4% | Easy |
| 1475 | Final Prices With a Special Discount in a Shop | 84.3% | Easy |
| 1476 | Subrectangle Queries | 86.4% | Med. |
| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | 36.9% | Med. |
| 1478 | Allocate Mailboxes | 56.8% | Hard |
| 1479 | Sales by Day of the Week | 76.2% | Hard |
| 1480 | Running Sum of 1d Array | 87.0% | Easy |
| 1481 | Least Number of Unique Integers after K Removals | 63.9% | Med. |
| 1482 | Minimum Number of Days to Make m Bouquets | 56.9% | Med. |
| 1483 | Kth Ancestor of a Tree Node | 39.2% | Hard |
| 1484 | Group Sold Products By The Date | 78.1% | Easy |
| 1485 | Clone Binary Tree With Random Pointer | 81.3% | Med. |
| 1486 | XOR Operation in an Array | 87.8% | Easy |
| 1487 | Making File Names Unique | 38.8% | Med. |
| 1488 | Avoid Flood in The City | 39.0% | Med. |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | 66.6% | Hard |
| 1490 | Clone N-ary Tree | 83.2% | Med. |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | 63.6% | Easy |
| 1492 | The kth Factor of n | 70.5% | Med. |
| 1493 | Longest Subarray of 1's After Deleting One Element | 71.4% | Med. |
| 1494 | Parallel Courses II | 31.2% | Hard |
| 1495 | Friendly Movies Streamed Last Month | 48.9% | Easy |
| 1496 | Path Crossing | 62.7% | Easy |
| 1497 | Check If Array Pairs Are Divisible by k | 46.2% | Med. |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | 49.1% | Med. |
| 1499 | Max Value of Equation | 45.1% | Hard |
| 1500 | Design a File Sharing System | 41.8% | Med. |
| 1501 | Countries You Can Safely Invest In | 50.8% | Med. |
| 1502 | Can Make Arithmetic Progression From Sequence | 68.7% | Easy |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | 68.1% | Med. |
| 1504 | Count Submatrices With All Ones | 71.0% | Med. |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | 41.6% | Hard |
| 1506 | Find Root of N-Ary Tree | 78.6% | Med. |
| 1507 | Reformat Date | 68.7% | Easy |
| 1508 | Range Sum of Sorted Subarray Sums | 63.0% | Med. |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | 59.2% | Med. |
| 1510 | Stone Game IV | 59.6% | Hard |
| 1511 | Customer Order Frequency | 66.4% | Easy |
| 1512 | Number of Good Pairs | 89.9% | Easy |
| 1513 | Number of Substrings With Only 1s | 57.4% | Med. |
| 1514 | Path with Maximum Probability | 65.7% | Med. |
| 1515 | Best Position for a Service Centre | 35.5% | Hard |
| 1516 | Move Sub-Tree of N-Ary Tree | 59.8% | Hard |
| 1517 | Find Users With Valid E-Mails | 35.5% | Easy |
| 1518 | Water Bottles | 72.6% | Easy |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | 55.5% | Med. |
| 1520 | Maximum Number of Non-Overlapping Substrings | 43.4% | Hard |
| 1521 | Find a Value of a Mysterious Function Closest to Target | 47.6% | Hard |
| 1522 | Diameter of N-Ary Tree | 75.5% | Med. |
| 1523 | Count Odd Numbers in an Interval Range | 54.6% | Easy |
| 1524 | Number of Sub-arrays With Odd Sum | 55.6% | Med. |
| 1525 | Number of Good Ways to Split a String | 68.5% | Med. |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | 78.2% | Hard |
| 1527 | Patients With a Condition | 39.1% | Easy |
| 1528 | Shuffle String | 85.4% | Easy |
| 1529 | Minimum Suffix Flips | 73.9% | Med. |
| 1530 | Number of Good Leaf Nodes Pairs | 71.7% | Med. |
| 1531 | String Compression II | 52.2% | Hard |
| 1532 | The Most Recent Three Orders | 69.2% | Med. |
| 1533 | Find the Index of the Large Integer | 56.6% | Med. |
| 1534 | Count Good Triplets | 85.5% | Easy |
| 1535 | Find the Winner of an Array Game | 56.8% | Med. |
| 1536 | Minimum Swaps to Arrange a Binary Grid | 70.2% | Med. |
| 1537 | Get the Maximum Score | 41.3% | Hard |
| 1538 | Guess the Majority in a Hidden Array | 69.0% | Med. |
| 1539 | Kth Missing Positive Number | 63.7% | Easy |
| 1540 | Can Convert String in K Moves | 37.8% | Med. |
| 1541 | Minimum Insertions to Balance a Parentheses String | 53.6% | Med. |
| 1542 | Find Longest Awesome Substring | 47.2% | Hard |
| 1543 | Fix Product Name Format | 58.8% | Easy |
| 1544 | Make The String Great | 68.6% | Easy |
| 1545 | Find Kth Bit in Nth Binary String | 73.7% | Med. |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | 49.1% | Med. |
| 1547 | Minimum Cost to Cut a Stick | 63.3% | Hard |
| 1548 | The Most Similar Path in a Graph | 59.5% | Hard |
| 1549 | The Most Recent Orders for Each Product | 65.0% | Med. |
| 1550 | Three Consecutive Odds | 69.3% | Easy |
| 1551 | Minimum Operations to Make Array Equal | 82.7% | Med. |
| 1552 | Magnetic Force Between Two Balls | 72.4% | Med. |
| 1553 | Minimum Number of Days to Eat N Oranges | 36.3% | Hard |
| 1554 | Strings Differ by One Character | 39.7% | Med. |
| 1555 | Bank Account Summary | 52.3% | Med. |
| 1556 | Thousand Separator | 53.8% | Easy |
| 1557 | Minimum Number of Vertices to Reach All Nodes | 81.7% | Med. |
| 1558 | Minimum Numbers of Function Calls to Make Target Array | 62.7% | Med. |
| 1559 | Detect Cycles in 2D Grid | 63.4% | Med. |
| 1560 | Most Visited Sector in a Circular Track | 59.9% | Easy |
| 1561 | Maximum Number of Coins You Can Get | 84.8% | Med. |
| 1562 | Find Latest Group of Size M | 43.9% | Med. |
| 1563 | Stone Game V | 42.1% | Hard |
| 1564 | Put Boxes Into the Warehouse I | 67.8% | Med. |
| 1565 | Unique Orders and Customers Per Month | 82.0% | Easy |
| 1566 | Detect Pattern of Length M Repeated K or More Times | 44.1% | Easy |
| 1567 | Maximum Length of Subarray With Positive Product | 44.7% | Med. |
| 1568 | Minimum Number of Days to Disconnect Island | 58.7% | Hard |
| 1569 | Number of Ways to Reorder Array to Get Same BST | 54.1% | Hard |
| 1570 | Dot Product of Two Sparse Vectors | 89.9% | Med. |
| 1571 | Warehouse Manager | 87.2% | Easy |
| 1572 | Matrix Diagonal Sum | 84.5% | Easy |
| 1573 | Number of Ways to Split a String | 34.7% | Med. |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | 51.3% | Med. |
| 1575 | Count All Possible Routes | 64.8% | Hard |
| 1576 | Replace All ?'s to Avoid Consecutive Repeating Characters | 45.3% | Easy |
| 1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | 43.7% | Med. |
| 1578 | Minimum Time to Make Rope Colorful | 65.2% | Med. |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | 70.1% | Hard |
| 1580 | Put Boxes Into the Warehouse II | 66.4% | Med. |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | 68.1% | Easy |
| 1582 | Special Positions in a Binary Matrix | 72.7% | Easy |
| 1583 | Count Unhappy Friends | 62.6% | Med. |
| 1584 | Min Cost to Connect All Points | 71.4% | Med. |
| 1585 | Check If String Is Transformable With Substring Sort Operations | 51.5% | Hard |
| 1586 | Binary Search Tree Iterator II | 63.5% | Med. |
| 1587 | Bank Account Summary II | 82.9% | Easy |
| 1588 | Sum of All Odd Length Subarrays | 84.1% | Easy |
| 1589 | Maximum Sum Obtained of Any Permutation | 41.2% | Med. |
| 1590 | Make Sum Divisible by P | 42.6% | Med. |
| 1591 | Strange Printer II | 60.9% | Hard |
| 1592 | Rearrange Spaces Between Words | 44.3% | Easy |
| 1593 | Split a String Into the Max Number of Unique Substrings | 68.7% | Med. |
| 1594 | Maximum Non Negative Product in a Matrix | 51.6% | Med. |
| 1595 | Minimum Cost to Connect Two Groups of Points | 50.3% | Hard |
| 1596 | The Most Frequently Ordered Products for Each Customer | 77.7% | Med. |
| 1597 | Build Binary Expression Tree From Infix Expression | 62.9% | Hard |
| 1598 | Crawler Log Folder | 71.7% | Easy |
| 1599 | Maximum Profit of Operating a Centennial Wheel | 44.6% | Med. |
| 1600 | Throne Inheritance | 67.7% | Med. |
| 1601 | Maximum Number of Achievable Transfer Requests | 64.7% | Hard |
| 1602 | Find Nearest Right Node in Binary Tree | 75.1% | Med. |
| 1603 | Design Parking System | 87.2% | Easy |
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | 46.3% | Med. |
| 1605 | Find Valid Matrix Given Row and Column Sums | 82.6% | Med. |
| 1606 | Find Servers That Handled Most Number of Requests | 45.6% | Hard |
| 1607 | Sellers With No Sales | 54.3% | Easy |
| 1608 | Special Array With X Elements Greater Than or Equal X | 66.9% | Easy |
| 1609 | Even Odd Tree | 67.2% | Med. |
| 1610 | Maximum Number of Visible Points | 38.3% | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | 78.2% | Hard |
| 1612 | Check If Two Expression Trees are Equivalent | 71.8% | Med. |
| 1613 | Find the Missing IDs | 72.9% | Med. |
| 1614 | Maximum Nesting Depth of the Parentheses | 85.0% | Easy |
| 1615 | Maximal Network Rank | 66.1% | Med. |
| 1616 | Split Two Strings to Make Palindrome | 32.5% | Med. |
| 1617 | Count Subtrees With Max Distance Between Cities | 67.4% | Hard |
| 1618 | Maximum Font to Fit a Sentence in a Screen | 62.0% | Med. |
| 1619 | Mean of Array After Removing Some Elements | 72.0% | Easy |
| 1620 | Coordinate With Maximum Network Quality | 39.8% | Med. |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | 46.1% | Med. |
| 1622 | Fancy Sequence | 41.5% | Hard |
| 1623 | All Valid Triplets That Can Represent a Country | 80.8% | Easy |
| 1624 | Largest Substring Between Two Equal Characters | 68.3% | Easy |
| 1625 | Lexicographically Smallest String After Applying Operations | 79.3% | Med. |
| 1626 | Best Team With No Conflicts | 50.8% | Med. |
| 1627 | Graph Connectivity With Threshold | 49.7% | Hard |
| 1628 | Design an Expression Tree With Evaluate Function | 82.6% | Med. |
| 1629 | Slowest Key | 59.7% | Easy |
| 1630 | Arithmetic Subarrays | 83.7% | Med. |
| 1631 | Path With Minimum Effort | 63.7% | Med. |
| 1632 | Rank Transform of a Matrix | 42.5% | Hard |
| 1633 | Percentage of Users Attended a Contest | 60.8% | Easy |
| 1634 | Add Two Polynomials Represented as Linked Lists | 61.1% | Med. |
| 1635 | Hopper Company Queries I | 47.9% | Hard |
| 1636 | Sort Array by Increasing Frequency | 80.9% | Easy |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | 87.1% | Easy |
| 1638 | Count Substrings That Differ by One Character | 72.3% | Med. |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | 56.4% | Hard |
| 1640 | Check Array Formation Through Concatenation | 57.4% | Easy |
| 1641 | Count Sorted Vowel Strings | 79.4% | Med. |
| 1642 | Furthest Building You Can Reach | 51.0% | Med. |
| 1643 | Kth Smallest Instructions | 44.8% | Hard |
| 1644 | Lowest Common Ancestor of a Binary Tree II | 69.7% | Med. |
| 1645 | Hopper Company Queries II | 40.0% | Hard |
| 1646 | Get Maximum in Generated Array | 51.6% | Easy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | 61.5% | Med. |
| 1648 | Sell Diminishing-Valued Colored Balls | 30.3% | Med. |
| 1649 | Create Sorted Array through Instructions | 42.1% | Hard |
| 1650 | Lowest Common Ancestor of a Binary Tree III | 83.0% | Med. |
| 1651 | Hopper Company Queries III | 65.2% | Hard |
| 1652 | Defuse the Bomb | 79.4% | Easy |
| 1653 | Minimum Deletions to Make String Balanced | 68.2% | Med. |
| 1654 | Minimum Jumps to Reach Home | 30.9% | Med. |
| 1655 | Distribute Repeating Integers | 40.9% | Hard |
| 1656 | Design an Ordered Stream | 82.7% | Easy |
| 1657 | Determine if Two Strings Are Close | 54.4% | Med. |
| 1658 | Minimum Operations to Reduce X to Zero | 40.7% | Med. |
| 1659 | Maximize Grid Happiness | 41.3% | Hard |
| 1660 | Correct a Binary Tree | 74.3% | Med. |
| 1661 | Average Time of Process per Machine | 66.9% | Easy |
| 1662 | Check If Two String Arrays are Equivalent | 86.2% | Easy |
| 1663 | Smallest String With A Given Numeric Value | 67.5% | Med. |
| 1664 | Ways to Make a Fair Array | 67.3% | Med. |
| 1665 | Minimum Initial Energy to Finish Tasks | 76.5% | Hard |
| 1666 | Change the Root of a Binary Tree | 75.0% | Med. |
| 1667 | Fix Names in a Table | 60.6% | Easy |
| 1668 | Maximum Repeating Substring | 42.0% | Easy |
| 1669 | Merge In Between Linked Lists | 83.1% | Med. |
| 1670 | Design Front Middle Back Queue | 58.3% | Med. |
| 1671 | Minimum Number of Removals to Make Mountain Array | 54.8% | Hard |
| 1672 | Richest Customer Wealth | 88.8% | Easy |
| 1673 | Find the Most Competitive Subsequence | 53.3% | Med. |
| 1674 | Minimum Moves to Make Array Complementary | 64.8% | Med. |
| 1675 | Minimize Deviation in Array | 54.0% | Hard |
| 1676 | Lowest Common Ancestor of a Binary Tree IV | 79.7% | Med. |
| 1677 | Product's Worth Over Invoices | 38.6% | Easy |
| 1678 | Goal Parser Interpretation | 88.1% | Easy |
| 1679 | Max Number of K-Sum Pairs | 57.2% | Med. |
| 1680 | Concatenation of Consecutive Binary Numbers | 66.7% | Med. |
| 1681 | Minimum Incompatibility | 41.5% | Hard |
| 1682 | Longest Palindromic Subsequence II | 50.3% | Med. |
| 1683 | Invalid Tweets | 85.2% | Easy |
| 1684 | Count the Number of Consistent Strings | 88.5% | Easy |
| 1685 | Sum of Absolute Differences in a Sorted Array | 68.4% | Med. |
| 1686 | Stone Game VI | 60.9% | Med. |
| 1687 | Delivering Boxes from Storage to Ports | 39.9% | Hard |
| 1688 | Count of Matches in Tournament | 86.5% | Easy |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | 90.5% | Med. |
| 1690 | Stone Game VII | 58.8% | Med. |
| 1691 | Maximum Height by Stacking Cuboids | 62.3% | Hard |
| 1692 | Count Ways to Distribute Candies | 64.0% | Hard |
| 1693 | Daily Leads and Partners | 86.8% | Easy |
| 1694 | Reformat Phone Number | 67.7% | Easy |
| 1695 | Maximum Erasure Value | 64.4% | Med. |
| 1696 | Jump Game VI | 46.5% | Med. |
| 1697 | Checking Existence of Edge Length Limited Paths | 63.5% | Hard |
| 1698 | Number of Distinct Substrings in a String | 64.7% | Med. |
| 1699 | Number of Calls Between Two Persons | 80.8% | Med. |
| 1700 | Number of Students Unable to Eat Lunch | 79.8% | Easy |
| 1701 | Average Waiting Time | 73.1% | Med. |
| 1702 | Maximum Binary String After Change | 47.8% | Med. |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | 42.4% | Hard |
| 1704 | Determine if String Halves Are Alike | 78.8% | Easy |
| 1705 | Maximum Number of Eaten Apples | 43.8% | Med. |
| 1706 | Where Will the Ball Fall | 72.3% | Med. |
| 1707 | Maximum XOR With an Element From Array | 59.0% | Hard |
| 1708 | Largest Subarray Length K | 65.9% | Easy |
| 1709 | Biggest Window Between Visits | 69.7% | Med. |
| 1710 | Maximum Units on a Truck | 75.1% | Easy |
| 1711 | Count Good Meals | 33.0% | Med. |
| 1712 | Ways to Split Array Into Three Subarrays | 34.5% | Med. |
| 1713 | Minimum Operations to Make a Subsequence | 49.9% | Hard |
| 1714 | Sum Of Special Evenly-Spaced Elements In Array | 50.0% | Hard |
| 1715 | Count Apples and Oranges | 75.7% | Med. |
| 1716 | Calculate Money in Leetcode Bank | 82.4% | Easy |
| 1717 | Maximum Score From Removing Substrings | 66.4% | Med. |
| 1718 | Construct the Lexicographically Largest Valid Sequence | 72.6% | Med. |
| 1719 | Number Of Ways To Reconstruct A Tree | 46.0% | Hard |
| 1720 | Decode XORed Array | 87.4% | Easy |
| 1721 | Swapping Nodes in a Linked List | 69.6% | Med. |
| 1722 | Minimize Hamming Distance After Swap Operations | 69.6% | Med. |
| 1723 | Find Minimum Time to Finish All Jobs | 46.0% | Hard |
| 1724 | Checking Existence of Edge Length Limited Paths II | 51.7% | Hard |
| 1725 | Number Of Rectangles That Can Form The Largest Square | 79.5% | Easy |
| 1726 | Tuple with Same Product | 70.1% | Med. |
| 1727 | Largest Submatrix With Rearrangements | 80.2% | Med. |
| 1728 | Cat and Mouse II | 40.1% | Hard |
| 1729 | Find Followers Count | 69.6% | Easy |
| 1730 | Shortest Path to Get Food | 57.3% | Med. |
| 1731 | The Number of Employees Which Report to Each Employee | 53.6% | Easy |
| 1732 | Find the Highest Altitude | 84.6% | Easy |
| 1733 | Minimum Number of People to Teach | 67.2% | Med. |
| 1734 | Decode XORed Permutation | 67.1% | Med. |
| 1735 | Count Ways to Make Array With Product | 55.2% | Hard |
| 1736 | Latest Time by Replacing Hidden Digits | 43.9% | Easy |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | 38.1% | Med. |
| 1738 | Find Kth Largest XOR Coordinate Value | 64.4% | Med. |
| 1739 | Building Boxes | 52.4% | Hard |
| 1740 | Find Distance in a Binary Tree | 74.4% | Med. |
| 1741 | Find Total Time Spent by Each Employee | 86.4% | Easy |
| 1742 | Maximum Number of Balls in a Box | 74.9% | Easy |
| 1743 | Restore the Array From Adjacent Pairs | 75.1% | Med. |
| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | 36.3% | Med. |
| 1745 | Palindrome Partitioning IV | 45.5% | Hard |
| 1746 | Maximum Subarray Sum After One Operation | 65.2% | Med. |
| 1747 | Leetflex Banned Accounts | 61.7% | Med. |
| 1748 | Sum of Unique Elements | 80.1% | Easy |
| 1749 | Maximum Absolute Sum of Any Subarray | 70.8% | Med. |
| 1750 | Minimum Length of String After Deleting Similar Ends | 56.1% | Med. |
| 1751 | Maximum Number of Events That Can Be Attended II | 63.4% | Hard |
| 1752 | Check if Array Is Sorted and Rotated | 57.5% | Easy |
| 1753 | Maximum Score From Removing Stones | 68.6% | Med. |
| 1754 | Largest Merge Of Two Strings | 54.3% | Med. |
| 1755 | Closest Subsequence Sum | 44.2% | Hard |
| 1756 | Design Most Recently Used Queue | 78.3% | Med. |
| 1757 | Recyclable and Low Fat Products | 88.6% | Easy |
| 1758 | Minimum Changes To Make Alternating Binary String | 67.9% | Easy |
| 1759 | Count Number of Homogenous Substrings | 57.4% | Med. |
| 1760 | Minimum Limit of Balls in a Bag | 66.1% | Med. |
| 1761 | Minimum Degree of a Connected Trio in a Graph | 44.6% | Hard |
| 1762 | Buildings With an Ocean View | 80.9% | Med. |
| 1763 | Longest Nice Substring | 64.6% | Easy |
| 1764 | Form Array by Concatenating Subarrays of Another Array | 54.9% | Med. |
| 1765 | Map of Highest Peak | 76.1% | Med. |
| 1766 | Tree of Coprimes | 44.5% | Hard |
| 1767 | Find the Subtasks That Did Not Execute | 78.4% | Hard |
| 1768 | Merge Strings Alternately | 82.1% | Easy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | 90.1% | Med. |
| 1770 | Maximum Score from Performing Multiplication Operations | 43.5% | Hard |
| 1771 | Maximize Palindrome Length From Subsequences | 38.6% | Hard |
| 1772 | Sort Features by Popularity | 66.7% | Med. |
| 1773 | Count Items Matching a Rule | 85.4% | Easy |
| 1774 | Closest Dessert Cost | 48.9% | Med. |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | 54.7% | Med. |
| 1776 | Car Fleet II | 58.2% | Hard |
| 1777 | Product's Price for Each Store | 82.0% | Easy |
| 1778 | Shortest Path in a Hidden Grid | 44.7% | Med. |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | 70.0% | Easy |
| 1780 | Check if Number is a Sum of Powers of Three | 79.4% | Med. |
| 1781 | Sum of Beauty of All Substrings | 74.5% | Med. |
| 1782 | Count Pairs Of Nodes | 43.0% | Hard |
| 1783 | Grand Slam Titles | 83.0% | Med. |
| 1784 | Check if Binary String Has at Most One Segment of Ones | 49.2% | Easy |
| 1785 | Minimum Elements to Add to Form a Given Sum | 45.3% | Med. |
| 1786 | Number of Restricted Paths From First to Last Node | 41.6% | Med. |
| 1787 | Make the XOR of All Segments Equal to Zero | 40.8% | Hard |
| 1788 | Maximize the Beauty of the Garden | 65.0% | Hard |
| 1789 | Primary Department for Each Employee | 74.9% | Easy |
| 1790 | Check if One String Swap Can Make Strings Equal | 49.5% | Easy |
| 1791 | Find Center of Star Graph | 86.6% | Easy |
| 1792 | Maximum Average Pass Ratio | 74.1% | Med. |
| 1793 | Maximum Score of a Good Subarray | 64.2% | Hard |
| 1794 | Count Pairs of Equal Substrings With Minimum Difference | 64.1% | Med. |
| 1795 | Rearrange Products Table | 85.5% | Easy |
| 1796 | Second Largest Digit in a String | 54.9% | Easy |
| 1797 | Design Authentication Manager | 58.6% | Med. |
| 1798 | Maximum Number of Consecutive Values You Can Make | 64.2% | Med. |
| 1799 | Maximize Score After N Operations | 57.9% | Hard |
| 1800 | Maximum Ascending Subarray Sum | 66.3% | Easy |
| 1801 | Number of Orders in the Backlog | 54.1% | Med. |
| 1802 | Maximum Value at a Given Index in a Bounded Array | 38.8% | Med. |
| 1803 | Count Pairs With XOR in a Range | 46.5% | Hard |
| 1804 | Implement Trie II (Prefix Tree) | 63.6% | Med. |
| 1805 | Number of Different Integers in a String | 40.5% | Easy |
| 1806 | Minimum Number of Operations to Reinitialize a Permutation | 72.6% | Med. |
| 1807 | Evaluate the Bracket Pairs of a String | 69.7% | Med. |
| 1808 | Maximize Number of Nice Divisors | 36.7% | Hard |
| 1809 | Ad-Free Sessions | 59.0% | Easy |
| 1810 | Minimum Path Cost in a Hidden Grid | 59.1% | Med. |
| 1811 | Find Interview Candidates | 60.7% | Med. |
| 1812 | Determine Color of a Chessboard Square | 80.0% | Easy |
| 1813 | Sentence Similarity III | 48.4% | Med. |
| 1814 | Count Nice Pairs in an Array | 48.4% | Med. |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | 41.4% | Hard |
| 1816 | Truncate Sentence | 87.0% | Easy |
| 1817 | Finding the Users Active Minutes | 80.9% | Med. |
| 1818 | Minimum Absolute Sum Difference | 32.7% | Med. |
| 1819 | Number of Different Subsequences GCDs | 46.6% | Hard |
| 1820 | Maximum Number of Accepted Invitations | 52.7% | Med. |
| 1821 | Find Customers With Positive Revenue this Year | 87.7% | Easy |
| 1822 | Sign of the Product of an Array | 64.7% | Easy |
| 1823 | Find the Winner of the Circular Game | 82.3% | Med. |
| 1824 | Minimum Sideway Jumps | 51.9% | Med. |
| 1825 | Finding MK Average | 38.8% | Hard |
| 1826 | Faulty Sensor | 50.5% | Easy |
| 1827 | Minimum Operations to Make the Array Increasing | 82.2% | Easy |
| 1828 | Queries on Number of Points Inside a Circle | 86.8% | Med. |
| 1829 | Maximum XOR for Each Query | 84.6% | Med. |
| 1830 | Minimum Number of Operations to Make String Sorted | 50.3% | Hard |
| 1831 | Maximum Transaction Each Day | 82.5% | Med. |
| 1832 | Check if the Sentence Is Pangram | 84.3% | Easy |
| 1833 | Maximum Ice Cream Bars | 77.2% | Med. |
| 1834 | Single-Threaded CPU | 47.9% | Med. |
| 1835 | Find XOR Sum of All Pairs Bitwise AND | 62.7% | Hard |
| 1836 | Remove Duplicates From an Unsorted Linked List | 75.7% | Med. |
| 1837 | Sum of Digits in Base K | 78.8% | Easy |
| 1838 | Frequency of the Most Frequent Element | 45.1% | Med. |
| 1839 | Longest Substring Of All Vowels in Order | 52.1% | Med. |
| 1840 | Maximum Building Height | 67.0% | Hard |
| 1841 | League Statistics | 53.4% | Med. |
| 1842 | Next Palindrome Using Same Digits | 54.4% | Hard |
| 1843 | Suspicious Bank Accounts | 44.0% | Med. |
| 1844 | Replace All Digits with Characters | 82.9% | Easy |
| 1845 | Seat Reservation Manager | 67.3% | Med. |
| 1846 | Maximum Element After Decreasing and Rearranging | 69.2% | Med. |
| 1847 | Closest Room | 41.6% | Hard |
| 1848 | Minimum Distance to the Target Element | 64.4% | Easy |
| 1849 | Splitting a String Into Descending Consecutive Values | 37.7% | Med. |
| 1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | 71.7% | Med. |
| 1851 | Minimum Interval to Include Each Query | 54.8% | Hard |
| 1852 | Distinct Numbers in Each Subarray | 77.4% | Med. |
| 1853 | Convert Date Format | 84.8% | Easy |
| 1854 | Maximum Population Year | 64.4% | Easy |
| 1855 | Maximum Distance Between a Pair of Values | 61.2% | Med. |
| 1856 | Maximum Subarray Min-Product | 40.7% | Med. |
| 1857 | Largest Color Value in a Directed Graph | 57.2% | Hard |
| 1858 | Longest Word With All Prefixes | 72.2% | Med. |
| 1859 | Sorting the Sentence | 84.2% | Easy |
| 1860 | Incremental Memory Leak | 72.8% | Med. |
| 1861 | Rotating the Box | 82.5% | Med. |
| 1862 | Sum of Floored Pairs | 31.2% | Hard |
| 1863 | Sum of All Subset XOR Totals | 90.1% | Easy |
| 1864 | Minimum Number of Swaps to Make the Binary String Alternating | 44.0% | Med. |
| 1865 | Finding Pairs With a Certain Sum | 61.6% | Med. |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | 62.1% | Hard |
| 1867 | Orders With Maximum Quantity Above Average | 70.6% | Med. |
| 1868 | Product of Two Run-Length Encoded Arrays | 59.6% | Med. |
| 1869 | Longer Contiguous Segments of Ones than Zeros | 62.6% | Easy |
| 1870 | Minimum Speed to Arrive on Time | 48.0% | Med. |
| 1871 | Jump Game VII | 35.6% | Med. |
| 1872 | Stone Game VIII | 54.1% | Hard |
| 1873 | Calculate Special Bonus | 57.1% | Easy |
| 1874 | Minimize Product Sum of Two Arrays | 89.9% | Med. |
| 1875 | Group Employees of the Same Salary | 65.2% | Med. |
| 1876 | Substrings of Size Three with Distinct Characters | 76.9% | Easy |
| 1877 | Minimize Maximum Pair Sum in Array | 83.3% | Med. |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | 71.3% | Med. |
| 1879 | Minimum XOR Sum of Two Arrays | 51.6% | Hard |
| 1880 | Check if Word Equals Summation of Two Words | 75.3% | Easy |
| 1881 | Maximum Value after Insertion | 39.5% | Med. |
| 1882 | Process Tasks Using Servers | 42.0% | Med. |
| 1883 | Minimum Skips to Arrive at Meeting On Time | 38.8% | Hard |
| 1884 | Egg Drop With 2 Eggs and N Floors | 74.6% | Med. |
| 1885 | Count Pairs in Two Arrays | 60.4% | Med. |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | 68.4% | Easy |
| 1887 | Reduction Operations to Make the Array Elements Equal | 72.6% | Med. |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | 53.6% | Med. |
| 1889 | Minimum Space Wasted From Packaging | 33.7% | Hard |
| 1890 | The Latest Login in 2020 | 77.0% | Easy |
| 1891 | Cutting Ribbons | 53.1% | Med. |
| 1892 | Page Recommendations II | 45.9% | Hard |
| 1893 | Check if All the Integers in a Range Are Covered | 51.2% | Easy |
| 1894 | Find the Student that Will Replace the Chalk | 53.2% | Med. |
| 1895 | Largest Magic Square | 75.2% | Med. |
| 1896 | Minimum Cost to Change the Final Value of Expression | 49.7% | Hard |
| 1897 | Redistribute Characters to Make All Strings Equal | 66.9% | Easy |
| 1898 | Maximum Number of Removable Characters | 47.5% | Med. |
| 1899 | Merge Triplets to Form Target Triplet | 69.2% | Med. |
| 1900 | The Earliest and Latest Rounds Where Players Compete | 72.1% | Hard |
| 1901 | Find a Peak Element II | 55.4% | Med. |
| 1902 | Depth of BST Given Insertion Order | 42.8% | Med. |
| 1903 | Largest Odd Number in String | 67.8% | Easy |
| 1904 | The Number of Full Rounds You Have Played | 43.4% | Med. |
| 1905 | Count Sub Islands | 73.1% | Med. |
| 1906 | Minimum Absolute Difference Queries | 45.9% | Med. |
| 1907 | Count Salary Categories | 64.9% | Med. |
| 1908 | Game of Nim | 62.8% | Med. |
| 1909 | Remove One Element to Make the Array Strictly Increasing | 30.0% | Easy |
| 1910 | Remove All Occurrences of a Substring | 78.6% | Med. |
| 1911 | Maximum Alternating Subsequence Sum | 59.2% | Med. |
| 1912 | Design Movie Rental System | 62.2% | Hard |
| 1913 | Maximum Product Difference Between Two Pairs | 83.1% | Easy |
| 1914 | Cyclically Rotating a Grid | 74.0% | Med. |
| 1915 | Number of Wonderful Substrings | 66.6% | Med. |
| 1916 | Count Ways to Build Rooms in an Ant Colony | 51.8% | Hard |
| 1917 | Leetcodify Friends Recommendations | 28.9% | Hard |
| 1918 | Kth Smallest Subarray Sum | 53.5% | Med. |
| 1919 | Leetcodify Similar Friends | 43.4% | Hard |
| 1920 | Build Array from Permutation | 91.1% | Easy |
| 1921 | Eliminate Maximum Number of Monsters | 51.2% | Med. |
| 1922 | Count Good Numbers | 57.9% | Med. |
| 1923 | Longest Common Subpath | 30.0% | Hard |
| 1924 | Erect the Fence II | 51.5% | Hard |
| 1925 | Count Square Sum Triples | 77.2% | Easy |
| 1926 | Nearest Exit from Entrance in Maze | 48.9% | Med. |
| 1927 | Sum Game | 49.4% | Med. |
| 1928 | Minimum Cost to Reach Destination in Time | 42.0% | Hard |
| 1929 | Concatenation of Array | 90.1% | Easy |
| 1930 | Unique Length-3 Palindromic Subsequences | 73.8% | Med. |
| 1931 | Painting a Grid With Three Different Colors | 77.0% | Hard |
| 1932 | Merge BSTs to Create Single BST | 39.6% | Hard |
| 1933 | Check if String Is Decomposable Into Value-Equal Substrings | 51.0% | Easy |
| 1934 | Confirmation Rate | 62.4% | Med. |
| 1935 | Maximum Number of Words You Can Type | 82.9% | Easy |
| 1936 | Add Minimum Number of Rungs | 44.1% | Med. |
| 1937 | Maximum Number of Points with Cost | 41.6% | Med. |
| 1938 | Maximum Genetic Difference Query | 47.6% | Hard |
| 1939 | Users That Actively Request Confirmation Messages | 56.7% | Easy |
| 1940 | Longest Common Subsequence Between Sorted Arrays | 81.3% | Med. |
| 1941 | Check if All Characters Have Equal Number of Occurrences | 79.6% | Easy |
| 1942 | The Number of the Smallest Unoccupied Chair | 60.3% | Med. |
| 1943 | Describe the Painting | 52.8% | Med. |
| 1944 | Number of Visible People in a Queue | 73.3% | Hard |
| 1945 | Sum of Digits of String After Convert | 74.8% | Easy |
| 1946 | Largest Number After Mutating Substring | 38.2% | Med. |
| 1947 | Maximum Compatibility Score Sum | 64.7% | Med. |
| 1948 | Delete Duplicate Folders in System | 77.2% | Hard |
| 1949 | Strong Friendship | 54.7% | Med. |
| 1950 | Maximum of Minimum Values in All Subarrays | 48.2% | Med. |
| 1951 | All the Pairs With the Maximum Number of Common Followers | 69.7% | Med. |
| 1952 | Three Divisors | 64.6% | Easy |
| 1953 | Maximum Number of Weeks for Which You Can Work | 42.6% | Med. |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | 55.6% | Med. |
| 1955 | Count Number of Special Subsequences | 53.0% | Hard |
| 1956 | Minimum Time For K Virus Variants to Spread | 50.6% | Hard |
| 1957 | Delete Characters to Make Fancy String | 74.0% | Easy |
| 1958 | Check if Move is Legal | 50.0% | Med. |
| 1959 | Minimum Total Space Wasted With K Resizing Operations | 44.1% | Med. |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | 31.3% | Hard |
| 1961 | Check If String Is a Prefix of Array | 52.9% | Easy |
| 1962 | Remove Stones to Minimize the Total | 66.0% | Med. |
| 1963 | Minimum Number of Swaps to Make the String Balanced | 78.0% | Med. |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | 62.5% | Hard |
| 1965 | Employees With Missing Information | 73.4% | Easy |
| 1966 | Binary Searchable Numbers in an Unsorted Array | 63.8% | Med. |
| 1967 | Number of Strings That Appear as Substrings in Word | 86.2% | Easy |
| 1968 | Array With Elements Not Equal to Average of Neighbors | 50.8% | Med. |
| 1969 | Minimum Non-Zero Product of the Array Elements | 37.6% | Med. |
| 1970 | Last Day Where You Can Still Cross | 68.7% | Hard |
| 1971 | Find if Path Exists in Graph | 55.6% | Easy |
| 1972 | First and Last Call On the Same Day | 51.0% | Hard |
| 1973 | Count Nodes Equal to Sum of Descendants | 77.3% | Med. |
| 1974 | Minimum Time to Type Word Using Special Typewriter | 78.8% | Easy |
| 1975 | Maximum Matrix Sum | 67.5% | Med. |
| 1976 | Number of Ways to Arrive at Destination | 37.6% | Med. |
| 1977 | Number of Ways to Separate Numbers | 21.7% | Hard |
| 1978 | Employees Whose Manager Left the Company | 48.8% | Easy |
| 1979 | Find Greatest Common Divisor of Array | 83.5% | Easy |
| 1980 | Find Unique Binary String | 81.2% | Med. |
| 1981 | Minimize the Difference Between Target and Chosen Elements | 37.1% | Med. |
| 1982 | Find Array Given Subset Sums | 49.4% | Hard |
| 1983 | Widest Pair of Indices With Equal Range Sum | 54.1% | Med. |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | 66.3% | Easy |
| 1985 | Find the Kth Largest Integer in the Array | 48.1% | Med. |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | 35.1% | Med. |
| 1987 | Number of Unique Good Subsequences | 52.5% | Hard |
| 1988 | Find Cutoff Score for Each School | 67.0% | Med. |
| 1989 | Maximum Number of People That Can Be Caught in Tag | 49.7% | Med. |
| 1990 | Count the Number of Experiments | 48.9% | Med. |
| 1991 | Find the Middle Index in Array | 70.1% | Easy |
| 1992 | Find All Groups of Farmland | 75.5% | Med. |
| 1993 | Operations on Tree | 45.6% | Med. |
| 1994 | The Number of Good Subsets | 37.5% | Hard |
| 1995 | Count Special Quadruplets | 64.8% | Easy |
| 1996 | The Number of Weak Characters in the Game | 44.6% | Med. |
| 1997 | First Day Where You Have Been in All the Rooms | 40.3% | Med. |
| 1998 | GCD Sort of an Array | 50.4% | Hard |
| 1999 | Smallest Greater Multiple Made of Two Digits | 48.0% | Med. |
| 2000 | Reverse Prefix of Word | 86.5% | Easy |
Problems 2001–3000
| S.No | Problem | Acceptance | Level |
|---|---|---|---|
| 2001 | Number of Pairs of Interchangeable Rectangles | 52.7% | Med. |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | 62.6% | Med. |
| 2003 | Smallest Missing Genetic Value in Each Subtree | 48.1% | Hard |
| 2004 | The Number of Seniors and Juniors to Join the Company | 46.4% | Hard |
| 2005 | Subtree Removal Game with Fibonacci Tree | 57.9% | Hard |
| 2006 | Count Number of Pairs With Absolute Difference K | 85.4% | Easy |
| 2007 | Find Original Array From Doubled Array | 40.9% | Med. |
| 2008 | Maximum Earnings From Taxi | 46.7% | Med. |
| 2009 | Minimum Number of Operations to Make Array Continuous | 51.8% | Hard |
| 2010 | The Number of Seniors and Juniors to Join the Company II | 66.1% | Hard |
| 2011 | Final Value of Variable After Performing Operations | 90.6% | Easy |
| 2012 | Sum of Beauty in the Array | 51.8% | Med. |
| 2013 | Detect Squares | 52.8% | Med. |
| 2014 | Longest Subsequence Repeated k Times | 70.9% | Hard |
| 2015 | Average Height of Buildings in Each Segment | 58.8% | Med. |
| 2016 | Maximum Difference Between Increasing Elements | 66.6% | Easy |
| 2017 | Grid Game | 60.8% | Med. |
| 2018 | Check if Word Can Be Placed In Crossword | 50.8% | Med. |
| 2019 | The Score of Students Solving Math Expression | 34.3% | Hard |
| 2020 | Number of Accounts That Did Not Stream | 71.9% | Med. |
| 2021 | Brightest Position on Street | 60.7% | Med. |
| 2022 | Convert 1D Array Into 2D Array | 72.4% | Easy |
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | 75.4% | Med. |
| 2024 | Maximize the Confusion of an Exam | 70.3% | Med. |
| 2025 | Maximum Number of Ways to Partition an Array | 35.8% | Hard |
| 2026 | Low-Quality Problems | 84.0% | Easy |
| 2027 | Minimum Moves to Convert String | 58.2% | Easy |
| 2028 | Find Missing Observations | 57.4% | Med. |
| 2029 | Stone Game IX | 30.5% | Med. |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | 39.8% | Hard |
| 2031 | Count Subarrays With More Ones Than Zeros | 49.7% | Med. |
| 2032 | Two Out of Three | 77.7% | Easy |
| 2033 | Minimum Operations to Make a Uni-Value Grid | 70.7% | Med. |
| 2034 | Stock Price Fluctuation | 49.2% | Med. |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | 24.0% | Hard |
| 2036 | Maximum Alternating Subarray Sum | 40.0% | Med. |
| 2037 | Minimum Number of Moves to Seat Everyone | 87.1% | Easy |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | 63.1% | Med. |
| 2039 | The Time When the Network Becomes Idle | 55.9% | Med. |
| 2040 | Kth Smallest Product of Two Sorted Arrays | 48.7% | Hard |
| 2041 | Accepted Candidates From the Interviews | 78.4% | Med. |
| 2042 | Check if Numbers Are Ascending in a Sentence | 73.5% | Easy |
| 2043 | Simple Bank System | 69.6% | Med. |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | 89.5% | Med. |
| 2045 | Second Minimum Time to Reach Destination | 62.3% | Hard |
| 2046 | Sort Linked List Already Sorted Using Absolute Values | 67.1% | Med. |
| 2047 | Number of Valid Words in a Sentence | 31.3% | Easy |
| 2048 | Next Greater Numerically Balanced Number | 63.0% | Med. |
| 2049 | Count Nodes With the Highest Score | 52.7% | Med. |
| 2050 | Parallel Courses III | 66.8% | Hard |
| 2051 | The Category of Each Member in the Store | 70.2% | Med. |
| 2052 | Minimum Cost to Separate Sentence Into Rows | 51.3% | Med. |
| 2053 | Kth Distinct String in an Array | 82.2% | Easy |
| 2054 | Two Best Non-Overlapping Events | 64.0% | Med. |
| 2055 | Plates Between Candles | 47.6% | Med. |
| 2056 | Number of Valid Move Combinations On Chessboard | 48.1% | Hard |
| 2057 | Smallest Index With Equal Value | 73.4% | Easy |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | 69.4% | Med. |
| 2059 | Minimum Operations to Convert Number | 52.1% | Med. |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | 43.3% | Hard |
| 2061 | Number of Spaces Cleaning Robot Cleaned | 64.6% | Med. |
| 2062 | Count Vowel Substrings of a String | 73.3% | Easy |
| 2063 | Vowels of All Substrings | 55.6% | Med. |
| 2064 | Minimized Maximum of Products Distributed to Any Store | 63.2% | Med. |
| 2065 | Maximum Path Quality of a Graph | 62.6% | Hard |
| 2066 | Account Balance | 81.6% | Med. |
| 2067 | Number of Equal Count Substrings | 45.6% | Med. |
| 2068 | Check Whether Two Strings are Almost Equivalent | 64.3% | Easy |
| 2069 | Walking Robot Simulation II | 43.1% | Med. |
| 2070 | Most Beautiful Item for Each Query | 62.0% | Med. |
| 2071 | Maximum Number of Tasks You Can Assign | 50.0% | Hard |
| 2072 | The Winner University | 75.5% | Easy |
| 2073 | Time Needed to Buy Tickets | 73.0% | Easy |
| 2074 | Reverse Nodes in Even Length Groups | 64.7% | Med. |
| 2075 | Decode the Slanted Ciphertext | 67.6% | Med. |
| 2076 | Process Restricted Friend Requests | 61.2% | Hard |
| 2077 | Paths in Maze That Lead to Same Room | 56.8% | Med. |
| 2078 | Two Furthest Houses With Different Colors | 71.7% | Easy |
| 2079 | Watering Plants | 80.0% | Med. |
| 2080 | Range Frequency Queries | 43.8% | Med. |
| 2081 | Sum of k-Mirror Numbers | 63.5% | Hard |
| 2082 | The Number of Rich Customers | 77.3% | Easy |
| 2083 | Substrings That Begin and End With the Same Letter | 74.5% | Med. |
| 2084 | Drop Type 1 Orders for Customers With Type 0 Orders | 86.6% | Med. |
| 2085 | Count Common Words With One Occurrence | 73.6% | Easy |
| 2086 | Minimum Number of Food Buckets to Feed the Hamsters | 48.4% | Med. |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | 51.8% | Med. |
| 2088 | Count Fertile Pyramids in a Land | 66.5% | Hard |
| 2089 | Find Target Indices After Sorting Array | 78.2% | Easy |
| 2090 | K Radius Subarray Averages | 46.4% | Med. |
| 2091 | Removing Minimum and Maximum From Array | 56.7% | Med. |
| 2092 | Find All People With Secret | 48.4% | Hard |
| 2093 | Minimum Cost to Reach City With Discounts | 61.1% | Med. |
| 2094 | Finding 3-Digit Even Numbers | 78.6% | Easy |
| 2095 | Delete the Middle Node of a Linked List | 60.9% | Med. |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | 56.4% | Med. |
| 2097 | Valid Arrangement of Pairs | 66.7% | Hard |
| 2098 | Subsequence of Size K With the Largest Even Sum | 35.6% | Med. |
| 2099 | Find Subsequence of Length K With the Largest Sum | 57.3% | Easy |
| 2100 | Find Good Days to Rob the Bank | 51.9% | Med. |
| 2101 | Detonate the Maximum Bombs | 50.3% | Med. |
| 2102 | Sequentially Ordinal Rank Tracker | 61.3% | Hard |
| 2103 | Rings and Rods | 81.5% | Easy |
| 2104 | Sum of Subarray Ranges | 61.6% | Med. |
| 2105 | Watering Plants II | 48.9% | Med. |
| 2106 | Maximum Fruits Harvested After at Most K Steps | 61.0% | Hard |
| 2107 | Number of Unique Flavors After Sharing K Candies | 62.3% | Med. |
| 2108 | Find First Palindromic String in the Array | 84.0% | Easy |
| 2109 | Adding Spaces to a String | 71.8% | Med. |
| 2110 | Number of Smooth Descent Periods of a Stock | 67.7% | Med. |
| 2111 | Minimum Operations to Make the Array K-Increasing | 40.7% | Hard |
| 2112 | The Airport With the Most Traffic | 71.7% | Med. |
| 2113 | Elements in Array After Removing and Replacing Elements | 70.3% | Med. |
| 2114 | Maximum Number of Words Found in Sentences | 86.7% | Easy |
| 2115 | Find All Possible Recipes from Given Supplies | 57.0% | Med. |
| 2116 | Check if a Parentheses String Can Be Valid | 45.2% | Med. |
| 2117 | Abbreviating the Product of a Range | 24.5% | Hard |
| 2118 | Build the Equation | 57.2% | Hard |
| 2119 | A Number After a Double Reversal | 82.4% | Easy |
| 2120 | Execution of All Suffix Instructions Staying in a Grid | 82.1% | Med. |
| 2121 | Intervals Between Identical Elements | 48.1% | Med. |
| 2122 | Recover the Original Array | 41.7% | Hard |
| 2123 | Minimum Operations to Remove Adjacent Ones in Matrix | 43.6% | Hard |
| 2124 | Check if All A's Appears Before All B's | 73.3% | Easy |
| 2125 | Number of Laser Beams in a Bank | 87.0% | Med. |
| 2126 | Destroying Asteroids | 59.8% | Med. |
| 2127 | Maximum Employees to Be Invited to a Meeting | 61.8% | Hard |
| 2128 | Remove All Ones With Row and Column Flips | 76.2% | Med. |
| 2129 | Capitalize the Title | 68.3% | Easy |
| 2130 | Maximum Twin Sum of a Linked List | 83.2% | Med. |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | 53.5% | Med. |
| 2132 | Stamping the Grid | 35.5% | Hard |
| 2133 | Check if Every Row and Column Contains All Numbers | 54.3% | Easy |
| 2134 | Minimum Swaps to Group All 1's Together II | 65.7% | Med. |
| 2135 | Count Words Obtained After Adding a Letter | 44.1% | Med. |
| 2136 | Earliest Possible Day of Full Bloom | 71.1% | Hard |
| 2137 | Pour Water Between Buckets to Make Water Levels Equal | 68.8% | Med. |
| 2138 | Divide a String Into Groups of Size k | 76.9% | Easy |
| 2139 | Minimum Moves to Reach Target Score | 52.6% | Med. |
| 2140 | Solving Questions With Brainpower | 60.2% | Med. |
| 2141 | Maximum Running Time of N Computers | 56.4% | Hard |
| 2142 | The Number of Passengers in Each Bus I | 49.1% | Med. |
| 2143 | Choose Numbers From Two Arrays in Range | 53.0% | Hard |
| 2144 | Minimum Cost of Buying Candies With Discount | 71.6% | Easy |
| 2145 | Count the Hidden Sequences | 56.7% | Med. |
| 2146 | K Highest Ranked Items Within a Price Range | 47.0% | Med. |
| 2147 | Number of Ways to Divide a Long Corridor | 54.5% | Hard |
| 2148 | Count Elements With Strictly Smaller and Greater Elements | 60.1% | Easy |
| 2149 | Rearrange Array Elements by Sign | 84.8% | Med. |
| 2150 | Find All Lonely Numbers in the Array | 63.7% | Med. |
| 2151 | Maximum Good People Based on Statements | 52.6% | Hard |
| 2152 | Minimum Number of Lines to Cover Points | 44.2% | Med. |
| 2153 | The Number of Passengers in Each Bus II | 40.4% | Hard |
| 2154 | Keep Multiplying Found Values by Two | 75.0% | Easy |
| 2155 | All Divisions With the Highest Score of a Binary Array | 65.7% | Med. |
| 2156 | Find Substring With Given Hash Value | 26.6% | Hard |
| 2157 | Groups of Strings | 28.1% | Hard |
| 2158 | Amount of New Area Painted Each Day | 55.7% | Hard |
| 2159 | Order Two Columns Independently | 61.8% | Med. |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | 86.3% | Easy |
| 2161 | Partition Array According to Given Pivot | 90.8% | Med. |
| 2162 | Minimum Cost to Set Cooking Time | 41.7% | Med. |
| 2163 | Minimum Difference in Sums After Removal of Elements | 69.6% | Hard |
| 2164 | Sort Even and Odd Indices Independently | 63.4% | Easy |
| 2165 | Smallest Value of the Rearranged Number | 53.5% | Med. |
| 2166 | Design Bitset | 32.8% | Med. |
| 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | 42.0% | Hard |
| 2168 | Unique Substrings With Equal Digit Frequency | 64.6% | Med. |
| 2169 | Count Operations to Obtain Zero | 79.8% | Easy |
| 2170 | Minimum Operations to Make the Array Alternating | 35.8% | Med. |
| 2171 | Removing Minimum Number of Magic Beans | 44.8% | Med. |
| 2172 | Maximum AND Sum of Array | 50.9% | Hard |
| 2173 | Longest Winning Streak | 54.4% | Hard |
| 2174 | Remove All Ones With Row and Column Flips II | 67.4% | Med. |
| 2175 | The Change in Global Rankings | 60.8% | Med. |
| 2176 | Count Equal and Divisible Pairs in an Array | 83.8% | Easy |
| 2177 | Find Three Consecutive Integers That Sum to a Given Number | 65.2% | Med. |
| 2178 | Maximum Split of Positive Even Integers | 59.9% | Med. |
| 2179 | Count Good Triplets in an Array | 65.2% | Hard |
| 2180 | Count Integers With Even Digit Sum | 70.7% | Easy |
| 2181 | Merge Nodes in Between Zeros | 89.7% | Med. |
| 2182 | Construct String With Repeat Limit | 70.8% | Med. |
| 2183 | Count Array Pairs Divisible by K | 31.0% | Hard |
| 2184 | Number of Ways to Build Sturdy Brick Wall | 49.5% | Med. |
| 2185 | Counting Words With a Given Prefix | 84.4% | Easy |
| 2186 | Minimum Number of Steps to Make Two Strings Anagram II | 73.1% | Med. |
| 2187 | Minimum Time to Complete Trips | 39.9% | Med. |
| 2188 | Minimum Time to Finish the Race | 43.5% | Hard |
| 2189 | Number of Ways to Build House of Cards | 62.9% | Med. |
| 2190 | Most Frequent Number Following Key In an Array | 59.6% | Easy |
| 2191 | Sort the Jumbled Numbers | 60.0% | Med. |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | 62.3% | Med. |
| 2193 | Minimum Number of Moves to Make Palindrome | 53.0% | Hard |
| 2194 | Cells in a Range on an Excel Sheet | 84.1% | Easy |
| 2195 | Append K Integers With Minimal Sum | 27.2% | Med. |
| 2196 | Create Binary Tree From Descriptions | 83.9% | Med. |
| 2197 | Replace Non-Coprime Numbers in Array | 57.6% | Hard |
| 2198 | Number of Single Divisor Triplets | 55.0% | Med. |
| 2199 | Finding the Topic of Each Post | 50.5% | Hard |
| 2200 | Find All K-Distant Indices in an Array | 77.2% | Easy |
| 2201 | Count Artifacts That Can Be Extracted | 57.3% | Med. |
| 2202 | Maximize the Topmost Element After K Moves | 24.1% | Med. |
| 2203 | Minimum Weighted Subgraph With the Required Paths | 42.9% | Hard |
| 2204 | Distance to a Cycle in Undirected Graph | 73.8% | Hard |
| 2205 | The Number of Users That Are Eligible for Discount | 50.6% | Easy |
| 2206 | Divide Array Into Equal Pairs | 79.2% | Easy |
| 2207 | Maximize Number of Subsequences in a String | 36.2% | Med. |
| 2208 | Minimum Operations to Halve Array Sum | 50.3% | Med. |
| 2209 | Minimum White Tiles After Covering With Carpets | 39.1% | Hard |
| 2210 | Count Hills and Valleys in an Array | 68.8% | Easy |
| 2211 | Count Collisions on a Road | 58.1% | Med. |
| 2212 | Maximum Points in an Archery Competition | 52.1% | Med. |
| 2213 | Longest Substring of One Repeating Character | 34.8% | Hard |
| 2214 | Minimum Health to Beat Game | 58.9% | Med. |
| 2215 | Find the Difference of Two Arrays | 81.5% | Easy |
| 2216 | Minimum Deletions to Make Array Beautiful | 50.2% | Med. |
| 2217 | Find Palindrome With Fixed Length | 38.1% | Med. |
| 2218 | Maximum Value of K Coins From Piles | 60.5% | Hard |
| 2219 | Maximum Sum Score of Array | 62.9% | Med. |
| 2220 | Minimum Bit Flips to Convert Number | 87.9% | Easy |
| 2221 | Find Triangular Sum of an Array | 81.9% | Med. |
| 2222 | Number of Ways to Select Buildings | 50.9% | Med. |
| 2223 | Sum of Scores of Built Strings | 49.9% | Hard |
| 2224 | Minimum Number of Operations to Convert Time | 66.4% | Easy |
| 2225 | Find Players With Zero or One Losses | 72.4% | Med. |
| 2226 | Maximum Candies Allocated to K Children | 49.9% | Med. |
| 2227 | Encrypt and Decrypt Strings | 38.6% | Hard |
| 2228 | Users With Two Purchases Within Seven Days | 47.0% | Med. |
| 2229 | Check if an Array Is Consecutive | 62.2% | Easy |
| 2230 | The Users That Are Eligible for Discount | 50.9% | Easy |
| 2231 | Largest Number After Digit Swaps by Parity | 65.5% | Easy |
| 2232 | Minimize Result by Adding Parentheses to Expression | 68.2% | Med. |
| 2233 | Maximum Product After K Increments | 44.1% | Med. |
| 2234 | Maximum Total Beauty of the Gardens | 30.2% | Hard |
| 2235 | Add Two Integers | 88.0% | Easy |
| 2236 | Root Equals Sum of Children | 85.1% | Easy |
| 2237 | Count Positions on Street With Required Brightness | 63.2% | Med. |
| 2238 | Number of Times a Driver Was a Passenger | 71.7% | Med. |
| 2239 | Find Closest Number to Zero | 48.1% | Easy |
| 2240 | Number of Ways to Buy Pens and Pencils | 57.0% | Med. |
| 2241 | Design an ATM Machine | 45.4% | Med. |
| 2242 | Maximum Score of a Node Sequence | 40.3% | Hard |
| 2243 | Calculate Digit Sum of a String | 67.9% | Easy |
| 2244 | Minimum Rounds to Complete All Tasks | 63.4% | Med. |
| 2245 | Maximum Trailing Zeros in a Cornered Path | 37.9% | Med. |
| 2246 | Longest Path With Different Adjacent Characters | 54.0% | Hard |
| 2247 | Maximum Cost of Trip With K Highways | 50.6% | Hard |
| 2248 | Intersection of Multiple Arrays | 68.7% | Easy |
| 2249 | Count Lattice Points Inside a Circle | 56.9% | Med. |
| 2250 | Count Number of Rectangles Containing Each Point | 37.8% | Med. |
| 2251 | Number of Flowers in Full Bloom | 58.1% | Hard |
| 2252 | Dynamic Pivoting of a Table | 57.4% | Hard |
| 2253 | Dynamic Unpivoting of a Table | 69.4% | Hard |
| 2254 | Design Video Sharing Platform | 64.3% | Hard |
| 2255 | Count Prefixes of a Given String | 74.3% | Easy |
| 2256 | Minimum Average Difference | 44.0% | Med. |
| 2257 | Count Unguarded Cells in the Grid | 68.9% | Med. |
| 2258 | Escape the Spreading Fire | 38.8% | Hard |
| 2259 | Remove Digit From Number to Maximize Result | 48.7% | Easy |
| 2260 | Minimum Consecutive Cards to Pick Up | 53.9% | Med. |
| 2261 | K Divisible Elements Subarrays | 55.1% | Med. |
| 2262 | Total Appeal of A String | 56.6% | Hard |
| 2263 | Make Array Non-decreasing or Non-increasing | 65.5% | Hard |
| 2264 | Largest 3-Same-Digit Number in String | 72.7% | Easy |
| 2265 | Count Nodes Equal to Average of Subtree | 86.8% | Med. |
| 2266 | Count Number of Texts | 50.4% | Med. |
| 2267 | Check if There Is a Valid Parentheses String Path | 40.5% | Hard |
| 2268 | Minimum Number of Keypresses | 71.5% | Med. |
| 2269 | Find the K-Beauty of a Number | 63.6% | Easy |
| 2270 | Number of Ways to Split Array | 55.8% | Med. |
| 2271 | Maximum White Tiles Covered by a Carpet | 36.2% | Med. |
| 2272 | Substring With Largest Variance | 46.0% | Hard |
| 2273 | Find Resultant Array After Removing Anagrams | 69.9% | Easy |
| 2274 | Maximum Consecutive Floors Without Special Floors | 52.7% | Med. |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | 80.7% | Med. |
| 2276 | Count Integers in Intervals | 36.1% | Hard |
| 2277 | Closest Node to Path in Tree | 62.5% | Hard |
| 2278 | Percentage of Letter in String | 75.3% | Easy |
| 2279 | Maximum Bags With Full Capacity of Rocks | 68.2% | Med. |
| 2280 | Minimum Lines to Represent a Line Chart | 27.2% | Med. |
| 2281 | Sum of Total Strength of Wizards | 29.7% | Hard |
| 2282 | Number of People That Can Be Seen in a Grid | 47.4% | Med. |
| 2283 | Check if Number Has Equal Digit Count and Digit Value | 73.2% | Easy |
| 2284 | Sender With Largest Word Count | 60.0% | Med. |
| 2285 | Maximum Total Importance of Roads | 69.1% | Med. |
| 2286 | Booking Concert Tickets in Groups | 19.9% | Hard |
| 2287 | Rearrange Characters to Make Target String | 63.1% | Easy |
| 2288 | Apply Discount to Prices | 34.4% | Med. |
| 2289 | Steps to Make Array Non-decreasing | 25.1% | Med. |
| 2290 | Minimum Obstacle Removal to Reach Corner | 70.9% | Hard |
| 2291 | Maximum Profit From Trading Stocks | 48.3% | Med. |
| 2292 | Products With Three or More Orders in Two Consecutive Years | 40.8% | Med. |
| 2293 | Min Max Game | 64.4% | Easy |
| 2294 | Partition Array Such That Maximum Difference Is K | 81.8% | Med. |
| 2295 | Replace Elements in an Array | 59.9% | Med. |
| 2296 | Design a Text Editor | 51.2% | Hard |
| 2297 | Jump Game VIII | 45.9% | Med. |
| 2298 | Tasks Count in the Weekend | 81.7% | Med. |
| 2299 | Strong Password Checker II | 55.6% | Easy |
| 2300 | Successful Pairs of Spells and Potions | 49.7% | Med. |
| 2301 | Match Substring After Replacement | 43.5% | Hard |
| 2302 | Count Subarrays With Score Less Than K | 62.2% | Hard |
| 2303 | Calculate Amount Paid in Taxes | 69.4% | Easy |
| 2304 | Minimum Path Cost in a Grid | 68.3% | Med. |
| 2305 | Fair Distribution of Cookies | 70.0% | Med. |
| 2306 | Naming a Company | 46.5% | Hard |
| 2307 | Check for Contradictions in Equations | 44.0% | Hard |
| 2308 | Arrange Table by Gender | 70.9% | Med. |
| 2309 | Greatest English Letter in Upper and Lower Case | 72.7% | Easy |
| 2310 | Sum of Numbers With Units Digit K | 28.4% | Med. |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | 52.7% | Med. |
| 2312 | Selling Pieces of Wood | 53.1% | Hard |
| 2313 | Minimum Flips in Binary Tree to Get Result | 57.0% | Hard |
| 2314 | The First Day of the Maximum Recorded Degree in Each City | 73.5% | Med. |
| 2315 | Count Asterisks | 83.5% | Easy |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | 50.1% | Med. |
| 2317 | Maximum XOR After Operations | 79.8% | Med. |
| 2318 | Number of Distinct Roll Sequences | 58.2% | Hard |
| 2319 | Check if Matrix Is X-Matrix | 66.9% | Easy |
| 2320 | Count Number of Ways to Place Houses | 44.1% | Med. |
| 2321 | Maximum Score Of Spliced Array | 58.8% | Hard |
| 2322 | Minimum Score After Removals on a Tree | 76.0% | Hard |
| 2323 | Find Minimum Time to Finish All Jobs II | 66.1% | Med. |
| 2324 | Product Sales Analysis IV | 75.9% | Med. |
| 2325 | Decode the Message | 85.9% | Easy |
| 2326 | Spiral Matrix IV | 82.3% | Med. |
| 2327 | Number of People Aware of a Secret | 60.6% | Med. |
| 2328 | Number of Increasing Paths in a Grid | 57.3% | Hard |
| 2329 | Product Sales Analysis V | 70.9% | Easy |
| 2330 | Valid Palindrome IV | 75.7% | Med. |
| 2331 | Evaluate Boolean Binary Tree | 82.4% | Easy |
| 2332 | The Latest Time to Catch a Bus | 30.1% | Med. |
| 2333 | Minimum Sum of Squared Difference | 27.0% | Med. |
| 2334 | Subarray With Elements Greater Than Varying Threshold | 45.8% | Hard |
| 2335 | Minimum Amount of Time to Fill Cups | 60.4% | Easy |
| 2336 | Smallest Number in Infinite Set | 70.6% | Med. |
| 2337 | Move Pieces to Obtain a String | 56.6% | Med. |
| 2338 | Count the Number of Ideal Arrays | 56.9% | Hard |
| 2339 | All the Matches of the League | 88.4% | Easy |
| 2340 | Minimum Adjacent Swaps to Make a Valid Array | 72.3% | Med. |
| 2341 | Maximum Number of Pairs in Array | 76.2% | Easy |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | 65.9% | Med. |
| 2343 | Query Kth Smallest Trimmed Number | 47.9% | Med. |
| 2344 | Minimum Deletions to Make Array Divisible | 61.6% | Hard |
| 2345 | Finding the Number of Visible Mountains | 37.5% | Med. |
| 2346 | Compute the Rank as a Percentage | 33.9% | Med. |
| 2347 | Best Poker Hand | 61.9% | Easy |
| 2348 | Number of Zero-Filled Subarrays | 70.1% | Med. |
| 2349 | Design a Number Container System | 57.1% | Med. |
| 2350 | Shortest Impossible Sequence of Rolls | 69.1% | Hard |
| 2351 | First Letter to Appear Twice | 75.1% | Easy |
| 2352 | Equal Row and Column Pairs | 71.1% | Med. |
| 2353 | Design a Food Rating System | 52.9% | Med. |
| 2354 | Number of Excellent Pairs | 49.3% | Hard |
| 2355 | Maximum Number of Books You Can Take | 39.5% | Hard |
| 2356 | Number of Unique Subjects Taught by Each Teacher | 89.2% | Easy |
| 2357 | Make Array Zero by Subtracting Equal Amounts | 73.9% | Easy |
| 2358 | Maximum Number of Groups Entering a Competition | 68.6% | Med. |
| 2359 | Find Closest Node to Given Two Nodes | 53.0% | Med. |
| 2360 | Longest Cycle in a Graph | 51.0% | Hard |
| 2361 | Minimum Costs Using the Train Line | 78.0% | Hard |
| 2362 | Generate the Invoice | 76.2% | Hard |
| 2363 | Merge Similar Items | 77.6% | Easy |
| 2364 | Count Number of Bad Pairs | 54.1% | Med. |
| 2365 | Task Scheduler II | 54.9% | Med. |
| 2366 | Minimum Replacements to Sort the Array | 53.1% | Hard |
| 2367 | Number of Arithmetic Triplets | 85.6% | Easy |
| 2368 | Reachable Nodes With Restrictions | 60.6% | Med. |
| 2369 | Check if There is a Valid Partition For The Array | 52.5% | Med. |
| 2370 | Longest Ideal Subsequence | 46.6% | Med. |
| 2371 | Minimize Maximum Value in a Grid | 70.0% | Hard |
| 2372 | Calculate the Influence of Each Salesperson | 70.1% | Med. |
| 2373 | Largest Local Values in a Matrix | 84.9% | Easy |
| 2374 | Node With Highest Edge Score | 47.8% | Med. |
| 2375 | Construct Smallest Number From DI String | 76.5% | Med. |
| 2376 | Count Special Integers | 39.6% | Hard |
| 2377 | Sort the Olympic Table | 82.0% | Easy |
| 2378 | Choose Edges to Maximize Score in a Tree | 45.5% | Hard |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | 60.4% | Easy |
| 2380 | Time Needed to Rearrange a Binary String | 52.6% | Med. |
| 2381 | Shifting Letters II | 42.7% | Med. |
| 2382 | Maximum Segment Sum After Removals | 49.4% | Hard |
| 2383 | Minimum Hours of Training to Win a Competition | 42.1% | Easy |
| 2384 | Largest Palindromic Number | 35.7% | Med. |
| 2385 | Amount of Time for Binary Tree to Be Infected | 64.5% | Med. |
| 2386 | Find the K-Sum of an Array | 39.3% | Hard |
| 2387 | Median of a Row Wise Sorted Matrix | 70.0% | Med. |
| 2388 | Change Null Values in a Table to the Previous Value | 54.0% | Med. |
| 2389 | Longest Subsequence With Limited Sum | 72.9% | Easy |
| 2390 | Removing Stars From a String | 78.9% | Med. |
| 2391 | Minimum Amount of Time to Collect Garbage | 85.1% | Med. |
| 2392 | Build a Matrix With Conditions | 79.5% | Hard |
| 2393 | Count Strictly Increasing Subarrays | 71.5% | Med. |
| 2394 | Employees With Deductions | 47.4% | Med. |
| 2395 | Find Subarrays With Equal Sum | 76.4% | Easy |
| 2396 | Strictly Palindromic Number | 88.6% | Med. |
| 2397 | Maximum Rows Covered by Columns | 58.0% | Med. |
| 2398 | Maximum Number of Robots Within Budget | 37.0% | Hard |
| 2399 | Check Distances Between Same Letters | 71.7% | Easy |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | 36.0% | Med. |
| 2401 | Longest Nice Subarray | 63.6% | Med. |
| 2402 | Meeting Rooms III | 49.0% | Hard |
| 2403 | Minimum Time to Kill All Monsters | 56.9% | Hard |
| 2404 | Most Frequent Even Element | 51.5% | Easy |
| 2405 | Optimal Partition of String | 78.5% | Med. |
| 2406 | Divide Intervals Into Minimum Number of Groups | 63.7% | Med. |
| 2407 | Longest Increasing Subsequence II | 25.2% | Hard |
| 2408 | Design SQL | 71.6% | Med. |
| 2409 | Count Days Spent Together | 48.5% | Easy |
| 2410 | Maximum Matching of Players With Trainers | 69.4% | Med. |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | 53.7% | Med. |
| 2412 | Minimum Money Required Before Transactions | 41.8% | Hard |
| 2413 | Smallest Even Multiple | 87.6% | Easy |
| 2414 | Length of the Longest Alphabetical Continuous Substring | 62.7% | Med. |
| 2415 | Reverse Odd Levels of Binary Tree | 83.7% | Med. |
| 2416 | Sum of Prefix Scores of Strings | 60.5% | Hard |
| 2417 | Closest Fair Integer | 46.3% | Med. |
| 2418 | Sort the People | 82.6% | Easy |
| 2419 | Longest Subarray With Maximum Bitwise AND | 63.3% | Med. |
| 2420 | Find All Good Indices | 39.7% | Med. |
| 2421 | Number of Good Paths | 55.9% | Hard |
| 2422 | Merge Operations to Turn Array Into a Palindrome | 67.9% | Med. |
| 2423 | Remove Letter To Equalize Frequency | 17.8% | Easy |
| 2424 | Longest Uploaded Prefix | 54.7% | Med. |
| 2425 | Bitwise XOR of All Pairings | 59.3% | Med. |
| 2426 | Number of Pairs Satisfying Inequality | 45.1% | Hard |
| 2427 | Number of Common Factors | 79.9% | Easy |
| 2428 | Maximum Sum of an Hourglass | 76.2% | Med. |
| 2429 | Minimize XOR | 53.7% | Med. |
| 2430 | Maximum Deletions on a String | 33.7% | Hard |
| 2431 | Maximize Total Tastiness of Purchased Fruits | 65.1% | Med. |
| 2432 | The Employee That Worked on the Longest Task | 50.2% | Easy |
| 2433 | Find The Original Array of Prefix Xor | 84.4% | Med. |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | 56.7% | Med. |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | 44.1% | Hard |
| 2436 | Minimum Split Into Subarrays With GCD Greater Than One | 68.5% | Med. |
| 2437 | Number of Valid Clock Times | 46.3% | Easy |
| 2438 | Range Product Queries of Powers | 60.7% | Med. |
| 2439 | Minimize Maximum of Array | 46.2% | Med. |
| 2440 | Create Components With Same Value | 52.0% | Hard |
| 2441 | Largest Positive Integer That Exists With Its Negative | 74.8% | Easy |
| 2442 | Count Number of Distinct Integers After Reverse Operations | 80.4% | Med. |
| 2443 | Sum of Number and Its Reverse | 47.7% | Med. |
| 2444 | Count Subarrays With Fixed Bounds | 68.6% | Hard |
| 2445 | Number of Nodes With Value One | 61.9% | Med. |
| 2446 | Determine Whether Two String Arrays are Equivalent | 51.9% | Easy |
| 2447 | Number of Subarrays With GCD Equal to K | 50.6% | Med. |
| 2448 | Minimum Cost to Make Array Equal | 46.0% | Hard |
| 2449 | Minimum Number of Operations to Make Array Continuous | 43.0% | Hard |
| 2450 | Number of Distinct Binary Strings After Substring Flips | 66.4% | Med. |
| 2451 | Odd String Difference | 61.7% | Easy |
| 2452 | Words Within Two Edits of Dictionary | 62.5% | Med. |
| 2453 | Destroy Sequential Targets | 41.6% | Med. |
| 2454 | Next Greater Element IV | 39.8% | Hard |
| 2455 | Average Value of Even Numbers That Are Divisible by Three | 61.6% | Easy |
| 2456 | Most Popular Video Creator | 44.8% | Med. |
| 2457 | Minimum Addition to Make Integer Beautiful | 37.7% | Med. |
| 2458 | Height of Binary Tree After Subtree Removal Queries | 54.5% | Hard |
| 2459 | Sort Array by Moving Items to Empty Space | 44.7% | Hard |
| 2460 | Apply Operations to an Array | 71.6% | Easy |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | 42.2% | Med. |
| 2462 | Total Cost to Hire K Workers | 43.1% | Med. |
| 2463 | Minimum Total Distance Traveled | 59.1% | Hard |
| 2464 | Minimum Subarrays in a Valid Split | 45.5% | Med. |
| 2465 | Number of Distinct Averages | 58.7% | Easy |
| 2466 | Count Ways To Build Good Strings | 54.9% | Med. |
| 2467 | Most Profitable Path in a Tree | 56.8% | Med. |
| 2468 | Split Message Based on Limit | 42.0% | Hard |
| 2469 | Convert the Temperature | 90.0% | Easy |
| 2470 | Number of Subarrays With LCM Equal to K | 40.2% | Med. |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | 79.2% | Med. |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | 40.0% | Hard |
| 2473 | Minimum Cost to Buy Apples | 67.6% | Med. |
| 2474 | Customers With Strictly Increasing Purchases | 48.9% | Hard |
| 2475 | Number of Unequal Triplets in Array | 72.7% | Easy |
| 2476 | Closest Nodes Queries in a Binary Search Tree | 42.9% | Med. |
| 2477 | Minimum Fuel Cost to Report to the Capital | 64.5% | Med. |
| 2478 | Number of Beautiful Partitions | 32.3% | Hard |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | 48.0% | Hard |
| 2480 | Form a Chemical Bond | 83.9% | Easy |
| 2481 | Minimum Cuts to Divide a Circle | 55.5% | Easy |
| 2482 | Difference Between Ones and Zeros in Row and Column | 84.5% | Med. |
| 2483 | Minimum Penalty for a Shop | 67.5% | Med. |
| 2484 | Count Palindromic Subsequences | 52.6% | Hard |
| 2485 | Find the Pivot Integer | 84.5% | Easy |
| 2486 | Append Characters to String to Make Subsequence | 72.5% | Med. |
| 2487 | Remove Nodes From Linked List | 74.9% | Med. |
| 2488 | Count the Number of Good Subarrays | 65.1% | Hard |
| 2489 | Number of Substrings With Fixed Ratio | 53.0% | Med. |
| 2490 | Circular Sentence | 63.5% | Easy |
| 2491 | Divide Players Into Teams of Equal Skill | 68.7% | Med. |
| 2492 | Minimum Score of a Path Between Two Cities | 57.6% | Med. |
| 2493 | Divide Nodes Into the Maximum Number of Groups | 67.3% | Hard |
| 2494 | Merge Overlapping Events in the Same Hall | 33.5% | Hard |
| 2495 | Number of Subarrays Having Even Product | 62.0% | Med. |
| 2496 | Maximum Value of a String in an Array | 73.7% | Easy |
| 2497 | Maximum Star Sum of a Graph | 41.1% | Med. |
| 2498 | Frog Jump II | 61.9% | Med. |
| 2499 | Minimum Total Cost to Make Arrays Unequal | 37.3% | Hard |
| 2500 | Delete Greatest Value in Each Row | 79.0% | Easy |
| 2501 | Longest Square Streak in an Array | 52.4% | Med. |
| 2502 | Design Memory Allocator | 45.5% | Med. |
| 2503 | Maximum Number of Points From Grid Queries | 59.3% | Hard |
| 2504 | Concatenate the Name and the Profession | 68.9% | Easy |
| 2505 | Bitwise OR of All Subsequence Sums | 68.8% | Med. |
| 2506 | Count Pairs Of Similar Strings | 71.9% | Easy |
| 2507 | Smallest Value After Replacing With Sum of Prime Factors | 47.4% | Med. |
| 2508 | Add Edges to Make Degrees of All Nodes Even | 35.5% | Hard |
| 2509 | Cycle Length Queries in a Tree | 58.3% | Hard |
| 2510 | Check if There is a Path With Equal Number of 0's And 1's | 48.4% | Med. |
| 2511 | Maximum Enemy Forts That Can Be Captured | 40.4% | Easy |
| 2512 | Reward Top K Students | 45.9% | Med. |
| 2513 | Minimize the Maximum of Two Arrays | 30.6% | Hard |
| 2514 | Count Anagrams | 36.1% | Hard |
| 2515 | Shortest Distance to Target String in a Circular Array | 48.5% | Easy |
| 2516 | Take K of Each Character From Left and Right | 53.9% | Med. |
| 2517 | Maximum Tastiness of Candy Basket | 65.6% | Med. |
| 2518 | Number of Great Partitions | 32.0% | Hard |
| 2519 | Count the Number of K-Big Indices | 54.5% | Hard |
| 2520 | Count the Digits That Divide a Number | 85.6% | Easy |
| 2521 | Distinct Prime Factors of Product of Array | 51.6% | Med. |
| 2522 | Partition String Into Substrings With Values at Most K | 48.6% | Med. |
| 2523 | Closest Prime Numbers in Range | 51.6% | Med. |
| 2524 | Maximum Frequency Score of a Subarray | 38.6% | Hard |
| 2525 | Categorize Box According to Criteria | 46.1% | Easy |
| 2526 | Find Consecutive Integers from a Data Stream | 49.4% | Med. |
| 2527 | Find Xor-Beauty of Array | 68.5% | Med. |
| 2528 | Maximize the Minimum Powered City | 33.5% | Hard |
| 2529 | Maximum Count of Positive Integer and Negative Integer | 74.6% | Easy |
| 2530 | Maximal Score After Applying K Operations | 53.6% | Med. |
| 2531 | Make Number of Distinct Characters Equal | 27.1% | Med. |
| 2532 | Time to Cross a Bridge | 52.9% | Hard |
| 2533 | Number of Good Binary Strings | 48.5% | Hard |
| 2534 | Time Taken to Cross a Road | 47.6% | Hard |
| 2535 | Difference Between Element Sum and Digit Sum of an Array | 84.3% | Easy |
| 2536 | Increment Submatrices by One | 52.9% | Med. |
| 2537 | Count the Number of Good Subarrays | 65.2% | Med. |
| 2538 | Difference Between Maximum and Minimum Price Sum | 32.2% | Hard |
| 2539 | Count the Number of Good Subsequences | 52.4% | Med. |
| 2540 | Minimum Common Value | 58.0% | Easy |
| 2541 | Minimum Operations to Make Array Equal II | 33.3% | Med. |
| 2542 | Maximum Subsequence Score | 54.2% | Med. |
| 2543 | Check if Point is Reachable | 36.9% | Hard |
| 2544 | Alternating Digit Sum | 68.0% | Easy |
| 2545 | Sort the Students by Their Kth Score | 85.7% | Med. |
| 2546 | Apply Bitwise Operations to Make Strings Equal | 43.0% | Med. |
| 2547 | Minimum Cost to Make Array Equalindromic | 33.0% | Hard |
| 2548 | Maximum Price to Fill a Bag | 61.1% | Med. |
| 2549 | Count Distinct Numbers on Board | 61.4% | Easy |
| 2550 | Count Collisions of Monkeys on a Polygon | 29.3% | Med. |
| 2551 | Put Marbles in Bags | 68.5% | Hard |
| 2552 | Count Increasing Quadruplets | 34.0% | Hard |
| 2553 | Separate the Digits in an Array | 79.7% | Easy |
| 2554 | Maximum Number of Integers to Choose From a Range I | 55.3% | Med. |
| 2555 | Maximize Win From Two Segments | 35.6% | Hard |
| 2556 | Disconnect Path in a Binary Matrix by at Most One Flip | 27.1% | Hard |
| 2557 | Maximum Number of Integers to Choose From a Range II | 37.5% | Med. |
| 2558 | Take Gifts From the Richest Pile | 69.1% | Easy |
| 2559 | Count Vowel Strings in Ranges | 67.2% | Med. |
| 2560 | House Robber IV | 65.2% | Med. |
| 2561 | Rearranging Fruits | 50.2% | Hard |
| 2562 | Find the Array Concatenation Value | 70.0% | Easy |
| 2563 | Count the Number of Fair Pairs | 52.5% | Med. |
| 2564 | Substring XOR Queries | 34.7% | Med. |
| 2565 | Subsequence With the Minimum Score | 32.1% | Hard |
| 2566 | Maximum Difference by Remapping a Digit | 62.4% | Easy |
| 2567 | Minimum Score by Changing Two Elements | 48.5% | Med. |
| 2568 | Minimum Impossible OR | 57.6% | Med. |
| 2569 | Handling Sum Queries After Update | 28.6% | Hard |
| 2570 | Merge Two 2D Arrays by Summing Values | 74.0% | Easy |
| 2571 | Minimum Operations to Reduce an Integer to 0 | 57.7% | Med. |
| 2572 | Count the Number of Square-Free Subsets | 26.6% | Med. |
| 2573 | Find the String with LCP | 31.5% | Hard |
| 2574 | Left and Right Sum Differences | 87.2% | Easy |
| 2575 | Find the Divisibility Array of a String | 34.1% | Med. |
| 2576 | Find the Maximum Number of Marked Indices | 40.1% | Med. |
| 2577 | Minimum Time to Visit a Cell In a Grid | 50.1% | Hard |
| 2578 | Split With Minimum Sum | 72.7% | Easy |
| 2579 | Count Total Number of Colored Cells | 63.2% | Med. |
| 2580 | Count Ways to Group Overlapping Ranges | 38.1% | Med. |
| 2581 | Count Number of Possible Root Nodes | 46.3% | Hard |
| 2582 | Pass the Pillow | 56.5% | Easy |
| 2583 | Kth Largest Sum in a Binary Tree | 59.2% | Med. |
| 2584 | Split the Array to Make Coprime Products | 23.4% | Hard |
| 2585 | Number of Ways to Earn Points | 58.2% | Hard |
| 2586 | Count the Number of Vowel Strings in Range | 72.5% | Easy |
| 2587 | Rearrange Array to Maximize Prefix Score | 36.8% | Med. |
| 2588 | Count the Number of Beautiful Subarrays | 50.3% | Med. |
| 2589 | Minimum Time to Complete All Tasks | 38.4% | Hard |
| 2590 | Design a Todo List | 44.4% | Med. |
| 2591 | Distribute Money to Maximum Children | 26.0% | Easy |
| 2592 | Maximize Greatness of an Array | 58.6% | Med. |
| 2593 | Find Score of an Array After Marking All Elements | 63.5% | Med. |
| 2594 | Minimum Time to Repair Cars | 62.1% | Med. |
| 2595 | Number of Even and Odd Bits | 72.9% | Easy |
| 2596 | Check Knight Tour Configuration | 48.0% | Med. |
| 2597 | The Number of Beautiful Subsets | 52.6% | Med. |
| 2598 | Smallest Missing Non-negative Integer After Operations | 42.5% | Med. |
| 2599 | Make the Prefix Sum Non-negative | 52.7% | Med. |
| 2600 | K Items With the Maximum Sum | 60.4% | Easy |
| 2601 | Prime Subtraction Operation | 47.1% | Med. |
| 2602 | Minimum Operations to Make All Array Elements Equal | 47.5% | Med. |
| 2603 | Collect Coins in a Tree | 39.0% | Hard |
| 2604 | Minimum Time to Eat All Grains | 41.0% | Hard |
| 2605 | Form Smallest Number From Two Digit Arrays | 55.3% | Easy |
| 2606 | Find the Substring With Maximum Cost | 58.3% | Med. |
| 2607 | Make K-Subarray Sums Equal | 38.9% | Med. |
| 2608 | Shortest Cycle in a Graph | 40.0% | Hard |
| 2609 | Find the Longest Balanced Substring of a Binary String | 46.8% | Easy |
| 2610 | Convert an Array Into a 2D Array With Conditions | 86.1% | Med. |
| 2611 | Mice and Cheese | 49.0% | Med. |
| 2612 | Minimum Reverse Operations | 17.3% | Hard |
| 2613 | Beautiful Pairs | 49.1% | Hard |
| 2614 | Prime In Diagonal | 38.1% | Easy |
| 2615 | Sum of Distances | 50.3% | Med. |
| 2616 | Minimize the Maximum Difference of Pairs | 51.0% | Med. |
| 2617 | Minimum Number of Visited Cells in a Grid | 24.0% | Hard |
| 2618 | Check if Object Instance of Class | 30.0% | Med. |
| 2619 | Array Prototype Last | 74.7% | Easy |
| 2620 | Counter | 82.4% | Easy |
| 2621 | Sleep | 87.4% | Easy |
| 2622 | Cache With Time Limit | 76.2% | Med. |
| 2623 | Memoize | 65.2% | Med. |
| 2624 | Snail Traversal | 68.6% | Med. |
| 2625 | Flatten Deeply Nested Array | 66.1% | Med. |
| 2626 | Array Reduce Transformation | 85.5% | Easy |
| 2627 | Debounce | 91.7% | Med. |
| 2628 | JSON Deep Equal | 39.7% | Med. |
| 2629 | Function Composition | 86.8% | Easy |
| 2630 | Memoize II | 39.3% | Hard |
| 2631 | Group By | 81.5% | Med. |
| 2632 | Curry | 89.5% | Med. |
| 2633 | Convert Object to JSON String | 78.1% | Med. |
| 2634 | Filter Elements from Array | 85.5% | Easy |
| 2635 | Apply Transform Over Each Element in Array | 86.2% | Easy |
| 2636 | Promise Pool | 79.3% | Med. |
| 2637 | Promise Time Limit | 83.3% | Med. |
| 2638 | Count the Number of K-Free Subsets | 47.4% | Med. |
| 2639 | Find the Width of Columns of a Grid | 70.6% | Easy |
| 2640 | Find the Score of All Prefixes of an Array | 73.1% | Med. |
| 2641 | Cousins in Binary Tree II | 75.9% | Med. |
| 2642 | Design Graph With Shortest Path Calculator | 65.4% | Hard |
| 2643 | Row With Maximum Ones | 74.2% | Easy |
| 2644 | Find the Maximum Divisibility Score | 52.1% | Easy |
| 2645 | Minimum Additions to Make Valid String | 51.2% | Med. |
| 2646 | Minimize the Total Price of the Trips | 48.0% | Hard |
| 2647 | Color the Triangle Red | 58.0% | Hard |
| 2648 | Generate Fibonacci Sequence | 83.6% | Easy |
| 2649 | Nested Array Generator | 78.1% | Med. |
| 2650 | Design Cancellable Function | 57.9% | Hard |
| 2651 | Calculate Delayed Arrival Time | 75.4% | Easy |
| 2652 | Sum Multiples | 86.2% | Easy |
| 2653 | Sliding Subarray Beauty | 37.6% | Med. |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | 54.7% | Med. |
| 2655 | Find Maximal Uncovered Ranges | 49.7% | Med. |
| 2656 | Maximum Sum With Exactly K Elements | 80.2% | Easy |
| 2657 | Find the Prefix Common Array of Two Arrays | 88.3% | Med. |
| 2658 | Maximum Number of Fish in a Grid | 70.3% | Med. |
| 2659 | Make Array Empty | 27.2% | Hard |
| 2660 | Determine the Winner of a Bowling Game | 37.9% | Easy |
| 2661 | First Completely Painted Row or Column | 63.9% | Med. |
| 2662 | Minimum Cost of a Path With Special Roads | 43.7% | Med. |
| 2663 | Lexicographically Smallest Beautiful String | 38.5% | Hard |
| 2664 | The Knight’s Tour | 72.7% | Med. |
| 2665 | Counter II | 81.2% | Easy |
| 2666 | Allow One Function Call | 86.6% | Easy |
| 2667 | Create Hello World Function | 81.9% | Easy |
| 2668 | Find Latest Salaries | 75.3% | Easy |
| 2669 | Count Artist Occurrences On Spotify Ranking List | 74.1% | Easy |
| 2670 | Find the Distinct Difference Array | 76.8% | Easy |
| 2671 | Frequency Tracker | 31.5% | Med. |
| 2672 | Number of Adjacent Elements With the Same Color | 59.8% | Med. |
| 2673 | Make Costs of Paths Equal in a Binary Tree | 58.9% | Med. |
| 2674 | Split a Circular Linked List | 77.7% | Med. |
| 2675 | Array of Objects to Matrix | 68.6% | Hard |
| 2676 | Throttle | 83.4% | Med. |
| 2677 | Chunk Array | 84.5% | Easy |
| 2678 | Number of Senior Citizens | 81.2% | Easy |
| 2679 | Sum in a Matrix | 61.0% | Med. |
| 2680 | Maximum OR | 43.6% | Med. |
| 2681 | Power of Heroes | 32.0% | Hard |
| 2682 | Find the Losers of the Circular Game | 50.4% | Easy |
| 2683 | Neighboring Bitwise XOR | 79.8% | Med. |
| 2684 | Maximum Number of Moves in a Grid | 58.8% | Med. |
| 2685 | Count the Number of Complete Components | 80.8% | Med. |
| 2686 | Immediate Food Delivery III | 70.5% | Med. |
| 2687 | Bikes Last Time Used | 80.6% | Easy |
| 2688 | Find Active Users | 45.1% | Med. |
| 2689 | Extract Kth Character From The Rope Tree | 73.3% | Easy |
| 2690 | Infinite Method Object | 93.0% | Easy |
| 2691 | Immutability Helper | 40.2% | Hard |
| 2692 | Make Object Immutable | 62.9% | Med. |
| 2693 | Call Function with Custom Context | 77.4% | Med. |
| 2694 | Event Emitter | 75.0% | Med. |
| 2695 | Array Wrapper | 89.0% | Easy |
| 2696 | Minimum String Length After Removing Substrings | 77.2% | Easy |
| 2697 | Lexicographically Smallest Palindrome | 81.5% | Easy |
| 2698 | Find the Punishment Number of an Integer | 81.6% | Med. |
| 2699 | Modify Graph Edge Weights | 55.6% | Hard |
| 2700 | Differences Between Two Objects | 74.5% | Med. |
| 2701 | Consecutive Transactions with Increasing Amounts | 35.2% | Hard |
| 2702 | Minimum Operations to Make Numbers Non-positive | 44.3% | Hard |
| 2703 | Return Length of Arguments Passed | 94.4% | Easy |
| 2704 | To Be Or Not To Be | 63.4% | Easy |
| 2705 | Compact Object | 68.2% | Med. |
| 2706 | Buy Two Chocolates | 68.3% | Easy |
| 2707 | Extra Characters in a String | 57.2% | Med. |
| 2708 | Maximum Strength of a Group | 25.8% | Med. |
| 2709 | Greatest Common Divisor Traversal | 41.6% | Hard |
| 2710 | Remove Trailing Zeros From a String | 79.8% | Easy |
| 2711 | Difference of Number of Distinct Values on Diagonals | 68.6% | Med. |
| 2712 | Minimum Cost to Make All Characters Equal | 54.6% | Med. |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | 31.6% | Hard |
| 2714 | Find Shortest Path with K Hops | 68.8% | Hard |
| 2715 | Timeout Cancellation | 89.5% | Easy |
| 2716 | Minimize String Length | 79.6% | Easy |
| 2717 | Semi-Ordered Permutation | 64.4% | Easy |
| 2718 | Sum of Matrix After Queries | 32.3% | Med. |
| 2719 | Count of Integers | 39.1% | Hard |
| 2720 | Popularity Percentage | 53.5% | Hard |
| 2721 | Execute Asynchronous Functions in Parallel | 78.7% | Med. |
| 2722 | Join Two Arrays by ID | 57.7% | Med. |
| 2723 | Add Two Promises | 91.7% | Easy |
| 2724 | Sort By | 83.0% | Easy |
| 2725 | Interval Cancellation | 85.0% | Easy |
| 2726 | Calculator with Method Chaining | 76.9% | Easy |
| 2727 | Is Object Empty | 82.0% | Easy |
| 2728 | Count Houses in a Circular Street | 86.0% | Easy |
| 2729 | Check if The Number is Fascinating | 53.3% | Easy |
| 2730 | Find the Longest Semi-Repetitive Substring | 39.2% | Med. |
| 2731 | Movement of Robots | 28.2% | Med. |
| 2732 | Find a Good Subset of the Matrix | 46.8% | Hard |
| 2733 | Neither Minimum nor Maximum | 76.5% | Easy |
| 2734 | Lexicographically Smallest String After Substring Operation | 35.3% | Med. |
| 2735 | Collecting Chocolates | 35.3% | Med. |
| 2736 | Maximum Sum Queries | 31.0% | Hard |
| 2737 | Find the Closest Marked Node | 65.5% | Med. |
| 2738 | Count Occurrences in Text | 54.3% | Med. |
| 2739 | Total Distance Traveled | 41.7% | Easy |
| 2740 | Find the Value of the Partition | 65.1% | Med. |
| 2741 | Special Permutations | 29.8% | Med. |
| 2742 | Painting the Walls | 49.2% | Hard |
| 2743 | Count Substrings Without Repeating Character | 75.9% | Med. |
| 2744 | Find Maximum Number of String Pairs | 82.7% | Easy |
| 2745 | Construct the Longest New String | 55.0% | Med. |
| 2746 | Decremental String Concatenation | 28.0% | Med. |
| 2747 | Count Zero Request Servers | 36.2% | Med. |
| 2748 | Number of Beautiful Pairs | 52.7% | Easy |
| 2749 | Minimum Operations to Make the Integer Zero | 58.2% | Med. |
| 2750 | Ways to Split Array Into Good Subarrays | 35.3% | Med. |
| 2751 | Robot Collisions | 61.6% | Hard |
| 2752 | Customers with Maximum Number of Transactions on Consecutive Days | 42.5% | Hard |
| 2753 | Count Houses in a Circular Street II | 61.5% | Hard |
| 2754 | Bind Function to Context | 86.2% | Med. |
| 2755 | Deep Merge of Two Objects | 65.3% | Med. |
| 2756 | Query Batching | 69.2% | Hard |
| 2757 | Generate Circular Array Values | 75.9% | Med. |
| 2758 | Next Day | 84.9% | Easy |
| 2759 | Convert JSON String to Object | 61.9% | Hard |
| 2760 | Longest Even Odd Subarray With Threshold | 32.4% | Easy |
| 2761 | Prime Pairs With Target Sum | 38.2% | Med. |
| 2762 | Continuous Subarrays | 58.0% | Med. |
| 2763 | Sum of Imbalance Numbers of All Subarrays | 43.7% | Hard |
| 2764 | Is Array a Preorder of Some Binary Tree | 67.6% | Med. |
| 2765 | Longest Alternating Subarray | 35.5% | Easy |
| 2766 | Relocate Marbles | 51.8% | Med. |
| 2767 | Partition String Into Minimum Beautiful Substrings | 54.5% | Med. |
| 2768 | Number of Black Blocks | 42.1% | Med. |
| 2769 | Find the Maximum Achievable Number | 91.5% | Easy |
| 2770 | Maximum Number of Jumps to Reach the Last Index | 51.0% | Med. |
| 2771 | Longest Non-decreasing Subarray From Two Arrays | 31.4% | Med. |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | 33.7% | Med. |
| 2773 | Height of Special Binary Tree | 74.7% | Med. |
| 2774 | Array Upper Bound | 82.4% | Easy |
| 2775 | Undefined to Null | 72.2% | Med. |
| 2776 | Convert Callback Based Function to Promise Based Function | 89.4% | Med. |
| 2777 | Date Range Generator | 83.0% | Med. |
| 2778 | Sum of Squares of Special Elements | 82.3% | Easy |
| 2779 | Maximum Beauty of an Array After Applying Operation | 58.5% | Med. |
| 2780 | Minimum Index of a Valid Split | 75.5% | Med. |
| 2781 | Length of the Longest Valid Substring | 38.6% | Hard |
| 2782 | Number of Unique Categories | 84.0% | Med. |
| 2783 | Flight Occupancy and Waitlist Analysis | 38.9% | Med. |
| 2784 | Check if Array is Good | 57.3% | Easy |
| 2785 | Sort Vowels in a String | 83.5% | Med. |
| 2786 | Visit Array Positions to Maximize Score | 37.9% | Med. |
| 2787 | Ways to Express an Integer as Sum of Powers | 49.8% | Med. |
| 2788 | Split Strings by Separator | 76.5% | Easy |
| 2789 | Largest Element in an Array after Merge Operations | 48.2% | Med. |
| 2790 | Maximum Number of Groups With Increasing Length | 23.3% | Hard |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | 53.1% | Hard |
| 2792 | Count Nodes That Are Great Enough | 56.8% | Hard |
| 2793 | Status of Flight Tickets | 79.8% | Hard |
| 2794 | Create Object from Two Arrays | 64.7% | Easy |
| 2795 | Parallel Execution of Promises for Individual Results Retrieval | 86.3% | Med. |
| 2796 | Repeat String | 92.9% | Easy |
| 2797 | Partial Function with Placeholders | 87.7% | Easy |
| 2798 | Number of Employees Who Met the Target | 87.9% | Easy |
| 2799 | Count Complete Subarrays in an Array | 76.1% | Med. |
| 2800 | Shortest String That Contains Three Strings | 32.1% | Med. |
| 2801 | Count Stepping Numbers in Range | 29.4% | Hard |
| 2802 | Find The K-th Lucky Number | 75.8% | Med. |
| 2803 | Factorial Generator | 84.1% | Easy |
| 2804 | Array Prototype ForEach | 88.1% | Easy |
| 2805 | Custom Interval | 83.3% | Med. |
| 2806 | Account Balance After Rounded Purchase | 56.8% | Easy |
| 2807 | Insert Greatest Common Divisors in Linked List | 91.3% | Med. |
| 2808 | Minimum Seconds to Equalize a Circular Array | 28.9% | Med. |
| 2809 | Minimum Time to Make Array Sum At Most x | 28.1% | Hard |
| 2810 | Faulty Keyboard | 80.5% | Easy |
| 2811 | Check if it is Possible to Split Array | 34.7% | Med. |
| 2812 | Find the Safest Path in a Grid | 57.2% | Med. |
| 2813 | Maximum Elegance of a K-Length Subsequence | 29.2% | Hard |
| 2814 | Minimum Time Takes to Reach Destination Without Drowning | 54.3% | Hard |
| 2815 | Max Pair Sum in an Array | 61.1% | Easy |
| 2816 | Double a Number Represented as a Linked List | 61.3% | Med. |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | 37.9% | Med. |
| 2818 | Apply Operations to Maximize Score | 53.6% | Hard |
| 2819 | Minimum Relative Loss After Buying Chocolates | 46.6% | Hard |
| 2820 | Election Results | 66.5% | Med. |
| 2821 | Delay the Resolution of Each Promise | 74.5% | Med. |
| 2822 | Inversion of Object | 60.1% | Easy |
| 2823 | Deep Object Filter | 57.7% | Med. |
| 2824 | Count Pairs Whose Sum is Less than Target | 87.8% | Easy |
| 2825 | Make String a Subsequence Using Cyclic Increments | 65.7% | Med. |
| 2826 | Sorting Three Groups | 43.2% | Med. |
| 2827 | Number of Beautiful Integers in the Range | 23.2% | Hard |
| 2828 | Check if a String Is an Acronym of Words | 83.1% | Easy |
| 2829 | Determine the Minimum Sum of a k-avoiding Array | 61.1% | Med. |
| 2830 | Maximize the Profit as the Salesman | 38.5% | Med. |
| 2831 | Find the Longest Equal Subarray | 38.5% | Med. |
| 2832 | Maximal Range That Each Element Is Maximum in It | 75.4% | Med. |
| 2833 | Furthest Point From Origin | 77.2% | Easy |
| 2834 | Find the Minimum Possible Sum of a Beautiful Array | 34.9% | Med. |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | 32.7% | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | 31.6% | Hard |
| 2837 | Total Traveled Distance | 76.8% | Easy |
| 2838 | Maximum Coins Heroes Can Collect | 68.8% | Med. |
| 2839 | Check if Strings Can be Made Equal With Operations I | 61.9% | Easy |
| 2840 | Check if Strings Can be Made Equal With Operations II | 74.1% | Med. |
| 2841 | Maximum Sum of Almost Unique Subarray | 41.5% | Med. |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | 30.5% | Hard |
| 2843 | Count Symmetric Integers | 83.0% | Easy |
| 2844 | Minimum Operations to Make a Special Number | 38.7% | Med. |
| 2845 | Count of Interesting Subarrays | 58.0% | Med. |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | 47.3% | Hard |
| 2847 | Smallest Number With Given Digit Product | 43.5% | Med. |
| 2848 | Points That Intersect With Cars | 73.5% | Easy |
| 2849 | Determine if a Cell Is Reachable at a Given Time | 37.1% | Med. |
| 2850 | Minimum Moves to Spread Stones Over Grid | 45.9% | Med. |
| 2851 | String Transformation | 27.6% | Hard |
| 2852 | Sum of Remoteness of All Cells | 70.8% | Med. |
| 2853 | Highest Salaries Difference | 73.3% | Easy |
| 2854 | Rolling Average Steps | 68.8% | Med. |
| 2855 | Minimum Right Shifts to Sort the Array | 57.6% | Easy |
| 2856 | Minimum Array Length After Pair Removals | 27.9% | Med. |
| 2857 | Count Pairs of Points With Distance k | 33.2% | Med. |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | 59.6% | Hard |
| 2859 | Sum of Values at Indices With K Set Bits | 86.2% | Easy |
| 2860 | Happy Students | 51.3% | Med. |
| 2861 | Maximum Number of Alloys | 41.4% | Med. |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | 43.4% | Hard |
| 2863 | Maximum Length of Semi-Decreasing Subarrays | 70.1% | Med. |
| 2864 | Maximum Odd Binary Number | 82.9% | Easy |
| 2865 | Beautiful Towers I | 44.8% | Med. |
| 2866 | Beautiful Towers II | 36.9% | Med. |
| 2867 | Count Valid Paths in a Tree | 36.8% | Hard |
| 2868 | The Wording Game | 56.0% | Hard |
| 2869 | Minimum Operations to Collect Elements | 62.7% | Easy |
| 2870 | Minimum Number of Operations to Make Array Empty | 62.2% | Med. |
| 2871 | Split Array Into Maximum Number of Subarrays | 42.7% | Med. |
| 2872 | Maximum Number of K-Divisible Components | 74.0% | Hard |
| 2873 | Maximum Value of an Ordered Triplet I | 58.2% | Easy |
| 2874 | Maximum Value of an Ordered Triplet II | 56.4% | Med. |
| 2875 | Minimum Size Subarray in Infinite Array | 32.4% | Med. |
| 2876 | Count Visited Nodes in a Directed Graph | 31.2% | Hard |
| 2877 | Create a DataFrame from List | 80.9% | Easy |
| 2878 | Get the Size of a DataFrame | 84.8% | Easy |
| 2879 | Display the First Three Rows | 93.0% | Easy |
| 2880 | Select Data | 78.4% | Easy |
| 2881 | Create a New Column | 90.2% | Easy |
| 2882 | Drop Duplicate Rows | 85.1% | Easy |
| 2883 | Drop Missing Data | 64.7% | Easy |
| 2884 | Modify Columns | 92.3% | Easy |
| 2885 | Rename Columns | 85.3% | Easy |
| 2886 | Change Data Type | 87.3% | Easy |
| 2887 | Fill Missing Data | 72.6% | Easy |
| 2888 | Reshape Data: Concatenate | 90.4% | Easy |
| 2889 | Reshape Data: Pivot | 82.9% | Easy |
| 2890 | Reshape Data: Melt | 85.9% | Easy |
| 2891 | Method Chaining | 76.2% | Easy |
| 2892 | Minimizing Array After Replacing Pairs With Their Product | 40.7% | Med. |
| 2893 | Calculate Orders Within Each Interval | 67.1% | Med. |
| 2894 | Divisible and Non-divisible Sums Difference | 91.1% | Easy |
| 2895 | Minimum Processing Time | 70.7% | Med. |
| 2896 | Apply Operations to Make Two Strings Equal | 27.9% | Med. |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | 45.0% | Hard |
| 2898 | Maximum Linear Stock Score | 61.9% | Med. |
| 2899 | Last Visited Integers | 62.6% | Easy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | 66.8% | Easy |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | 51.4% | Med. |
| 2902 | Count of Sub-Multisets With Bounded Sum | 22.7% | Hard |
| 2903 | Find Indices With Index and Value Difference I | 60.4% | Easy |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | 41.4% | Med. |
| 2905 | Find Indices With Index and Value Difference II | 32.9% | Med. |
| 2906 | Construct Product Matrix | 51.7% | Med. |
| 2907 | Maximum Profitable Triplets With Increasing Prices I | 56.1% | Med. |
| 2908 | Minimum Sum of Mountain Triplets I | 67.8% | Easy |
| 2909 | Minimum Sum of Mountain Triplets II | 54.9% | Med. |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | 25.4% | Med. |
| 2911 | Minimum Changes to Make K Semi-palindromes | 36.2% | Hard |
| 2912 | Number of Ways to Reach Destination in the Grid | 57.6% | Hard |
| 2913 | Subarrays Distinct Element Sum of Squares I | 80.4% | Easy |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | 76.4% | Med. |
| 2915 | Length of the Longest Subsequence That Sums to Target | 40.2% | Med. |
| 2916 | Subarrays Distinct Element Sum of Squares II | 23.7% | Hard |
| 2917 | Find the K-or of an Array | 73.0% | Easy |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | 50.2% | Med. |
| 2919 | Minimum Increment Operations to Make Array Beautiful | 35.0% | Med. |
| 2920 | Maximum Points After Collecting Coins From All Nodes | 37.0% | Hard |
| 2921 | Maximum Profitable Triplets With Increasing Prices II | 46.3% | Hard |
| 2922 | Market Analysis III | 42.4% | Med. |
| 2923 | Find Champion I | 73.6% | Easy |
| 2924 | Find Champion II | 70.4% | Med. |
| 2925 | Maximum Score After Applying Operations on a Tree | 47.5% | Med. |
| 2926 | Maximum Balanced Subsequence Sum | 26.0% | Hard |
| 2927 | Distribute Candies Among Children III | 57.2% | Hard |
| 2928 | Distribute Candies Among Children I | 76.6% | Easy |
| 2929 | Distribute Candies Among Children II | 55.6% | Med. |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | 56.6% | Med. |
| 2931 | Maximum Spending After Buying Items | 61.5% | Hard |
| 2932 | Maximum Strong Pair XOR I | 76.3% | Easy |
| 2933 | High-Access Employees | 47.7% | Med. |
| 2934 | Minimum Operations to Maximize Last Elements in Arrays | 44.2% | Med. |
| 2935 | Maximum Strong Pair XOR II | 32.7% | Hard |
| 2936 | Number of Equal Numbers Blocks | 62.5% | Med. |
| 2937 | Make Three Strings Equal | 45.2% | Easy |
| 2938 | Separate Black and White Balls | 63.9% | Med. |
| 2939 | Maximum Xor Product | 30.4% | Med. |
| 2940 | Find Building Where Alice and Bob Can Meet | 52.5% | Hard |
| 2941 | Maximum GCD-Sum of a Subarray | 39.4% | Hard |
| 2942 | Find Words Containing Character | 90.4% | Easy |
| 2943 | Maximize Area of Square Hole in Grid | 62.0% | Med. |
| 2944 | Minimum Number of Coins for Fruits | 49.6% | Med. |
| 2945 | Find Maximum Non-decreasing Array Length | 19.2% | Hard |
| 2946 | Matrix Similarity After Cyclic Shifts | 74.4% | Easy |
| 2947 | Count Beautiful Substrings I | 61.6% | Med. |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | 60.3% | Med. |
| 2949 | Count Beautiful Substrings II | 27.9% | Hard |
| 2950 | Number of Divisible Substrings | 74.7% | Med. |
| 2951 | Find the Peaks | 75.4% | Easy |
| 2952 | Minimum Number of Coins to be Added | 58.5% | Med. |
| 2953 | Count Complete Substrings | 31.1% | Hard |
| 2954 | Count the Number of Infection Sequences | 38.1% | Hard |
| 2955 | Number of Same-End Substrings | 61.7% | Med. |
| 2956 | Find Common Elements Between Two Arrays | 84.7% | Easy |
| 2957 | Remove Adjacent Almost-Equal Characters | 53.9% | Med. |
| 2958 | Length of Longest Subarray With at Most K Frequency | 56.8% | Med. |
| 2959 | Number of Possible Sets of Closing Branches | 51.7% | Hard |
| 2960 | Count Tested Devices After Test Operations | 79.0% | Easy |
| 2961 | Double Modular Exponentiation | 48.3% | Med. |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | 62.4% | Med. |
| 2963 | Count the Number of Good Partitions | 50.1% | Hard |
| 2964 | Number of Divisible Triplet Sums | 67.7% | Med. |
| 2965 | Find Missing and Repeated Values | 83.1% | Easy |
| 2966 | Divide Array Into Arrays With Max Difference | 79.1% | Med. |
| 2967 | Minimum Cost to Make Array Equalindromic | 23.7% | Med. |
| 2968 | Apply Operations to Maximize Frequency Score | 39.5% | Hard |
| 2969 | Minimum Number of Coins for Fruits II | 48.2% | Hard |
| 2970 | Count the Number of Incremovable Subarrays I | 56.9% | Easy |
| 2971 | Find Polygon With the Largest Perimeter | 65.6% | Med. |
| 2972 | Count the Number of Incremovable Subarrays II | 40.6% | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | 37.8% | Hard |
| 2974 | Minimum Number Game | 85.7% | Easy |
| 2975 | Maximum Square Area by Removing Fences From a Field | 49.6% | Med. |
| 2976 | Minimum Cost to Convert String I | 63.1% | Med. |
| 2977 | Minimum Cost to Convert String II | 59.6% | Hard |
| 2978 | Symmetric Coordinates | 41.0% | Med. |
| 2979 | Most Expensive Item That Can Not Be Bought | 80.1% | Med. |
| 2980 | Check if Bitwise OR Has Trailing Zeros | 71.6% | Easy |
| 2981 | Find Longest Special Substring That Occurs Thrice I | 61.8% | Med. |
| 2982 | Find Longest Special Substring That Occurs Thrice II | 39.3% | Med. |
| 2983 | Palindrome Rearrangement Queries | 25.2% | Hard |
| 2984 | Find Peak Calling Hours for Each City | 61.1% | Med. |
| 2985 | Calculate Compressed Mean | 86.0% | Easy |
| 2986 | Find Third Transaction | 53.8% | Med. |
| 2987 | Find Expensive Cities | 77.1% | Easy |
| 2988 | Manager of the Largest Department | 80.7% | Med. |
| 2989 | Class Performance | 88.5% | Med. |
| 2990 | Loan Types | 64.3% | Easy |
| 2991 | Top Three Wineries | 54.1% | Hard |
| 2992 | Number of Self-Divisible Permutations | 71.8% | Med. |
| 2993 | Friday Purchases I | 81.1% | Med. |
| 2994 | Friday Purchases II | 73.5% | Hard |
| 2995 | Viewers Turned Streamers | 42.9% | Hard |
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | 35.9% | Easy |
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | 85.5% | Med. |
| 2998 | Minimum Number of Operations to Make X and Y Equal | 48.9% | Med. |
| 2999 | Count the Number of Powerful Integers | 46.3% | Hard |
| 3000 | Maximum Area of Longest Diagonal Rectangle | 45.9% | Easy |
Problems 3000-4001
| S.No | Problem | Acceptance | Level |
|---|---|---|---|
| 3001 | Minimum Moves to Capture The Queen | 22.6% | Med. |
| 3002 | Maximum Size of a Set After Removals | 46.8% | Med. |
| 3003 | Maximize the Number of Partitions After Operations | 53.3% | Hard |
| 3004 | Maximum Subtree of the Same Color | 58.9% | Med. |
| 3005 | Count Elements With Maximum Frequency | 79.8% | Easy |
| 3006 | Find Beautiful Indices in the Given Array I | 41.2% | Med. |
| 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | 39.1% | Med. |
| 3008 | Find Beautiful Indices in the Given Array II | 28.2% | Hard |
| 3009 | Maximum Number of Intersections on the Chart | 45.2% | Hard |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | 80.6% | Easy |
| 3011 | Find if Array Can Be Sorted | 66.4% | Med. |
| 3012 | Minimize Length of Array Using Operations | 36.2% | Med. |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | 54.7% | Hard |
| 3014 | Minimum Number of Pushes to Type Word I | 67.4% | Easy |
| 3015 | Count the Number of Houses at a Certain Distance I | 58.2% | Med. |
| 3016 | Minimum Number of Pushes to Type Word II | 80.0% | Med. |
| 3017 | Count the Number of Houses at a Certain Distance II | 23.8% | Hard |
| 3018 | Maximum Number of Removal Queries That Can Be Processed I | 45.1% | Hard |
| 3019 | Number of Changing Keys | 80.9% | Easy |
| 3020 | Find the Maximum Number of Elements in Subset | 42.3% | Med. |
| 3021 | Alice and Bob Playing Flower Game | 59.9% | Med. |
| 3022 | Minimize OR of Remaining Elements Using Operations | 30.9% | Hard |
| 3023 | Find Pattern in Infinite Stream I | 57.5% | Med. |
| 3024 | Type of Triangle | 44.0% | Easy |
| 3025 | Find the Number of Ways to Place People I | 64.0% | Med. |
| 3026 | Maximum Good Subarray Sum | 22.2% | Med. |
| 3027 | Find the Number of Ways to Place People II | 64.4% | Hard |
| 3028 | Ant on the Boundary | 74.7% | Easy |
| 3029 | Minimum Time to Revert Word to Initial State I | 42.8% | Med. |
| 3030 | Find the Grid of Region Average | 43.9% | Med. |
| 3031 | Minimum Time to Revert Word to Initial State II | 35.7% | Hard |
| 3032 | Count Numbers With Unique Digits II | 87.3% | Easy |
| 3033 | Modify the Matrix | 69.3% | Easy |
| 3034 | Number of Subarrays That Match a Pattern I | 68.8% | Med. |
| 3035 | Maximum Palindromes After Operations | 47.3% | Med. |
| 3036 | Number of Subarrays That Match a Pattern II | 34.2% | Hard |
| 3037 | Find Pattern in Infinite Stream II | 67.8% | Hard |
| 3038 | Maximum Number of Operations With the Same Score I | 53.1% | Easy |
| 3039 | Apply Operations to Make String Empty | 57.9% | Med. |
| 3040 | Maximum Number of Operations With the Same Score II | 34.4% | Med. |
| 3041 | Maximize Consecutive Elements in an Array After Modification | 34.2% | Hard |
| 3042 | Count Prefix and Suffix Pairs I | 77.8% | Easy |
| 3043 | Find the Length of the Longest Common Prefix | 62.3% | Med. |
| 3044 | Most Frequent Prime | 46.3% | Med. |
| 3045 | Count Prefix and Suffix Pairs II | 28.7% | Hard |
| 3046 | Split the Array | 61.7% | Easy |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | 67.0% | Med. |
| 3048 | Earliest Second to Mark Indices I | 37.3% | Med. |
| 3049 | Earliest Second to Mark Indices II | 22.8% | Hard |
| 3050 | Pizza Toppings Cost Analysis | 68.9% | Med. |
| 3051 | Find Candidates for Data Scientist Position | 75.4% | Easy |
| 3052 | Maximize Items | 74.5% | Hard |
| 3053 | Classifying Triangles by Lengths | 51.2% | Easy |
| 3054 | Binary Tree Nodes | 78.2% | Med. |
| 3055 | Top Percentile Fraud | 57.4% | Med. |
| 3056 | Snaps Analysis | 58.8% | Med. |
| 3057 | Employees Project Allocation | 67.5% | Hard |
| 3058 | Friends With No Mutual Friends | 48.8% | Med. |
| 3059 | Find All Unique Email Domains | 70.3% | Easy |
| 3060 | User Activities within Time Bounds | 41.8% | Hard |
| 3061 | Calculate Trapping Rain Water | 81.6% | Hard |
| 3062 | Winner of the Linked List Game | 77.5% | Easy |
| 3063 | Linked List Frequency | 85.5% | Easy |
| 3064 | Guess the Number Using Bitwise Questions I | 88.9% | Med. |
| 3065 | Minimum Operations to Exceed Threshold Value I | 86.9% | Easy |
| 3066 | Minimum Operations to Exceed Threshold Value II | 45.8% | Med. |
| 3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | 56.3% | Med. |
| 3068 | Find the Maximum Sum of Node Values | 69.4% | Hard |
| 3069 | Distribute Elements Into Two Arrays I | 74.3% | Easy |
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | 74.9% | Med. |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | 64.7% | Med. |
| 3072 | Distribute Elements Into Two Arrays II | 31.1% | Hard |
| 3073 | Maximum Increasing Triplet Value | 36.0% | Med. |
| 3074 | Apple Redistribution into Boxes | 78.6% | Easy |
| 3075 | Maximize Happiness of Selected Children | 58.7% | Med. |
| 3076 | Shortest Uncommon Substring in an Array | 51.2% | Med. |
| 3077 | Maximum Strength of K Disjoint Subarrays | 28.2% | Hard |
| 3078 | Match Alphanumerical Pattern in Matrix I | 65.3% | Med. |
| 3079 | Find the Sum of Encrypted Integers | 75.2% | Easy |
| 3080 | Mark Elements on Array by Performing Queries | 49.7% | Med. |
| 3081 | Replace Question Marks in String to Minimize Its Value | 29.4% | Med. |
| 3082 | Find the Sum of the Power of All Subsequences | 38.8% | Hard |
| 3083 | Existence of a Substring in a String and Its Reverse | 66.7% | Easy |
| 3084 | Count Substrings Starting and Ending with Given Character | 50.4% | Med. |
| 3085 | Minimum Deletions to Make String K-Special | 67.1% | Med. |
| 3086 | Minimum Moves to Pick K Ones | 21.8% | Hard |
| 3087 | Find Trending Hashtags | 61.5% | Med. |
| 3088 | Make String Anti-palindrome | 46.3% | Hard |
| 3089 | Find Bursty Behavior | 38.0% | Med. |
| 3090 | Maximum Length Substring With Two Occurrences | 65.9% | Easy |
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | 44.6% | Med. |
| 3092 | Most Frequent IDs | 43.3% | Med. |
| 3093 | Longest Common Suffix Queries | 52.6% | Hard |
| 3094 | Guess the Number Using Bitwise Questions II | 82.8% | Med. |
| 3095 | Shortest Subarray With OR at Least K I | 44.9% | Easy |
| 3096 | Minimum Levels to Gain More Points | 40.6% | Med. |
| 3097 | Shortest Subarray With OR at Least K II | 50.3% | Med. |
| 3098 | Find the Sum of Subsequence Powers | 25.5% | Hard |
| 3099 | Harshad Number | 83.4% | Easy |
| 3100 | Water Bottles II | 78.1% | Med. |
| 3101 | Count Alternating Subarrays | 57.5% | Med. |
| 3102 | Minimize Manhattan Distances | 32.6% | Hard |
| 3103 | Find Trending Hashtags II | 66.7% | Hard |
| 3104 | Find Longest Self-Contained Substring | 58.5% | Hard |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | 64.9% | Easy |
| 3106 | Lexicographically Smallest String After Operations With Constraint | 62.9% | Med. |
| 3107 | Minimum Operations to Make Median of Array Equal to K | 48.1% | Med. |
| 3108 | Minimum Cost Walk in Weighted Graph | 68.2% | Hard |
| 3109 | Find the Index of Permutation | 37.2% | Med. |
| 3110 | Score of a String | 91.4% | Easy |
| 3111 | Minimum Rectangles to Cover Points | 64.1% | Med. |
| 3112 | Minimum Time to Visit Disappearing Nodes | 38.2% | Med. |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | 33.8% | Hard |
| 3114 | Latest Time You Can Obtain After Replacing Characters | 35.5% | Easy |
| 3115 | Maximum Prime Difference | 59.4% | Med. |
| 3116 | Kth Smallest Amount With Single Denomination Combination | 20.4% | Hard |
| 3117 | Minimum Sum of Values by Dividing Array | 28.0% | Hard |
| 3118 | Friday Purchase III | 55.1% | Med. |
| 3119 | Maximum Number of Potholes That Can Be Fixed | 53.4% | Med. |
| 3120 | Count the Number of Special Characters I | 77.3% | Easy |
| 3121 | Count the Number of Special Characters II | 60.5% | Med. |
| 3122 | Minimum Number of Operations to Satisfy Conditions | 42.4% | Med. |
| 3123 | Find Edges in Shortest Paths | 47.0% | Hard |
| 3124 | Find Longest Calls | 64.0% | Med. |
| 3125 | Maximum Number That Makes Result of Bitwise AND Zero | 70.1% | Med. |
| 3126 | Server Utilization Time | 60.7% | Med. |
| 3127 | Make a Square with the Same Color | 52.9% | Easy |
| 3128 | Right Triangles | 49.0% | Med. |
| 3129 | Find All Possible Stable Binary Arrays I | 53.6% | Med. |
| 3130 | Find All Possible Stable Binary Arrays II | 58.8% | Hard |
| 3131 | Find the Integer Added to Array I | 83.1% | Easy |
| 3132 | Find the Integer Added to Array II | 33.2% | Med. |
| 3133 | Minimum Array End | 55.3% | Med. |
| 3134 | Find the Median of the Uniqueness Array | 30.5% | Hard |
| 3135 | Equalize Strings by Adding or Removing Characters at Ends | 56.6% | Med. |
| 3136 | Valid Word | 50.9% | Easy |
| 3137 | Minimum Number of Operations to Make Word K-Periodic | 60.9% | Med. |
| 3138 | Minimum Length of Anagram Concatenation | 39.9% | Med. |
| 3139 | Minimum Cost to Equalize Array | 19.1% | Hard |
| 3140 | Consecutive Available Seats II | 55.6% | Med. |
| 3141 | Maximum Hamming Distances | 49.7% | Hard |
| 3142 | Check if Grid Satisfies Conditions | 45.8% | Easy |
| 3143 | Maximum Points Inside the Square | 39.9% | Med. |
| 3144 | Minimum Substring Partition of Equal Character Frequency | 40.6% | Med. |
| 3145 | Find Products of Elements of Big Array | 25.2% | Hard |
| 3146 | Permutation Difference between Two Strings | 88.0% | Easy |
| 3147 | Taking Maximum Energy From the Mystic Dungeon | 61.0% | Med. |
| 3148 | Maximum Difference Score in a Grid | 48.4% | Med. |
| 3149 | Find the Minimum Cost Array Permutation | 26.1% | Hard |
| 3150 | Invalid Tweets II | 85.0% | Easy |
| 3151 | Special Array I | 81.6% | Easy |
| 3152 | Special Array II | 45.8% | Med. |
| 3153 | Sum of Digit Differences of All Pairs | 43.3% | Med. |
| 3154 | Find Number of Ways to Reach the K-th Stair | 38.1% | Hard |
| 3155 | Maximum Number of Upgradable Servers | 43.7% | Med. |
| 3156 | Employee Task Duration and Concurrent Tasks | 39.5% | Hard |
| 3157 | Find the Level of Tree with Minimum Sum | 69.5% | Med. |
| 3158 | Find the XOR of Numbers Which Appear Twice | 79.2% | Easy |
| 3159 | Find Occurrences of an Element in an Array | 73.7% | Med. |
| 3160 | Find the Number of Distinct Colors Among the Balls | 54.2% | Med. |
| 3161 | Block Placement Queries | 41.4% | Hard |
| 3162 | Find the Number of Good Pairs I | 86.6% | Easy |
| 3163 | String Compression III | 67.1% | Med. |
| 3164 | Find the Number of Good Pairs II | 26.8% | Med. |
| 3165 | Maximum Sum of Subsequence With Non-adjacent Elements | 15.8% | Hard |
| 3166 | Calculate Parking Fees and Duration | 52.8% | Med. |
| 3167 | Better Compression of String | 75.4% | Med. |
| 3168 | Minimum Number of Chairs in a Waiting Room | 79.6% | Easy |
| 3169 | Count Days Without Meetings | 48.2% | Med. |
| 3170 | Lexicographically Minimum String After Removing Stars | 51.0% | Med. |
| 3171 | Find Subarray With Bitwise OR Closest to K | 31.4% | Hard |
| 3172 | Second Day Verification | 66.7% | Easy |
| 3173 | Bitwise OR of Adjacent Elements | 94.7% | Easy |
| 3174 | Clear Digits | 82.8% | Easy |
| 3175 | Find The First Player to win K Games in a Row | 40.4% | Med. |
| 3176 | Find the Maximum Length of a Good Subsequence I | 33.1% | Med. |
| 3177 | Find the Maximum Length of a Good Subsequence II | 25.5% | Hard |
| 3178 | Find the Child Who Has the Ball After K Seconds | 62.2% | Easy |
| 3179 | Find the N-th Value After K Seconds | 54.1% | Med. |
| 3180 | Maximum Total Reward Using Operations I | 31.1% | Med. |
| 3181 | Maximum Total Reward Using Operations II | 22.1% | Hard |
| 3182 | Find Top Scoring Students | 50.1% | Med. |
| 3183 | The Number of Ways to Make the Sum | 50.8% | Med. |
| 3184 | Count Pairs That Form a Complete Day I | 78.3% | Easy |
| 3185 | Count Pairs That Form a Complete Day II | 43.9% | Med. |
| 3186 | Maximum Total Damage With Spell Casting | 45.1% | Med. |
| 3187 | Peaks in Array | 27.9% | Hard |
| 3188 | Find Top Scoring Students II | 39.7% | Hard |
| 3189 | Minimum Moves to Get a Peaceful Board | 75.7% | Med. |
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | 90.8% | Easy |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | 80.4% | Med. |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | 65.3% | Med. |
| 3193 | Count the Number of Inversions | 31.9% | Hard |
| 3194 | Minimum Average of Smallest and Largest Elements | 85.5% | Easy |
| 3195 | Find the Minimum Area to Cover All Ones I | 78.2% | Med. |
| 3196 | Maximize Total Cost of Alternating Subarrays | 29.9% | Med. |
| 3197 | Find the Minimum Area to Cover All Ones II | 63.5% | Hard |
| 3198 | Find Cities in Each State | 79.1% | Easy |
| 3199 | Count Triplets with Even XOR Set Bits I | 83.0% | Easy |
| 3200 | Maximum Height of a Triangle | 44.6% | Easy |
| 3201 | Find the Maximum Length of Valid Subsequence I | 54.9% | Med. |
| 3202 | Find the Maximum Length of Valid Subsequence II | 57.1% | Med. |
| 3203 | Find Minimum Diameter After Merging Two Trees | 57.0% | Hard |
| 3204 | Bitwise User Permissions Analysis | 92.4% | Med. |
| 3205 | Maximum Array Hopping Score I | 77.2% | Med. |
| 3206 | Alternating Groups I | 69.3% | Easy |
| 3207 | Maximum Points After Enemy Battles | 33.5% | Med. |
| 3208 | Alternating Groups II | 60.0% | Med. |
| 3209 | Number of Subarrays With AND Value of K | 35.7% | Hard |
| 3210 | Find the Encrypted String | 68.4% | Easy |
| 3211 | Generate Binary Strings Without Adjacent Zeros | 88.6% | Med. |
| 3212 | Count Submatrices With Equal Frequency of X and Y | 69.7% | Med. |
| 3213 | Construct String with Minimum Cost | 19.0% | Hard |
| 3214 | Year on Year Growth Rate | 51.5% | Hard |
| 3215 | Count Triplets with Even XOR Set Bits II | 61.8% | Med. |
| 3216 | Lexicographically Smallest String After a Swap | 54.8% | Easy |
| 3217 | Delete Nodes From Linked List Present in Array | 69.4% | Med. |
| 3218 | Minimum Cost for Cutting Cake I | 58.7% | Med. |
| 3219 | Minimum Cost for Cutting Cake II | 54.8% | Hard |
| 3220 | Odd and Even Transactions | 68.4% | Med. |
| 3221 | Maximum Array Hopping Score II | 59.8% | Med. |
| 3222 | Find the Winning Player in Coin Game | 53.7% | Easy |
| 3223 | Minimum Length of String After Operations | 75.1% | Med. |
| 3224 | Minimum Array Changes to Make Differences Equal | 24.9% | Med. |
| 3225 | Maximum Score From Grid Operations | 64.3% | Hard |
| 3226 | Number of Bit Changes to Make Two Integers Equal | 63.7% | Easy |
| 3227 | Vowels Game in a String | 77.1% | Med. |
| 3228 | Maximum Number of Operations to Move Ones to the End | 67.1% | Med. |
| 3229 | Minimum Operations to Make Array Equal to Target | 41.9% | Hard |
| 3230 | Customer Purchasing Behavior Analysis | 36.4% | Med. |
| 3231 | Minimum Number of Increasing Subsequence to Be Removed | 47.4% | Hard |
| 3232 | Find if Digit Game Can Be Won | 81.7% | Easy |
| 3233 | Find the Count of Numbers Which Are Not Special | 28.3% | Med. |
| 3234 | Count the Number of Substrings With Dominant Ones | 42.0% | Med. |
| 3235 | Check if the Rectangle Corner Is Reachable | 25.2% | Hard |
| 3236 | CEO Subordinate Hierarchy | 69.8% | Hard |
| 3237 | Alt and Tab Simulation | 53.7% | Med. |
| 3238 | Find the Number of Winning Players | 60.7% | Easy |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | 75.1% | Med. |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | 25.8% | Med. |
| 3241 | Time Taken to Mark All Nodes | 28.8% | Hard |
| 3242 | Design Neighbor Sum Service | 76.7% | Easy |
| 3243 | Shortest Distance After Road Addition Queries I | 61.9% | Med. |
| 3244 | Shortest Distance After Road Addition Queries II | 27.0% | Hard |
| 3245 | Alternating Groups III | 19.5% | Hard |
| 3246 | Premier League Table Ranking | 78.5% | Easy |
| 3247 | Number of Subsequences with Odd Sum | 47.6% | Med. |
| 3248 | Snake in Matrix | 82.4% | Easy |
| 3249 | Count the Number of Good Nodes | 55.5% | Med. |
| 3250 | Find the Count of Monotonic Pairs I | 47.7% | Hard |
| 3251 | Find the Count of Monotonic Pairs II | 25.0% | Hard |
| 3252 | Premier League Table Ranking II | 55.7% | Med. |
| 3253 | Construct String with Minimum Cost (Easy) | 58.8% | Med. |
| 3254 | Find the Power of K-Size Subarrays I | 62.1% | Med. |
| 3255 | Find the Power of K-Size Subarrays II | 31.9% | Med. |
| 3256 | Maximum Value Sum by Placing Three Rooks I | 16.9% | Hard |
| 3257 | Maximum Value Sum by Placing Three Rooks II | 27.1% | Hard |
| 3258 | Count Substrings That Satisfy K-Constraint I | 79.3% | Easy |
| 3259 | Maximum Energy Boost From Two Drinks | 50.2% | Med. |
| 3260 | Find the Largest Palindrome Divisible by K | 17.3% | Hard |
| 3261 | Count Substrings That Satisfy K-Constraint II | 24.0% | Hard |
| 3262 | Find Overlapping Shifts | 57.9% | Med. |
| 3263 | Convert Doubly Linked List to Array I | 95.0% | Easy |
| 3264 | Final Array State After K Multiplication Operations I | 86.9% | Easy |
| 3265 | Count Almost Equal Pairs I | 38.5% | Med. |
| 3266 | Final Array State After K Multiplication Operations II | 13.7% | Hard |
| 3267 | Count Almost Equal Pairs II | 27.7% | Hard |
| 3268 | Find Overlapping Shifts II | 55.6% | Hard |
| 3269 | Constructing Two Increasing Arrays | 61.8% | Hard |
| 3270 | Find the Key of the Numbers | 76.7% | Easy |
| 3271 | Hash Divided String | 83.4% | Med. |
| 3272 | Find the Count of Good Integers | 69.2% | Hard |
| 3273 | Minimum Amount of Damage Dealt to Bob | 40.1% | Hard |
| 3274 | Check if Two Chessboard Squares Have the Same Color | 72.1% | Easy |
| 3275 | K-th Nearest Obstacle Queries | 49.3% | Med. |
| 3276 | Select Cells in Grid With Maximum Score | 16.0% | Hard |
| 3277 | Maximum XOR Score Subarray Queries | 44.6% | Hard |
| 3278 | Find Candidates for Data Scientist Position II | 43.2% | Med. |
| 3279 | Maximum Total Area Occupied by Pistons | 40.7% | Hard |
| 3280 | Convert Date to Binary | 88.5% | Easy |
| 3281 | Maximize Score of Numbers in Ranges | 36.0% | Med. |
| 3282 | Reach End of Array With Max Score | 33.9% | Med. |
| 3283 | Maximum Number of Moves to Kill All Pawns | 34.3% | Hard |
| 3284 | Sum of Consecutive Subarrays | 42.9% | Med. |
| 3285 | Find Indices of Stable Mountains | 87.2% | Easy |
| 3286 | Find a Safe Walk Through a Grid | 55.4% | Med. |
| 3287 | Find the Maximum Sequence Value of Array | 22.2% | Hard |
| 3288 | Length of the Longest Increasing Path | 19.8% | Hard |
| 3289 | The Two Sneaky Numbers of Digitville | 89.8% | Easy |
| 3290 | Maximum Multiplication Score | 41.5% | Med. |
| 3291 | Minimum Number of Valid Strings to Form Target I | 22.2% | Med. |
| 3292 | Minimum Number of Valid Strings to Form Target II | 21.0% | Hard |
| 3293 | Calculate Product Final Price | 78.7% | Med. |
| 3294 | Convert Doubly Linked List to Array II | 83.0% | Med. |
| 3295 | Report Spam Message | 48.7% | Med. |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | 58.4% | Med. |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | 43.4% | Med. |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | 56.4% | Hard |
| 3299 | Sum of Consecutive Subsequences | 44.7% | Hard |
| 3300 | Minimum Element After Replacement With Digit Sum | 89.6% | Easy |
| 3301 | Maximize the Total Height of Unique Towers | 37.7% | Med. |
| 3302 | Find the Lexicographically Smallest Valid Sequence | 22.3% | Med. |
| 3303 | Find the Occurrence of First Almost Equal Substring | 16.0% | Hard |
| 3304 | Find the K-th Character in String Game I | 81.6% | Easy |
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | 42.2% | Med. |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | 40.7% | Med. |
| 3307 | Find the K-th Character in String Game II | 48.4% | Hard |
| 3308 | Find Top Performing Driver | 48.9% | Med. |
| 3309 | Maximum Possible Number by Binary Concatenation | 65.7% | Med. |
| 3310 | Remove Methods From Project | 50.9% | Med. |
| 3311 | Construct 2D Grid Matching Graph Layout | 30.2% | Hard |
| 3312 | Sorted GCD Pair Queries | 58.4% | Hard |
| 3313 | Find the Last Marked Nodes in Tree | 56.6% | Hard |
| 3314 | Construct the Minimum Bitwise Array I | 85.3% | Easy |
| 3315 | Construct the Minimum Bitwise Array II | 66.6% | Med. |
| 3316 | Find Maximum Removals From Source String | 39.7% | Med. |
| 3317 | Find the Number of Possible Ways for an Event | 35.4% | Hard |
| 3318 | Find X-Sum of All K-Long Subarrays I | 76.1% | Easy |
| 3319 | K-th Largest Perfect Subtree Size in Binary Tree | 62.4% | Med. |
| 3320 | Count The Number of Winning Sequences | 32.5% | Hard |
| 3321 | Find X-Sum of All K-Long Subarrays II | 41.2% | Hard |
| 3322 | Premier League Table Ranking III | 70.3% | Med. |
| 3323 | Minimize Connected Groups by Inserting Interval | 50.3% | Med. |
| 3324 | Find the Sequence of Strings Appeared on the Screen | 80.5% | Med. |
| 3325 | Count Substrings With K-Frequency Characters I | 56.3% | Med. |
| 3326 | Minimum Division Operations to Make Array Non Decreasing | 29.4% | Med. |
| 3327 | Check if DFS Strings Are Palindromes | 20.9% | Hard |
| 3328 | Find Cities in Each State II | 66.8% | Med. |
| 3329 | Count Substrings With K-Frequency Characters II | 70.3% | Hard |
| 3330 | Find the Original Typed String I | 72.1% | Easy |
| 3331 | Find Subtree Sizes After Changes | 53.8% | Med. |
| 3332 | Maximum Points Tourist Can Earn | 48.0% | Med. |
| 3333 | Find the Original Typed String II | 45.5% | Hard |
| 3334 | Find the Maximum Factor Score of Array | 41.4% | Med. |
| 3335 | Total Characters in String After Transformations I | 45.6% | Med. |
| 3336 | Find the Number of Subsequences With Equal GCD | 66.7% | Hard |
| 3337 | Total Characters in String After Transformations II | 57.9% | Hard |
| 3338 | Second Highest Salary II | 86.4% | Med. |
| 3339 | Find the Number of K-Even Arrays | 61.2% | Med. |
| 3340 | Check Balanced String | 83.0% | Easy |
| 3341 | Find Minimum Time to Reach Last Room I | 55.5% | Med. |
| 3342 | Find Minimum Time to Reach Last Room II | 67.6% | Med. |
| 3343 | Count Number of Balanced Permutations | 49.0% | Hard |
| 3344 | Maximum Sized Array | 50.9% | Med. |
| 3345 | Smallest Divisible Digit Product I | 64.7% | Easy |
| 3346 | Maximum Frequency of an Element After Performing Operations I | 40.2% | Med. |
| 3347 | Maximum Frequency of an Element After Performing Operations II | 53.9% | Hard |
| 3348 | Smallest Divisible Digit Product II | 14.9% | Hard |
| 3349 | Adjacent Increasing Subarrays Detection I | 48.0% | Easy |
| 3350 | Adjacent Increasing Subarrays Detection II | 58.9% | Med. |
| 3351 | Sum of Good Subsequences | 31.3% | Hard |
| 3352 | Count K-Reducible Numbers Less Than N | 28.6% | Hard |
| 3353 | Minimum Total Operations | 63.5% | Easy |
| 3354 | Make Array Elements Equal to Zero | 68.3% | Easy |
| 3355 | Zero Array Transformation I | 54.6% | Med. |
| 3356 | Zero Array Transformation II | 43.6% | Med. |
| 3357 | Minimize the Maximum Adjacent Element Difference | 20.0% | Hard |
| 3358 | Books with NULL Ratings | 82.3% | Easy |
| 3359 | Find Sorted Submatrices With Maximum Element at Most K | 51.9% | Hard |
| 3360 | Stone Removal Game | 42.6% | Easy |
| 3361 | Shift Distance Between Two Strings | 53.9% | Med. |
| 3362 | Zero Array Transformation III | 54.7% | Med. |
| 3363 | Find the Maximum Number of Fruits Collected | 64.9% | Hard |
| 3364 | Minimum Positive Sum Subarray | 45.4% | Easy |
| 3365 | Rearrange K Substrings to Form Target String | 57.0% | Med. |
| 3366 | Minimum Array Sum | 31.9% | Med. |
| 3367 | Maximize Sum of Weights after Edge Removals | 31.9% | Hard |
| 3368 | First Letter Capitalization | 86.4% | Hard |
| 3369 | Design an Array Statistics Tracker | 35.7% | Hard |
| 3370 | Smallest Number With All Set Bits | 80.3% | Easy |
| 3371 | Identify the Largest Outlier in an Array | 36.4% | Med. |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | 69.4% | Med. |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | 73.1% | Hard |
| 3374 | First Letter Capitalization II | 41.6% | Hard |
| 3375 | Minimum Operations to Make Array Values Equal to K | 73.2% | Easy |
| 3376 | Minimum Time to Break Locks I | 32.9% | Med. |
| 3377 | Digit Operations to Make Two Integers Equal | 31.0% | Med. |
| 3378 | Count Connected Components in LCM Graph | 31.7% | Hard |
| 3379 | Transformed Array | 70.6% | Easy |
| 3380 | Maximum Area Rectangle With Point Constraints I | 52.3% | Med. |
| 3381 | Maximum Subarray Sum With Length Divisible by K | 49.7% | Med. |
| 3382 | Maximum Area Rectangle With Point Constraints II | 24.5% | Hard |
| 3383 | Minimum Runes to Add to Cast Spell | 44.9% | Hard |
| 3384 | Team Dominance by Pass Success | 71.7% | Hard |
| 3385 | Minimum Time to Break Locks II | 46.1% | Hard |
| 3386 | Button with Longest Push Time | 41.3% | Easy |
| 3387 | Maximize Amount After Two Days of Conversions | 61.8% | Med. |
| 3388 | Count Beautiful Splits in an Array | 19.2% | Med. |
| 3389 | Minimum Operations to Make Character Frequencies Equal | 26.7% | Hard |
| 3390 | Longest Team Pass Streak | 40.4% | Hard |
| 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | 66.4% | Med. |
| 3392 | Count Subarrays of Length Three With a Condition | 61.4% | Easy |
| 3393 | Count Paths With the Given XOR Value | 40.9% | Med. |
| 3394 | Check if Grid can be Cut into Sections | 68.3% | Med. |
| 3395 | Subsequences with a Unique Middle Mode I | 21.8% | Hard |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | 71.3% | Easy |
| 3397 | Maximum Number of Distinct Elements After Operations | 52.3% | Med. |
| 3398 | Smallest Substring With Identical Characters I | 20.9% | Hard |
| 3399 | Smallest Substring With Identical Characters II | 40.5% | Hard |
| 3400 | Maximum Number of Matching Indices After Right Shifts | 84.7% | Med. |
| 3401 | Find Circular Gift Exchange Chains | 50.4% | Hard |
| 3402 | Minimum Operations to Make Columns Strictly Increasing | 72.8% | Easy |
| 3403 | Find the Lexicographically Largest String From the Box I | 40.9% | Med. |
| 3404 | Count Special Subsequences | 30.2% | Med. |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | 58.2% | Hard |
| 3406 | Find the Lexicographically Largest String From the Box II | 50.2% | Hard |
| 3407 | Substring Matching Pattern | 29.1% | Easy |
| 3408 | Design Task Manager | 48.9% | Med. |
| 3409 | Longest Subsequence With Decreasing Adjacent Difference | 17.1% | Med. |
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | 23.5% | Hard |
| 3411 | Maximum Subarray With Equal Products | 47.2% | Easy |
| 3412 | Find Mirror Score of a String | 36.1% | Med. |
| 3413 | Maximum Coins From K Consecutive Bags | 26.2% | Med. |
| 3414 | Maximum Score of Non-overlapping Intervals | 31.9% | Hard |
| 3415 | Find Products with Three Consecutive Digits | 80.0% | Easy |
| 3416 | Subsequences with a Unique Middle Mode II | 15.7% | Hard |
| 3417 | Zigzag Grid Traversal With Skip | 65.6% | Easy |
| 3418 | Maximum Amount of Money Robot Can Earn | 47.8% | Med. |
| 3419 | Minimize the Maximum Edge Weight of Graph | 45.3% | Med. |
| 3420 | Count Non-Decreasing Subarrays After K Operations | 25.1% | Hard |
| 3421 | Find Students Who Improved | 49.4% | Med. |
| 3422 | Minimum Operations to Make Subarray Elements Equal | 46.4% | Med. |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | 75.6% | Easy |
| 3424 | Minimum Cost to Make Arrays Identical | 38.1% | Med. |
| 3425 | Longest Special Path | 23.2% | Hard |
| 3426 | Manhattan Distances of All Arrangements of Pieces | 35.8% | Hard |
| 3427 | Sum of Variable Length Subarrays | 85.9% | Easy |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | 22.1% | Med. |
| 3429 | Paint House IV | 45.7% | Med. |
| 3430 | Maximum and Minimum Sums of at Most Size K Subarrays | 26.1% | Hard |
| 3431 | Minimum Unlocked Indices to Sort Nums | 57.7% | Med. |
| 3432 | Count Partitions with Even Sum Difference | 85.3% | Easy |
| 3433 | Count Mentions Per User | 50.8% | Med. |
| 3434 | Maximum Frequency After Subarray Operation | 31.5% | Med. |
| 3435 | Frequencies of Shortest Supersequences | 22.9% | Hard |
| 3436 | Find Valid Emails | 43.3% | Easy |
| 3437 | Permutations III | 85.8% | Med. |
| 3438 | Find Valid Pair of Adjacent Digits in String | 61.1% | Easy |
| 3439 | Reschedule Meetings for Maximum Free Time I | 54.0% | Med. |
| 3440 | Reschedule Meetings for Maximum Free Time II | 60.4% | Med. |
| 3441 | Minimum Cost Good Caption | 21.2% | Hard |
| 3442 | Maximum Difference Between Even and Odd Frequency I | 60.8% | Easy |
| 3443 | Maximum Manhattan Distance After K Changes | 54.2% | Med. |
| 3444 | Minimum Increments for Target Multiples in an Array | 28.1% | Hard |
| 3445 | Maximum Difference Between Even and Odd Frequency II | 48.6% | Hard |
| 3446 | Sort Matrix by Diagonals | 84.7% | Med. |
| 3447 | Assign Elements to Groups with Constraints | 27.2% | Med. |
| 3448 | Count Substrings Divisible By Last Digit | 23.7% | Hard |
| 3449 | Maximize the Minimum Game Score | 26.7% | Hard |
| 3450 | Maximum Students on a Single Bench | 87.9% | Easy |
| 3451 | Find Invalid IP Addresses | 48.4% | Hard |
| 3452 | Sum of Good Numbers | 69.9% | Easy |
| 3453 | Separate Squares I | 58.0% | Med. |
| 3454 | Separate Squares II | 59.2% | Hard |
| 3455 | Shortest Matching Substring | 24.7% | Hard |
| 3456 | Find Special Substring of Length K | 35.3% | Easy |
| 3457 | Eat Pizzas! | 33.7% | Med. |
| 3458 | Select K Disjoint Special Substrings | 19.5% | Med. |
| 3459 | Length of Longest V-Shaped Diagonal Segment | 56.2% | Hard |
| 3460 | Longest Common Prefix After at Most One Removal | 68.4% | Med. |
| 3461 | Check If Digits Are Equal in String After Operations I | 82.6% | Easy |
| 3462 | Maximum Sum With at Most K Elements | 61.0% | Med. |
| 3463 | Check If Digits Are Equal in String After Operations II | 14.5% | Hard |
| 3464 | Maximize the Distance Between Points on a Square | 51.1% | Hard |
| 3465 | Find Products with Valid Serial Numbers | 28.9% | Easy |
| 3466 | Maximum Coin Collection | 53.0% | Med. |
| 3467 | Transform Array by Parity | 89.8% | Easy |
| 3468 | Find the Number of Copy Arrays | 47.3% | Med. |
| 3469 | Find Minimum Cost to Remove Array Elements | 22.2% | Med. |
| 3470 | Permutations IV | 34.6% | Hard |
| 3471 | Find the Largest Almost Missing Integer | 37.4% | Easy |
| 3472 | Longest Palindromic Subsequence After at Most K Operations | 38.0% | Med. |
| 3473 | Sum of K Subarrays With Length at Least M | 26.4% | Med. |
| 3474 | Lexicographically Smallest Generated String | 53.5% | Hard |
| 3475 | DNA Pattern Recognition | 85.0% | Med. |
| 3476 | Maximize Profit from Task Assignment | 65.4% | Med. |
| 3477 | Fruits Into Baskets II | 70.3% | Easy |
| 3478 | Choose K Elements With Maximum Sum | 34.3% | Med. |
| 3479 | Fruits Into Baskets III | 39.4% | Med. |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | 64.5% | Hard |
| 3481 | Apply Substitutions | 77.9% | Med. |
| 3482 | Analyze Organization Hierarchy | 61.4% | Hard |
| 3483 | Unique 3-Digit Even Numbers | 70.2% | Easy |
| 3484 | Design Spreadsheet | 73.9% | Med. |
| 3485 | Longest Common Prefix of K Strings After Removal | 24.4% | Hard |
| 3486 | Longest Special Path II | 19.9% | Hard |
| 3487 | Maximum Unique Subarray Sum After Deletion | 40.5% | Easy |
| 3488 | Closest Equal Element Queries | 51.5% | Med. |
| 3489 | Zero Array Transformation IV | 31.6% | Med. |
| 3490 | Count Beautiful Numbers | 24.4% | Hard |
| 3491 | Phone Number Prefix | 69.9% | Easy |
| 3492 | Maximum Containers on a Ship | 75.5% | Easy |
| 3493 | Properties of Two Matrices | 67.4% | Hard |
| 3494 | Find the Minimum Amount of Time to Brew Potions | 55.2% | Med. |
| 3495 | Minimum Operations to Make Array Elements Equal | 48.1% | Med. |
| 3496 | Maximum Sum of Almost Unique Subarray | 39.2% | Med. |
| 3497 | Analyze Subscription Conversion | 62.8% | Med. |
| 3498 | Reverse Degree of a String | 88.9% | Easy |
| 3499 | Maximize Active Section with Trade I | 61.0% | Med. |
| 3500 | Minimum Cost to Divide Array Into Subarrays | 28.5% | Hard |
| 3501 | Maximize Active Section with Trade II | 65.2% | Hard |
| 3502 | Minimum Cost to Reach Every Position | 83.6% | Easy |
| 3503 | Longest Palindrome After Substring Concatenation I | 44.0% | Med. |
| 3504 | Longest Palindrome After Substring Concatenation II | 18.3% | Hard |
| 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | 28.9% | Hard |
| 3506 | Find Time Required to Eliminate Bacterial Strains | 61.5% | Hard |
| 3507 | Minimum Pair Removal to Sort Array I | 65.2% | Easy |
| 3508 | Implement Router | 39.0% | Med. |
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | 13.7% | Hard |
| 3510 | Minimum Pair Removal to Sort Array II | 38.9% | Hard |
| 3511 | Make a Positive Array | 36.7% | Med. |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | 92.3% | Easy |
| 3513 | Number of Unique XOR Triplets I | 57.5% | Med. |
| 3514 | Number of Unique XOR Triplets II | 52.9% | Med. |
| 3515 | Shortest Path in a Weighted Tree | 42.8% | Hard |
| 3516 | Find Closest Person | 89.0% | Easy |
| 3517 | Smallest Palindromic Rearrangement I | 64.0% | Med. |
| 3518 | Smallest Palindromic Rearrangement II | 14.9% | Hard |
| 3519 | Count Numbers with Non-Decreasing Digits | 39.0% | Hard |
| 3520 | Minimum Threshold for Inversion Pairs Count | 54.4% | Med. |
| 3521 | Find Product Recommendation Pairs | 62.2% | Med. |
| 3522 | Calculate Score After Performing Instructions | 57.3% | Med. |
| 3523 | Make Array Non-decreasing | 57.6% | Med. |
| 3524 | Find X Value of Array I | 37.8% | Med. |
| 3525 | Find X Value of Array II | 31.7% | Hard |
| 3526 | Range XOR Queries with Subarray Reversals | 62.3% | Hard |
| 3527 | Find the Most Common Response | 74.9% | Med. |
| 3528 | Unit Conversion I | 54.1% | Med. |
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | 27.7% | Med. |
| 3530 | Maximum Profit from Valid Topological Order in DAG | 30.5% | Hard |
| 3531 | Count Covered Buildings | 58.9% | Med. |
| 3532 | Path Existence Queries in a Graph I | 70.5% | Med. |
| 3533 | Concatenated Divisibility | 31.3% | Hard |
| 3534 | Path Existence Queries in a Graph II | 64.2% | Hard |
| 3535 | Unit Conversion II | 65.2% | Med. |
| 3536 | Maximum Product of Two Digits | 75.7% | Easy |
| 3537 | Fill a Special Grid | 70.9% | Med. |
| 3538 | Merge Operations for Minimum Travel Time | 31.6% | Hard |
| 3539 | Find Sum of Array Product of Magical Sequences | 61.7% | Hard |
| 3540 | Minimum Time to Visit All Houses | 69.1% | Med. |
| 3541 | Find Most Frequent Vowel and Consonant | 89.3% | Easy |
| 3542 | Minimum Operations to Convert All Elements to Zero | 53.1% | Med. |
| 3543 | Maximum Weighted K-Edge Path | 20.3% | Med. |
| 3544 | Subtree Inversion Sum | 44.3% | Hard |
| 3545 | Minimum Deletions for At Most K Distinct Characters | 73.3% | Easy |
| 3546 | Equal Sum Grid Partition I | 52.9% | Med. |
| 3547 | Maximum Sum of Edge Values in a Graph | 37.1% | Hard |
| 3548 | Equal Sum Grid Partition II | 39.5% | Hard |
| 3549 | Multiply Two Polynomials | 58.6% | Hard |
| 3550 | Smallest Index With Digit Sum Equal to Index | 80.4% | Easy |
| 3551 | Minimum Swaps to Sort by Digit Sum | 50.7% | Med. |
| 3552 | Grid Teleportation Traversal | 23.9% | Med. |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | 50.7% | Hard |
| 3554 | Find Category Recommendation Pairs | 64.1% | Hard |
| 3555 | Smallest Subarray to Sort in Every Sliding Window | 58.3% | Med. |
| 3556 | Sum of Largest Prime Substrings | 38.2% | Med. |
| 3557 | Find Maximum Number of Non Intersecting Substrings | 31.1% | Med. |
| 3558 | Number of Ways to Assign Edge Weights I | 64.0% | Med. |
| 3559 | Number of Ways to Assign Edge Weights II | 72.4% | Hard |
| 3560 | Find Minimum Log Transportation Cost | 42.6% | Easy |
| 3561 | Resulting String After Adjacent Removals | 57.2% | Med. |
| 3562 | Maximum Profit from Trading Stocks with Discounts | 56.5% | Hard |
| 3563 | Lexicographically Smallest String After Adjacent Removals | 17.9% | Hard |
| 3564 | Seasonal Sales Analysis | 62.8% | Med. |
| 3565 | Sequential Grid Path Cover | 60.1% | Med. |
| 3566 | Partition Array into Two Equal Product Subsets | 35.3% | Med. |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | 78.8% | Med. |
| 3568 | Minimum Moves to Clean the Classroom | 27.0% | Med. |
| 3569 | Maximize Count of Distinct Primes After Split | 19.2% | Hard |
| 3570 | Find Books with No Available Copies | 54.3% | Easy |
| 3571 | Find the Shortest Superstring II | 48.3% | Easy |
| 3572 | Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | 63.5% | Med. |
| 3573 | Best Time to Buy and Sell Stock V | 60.6% | Med. |
| 3574 | Maximize Subarray GCD Score | 25.5% | Hard |
| 3575 | Maximum Good Subtree Score | 46.0% | Hard |
| 3576 | Transform Array to All Equal Elements | 33.5% | Med. |
| 3577 | Count the Number of Computer Unlocking Permutations | 58.9% | Med. |
| 3578 | Count Partitions With Max-Min Difference at Most K | 58.4% | Med. |
| 3579 | Minimum Steps to Convert String with Operations | 44.3% | Hard |
| 3580 | Find Consistently Improving Employees | 57.2% | Med. |
| 3581 | Count Odd Letters from Number | 84.6% | Easy |
| 3582 | Generate Tag for Video Caption | 32.6% | Easy |
| 3583 | Count Special Triplets | 47.1% | Med. |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | 31.8% | Med. |
| 3585 | Find Weighted Median Node in Tree | 26.3% | Hard |
| 3586 | Find COVID Recovery Patients | 43.2% | Med. |
| 3587 | Minimum Adjacent Swaps to Alternate Parity | 42.6% | Med. |
| 3588 | Find Maximum Area of a Triangle | 29.8% | Med. |
| 3589 | Count Prime-Gap Balanced Subarrays | 23.8% | Med. |
| 3590 | Kth Smallest Path XOR Sum | 30.7% | Hard |
| 3591 | Check if Any Element Has Prime Frequency | 62.6% | Easy |
| 3592 | Inverse Coin Change | 52.6% | Med. |
| 3593 | Minimum Increments to Equalize Leaf Paths | 41.4% | Med. |
| 3594 | Minimum Time to Transport All Individuals | 28.8% | Hard |
| 3595 | Once Twice | 76.0% | Med. |
| 3596 | Minimum Cost Path with Alternating Directions I | 70.6% | Med. |
| 3597 | Partition String | 59.4% | Med. |
| 3598 | Longest Common Prefix Between Adjacent Strings After Removals | 32.7% | Med. |
| 3599 | Partition Array to Minimize XOR | 41.7% | Med. |
| 3600 | Maximize Spanning Tree Stability with Upgrades | 66.1% | Hard |
| 3601 | Find Drivers with Improved Fuel Efficiency | 47.5% | Med. |
| 3602 | Hexadecimal and Hexatrigesimal Conversion | 81.0% | Easy |
| 3603 | Minimum Cost Path with Alternating Directions II | 45.1% | Med. |
| 3604 | Minimum Time to Reach Destination in Directed Graph | 46.0% | Med. |
| 3605 | Minimum Stability Factor of Array | 20.9% | Hard |
| 3606 | Coupon Code Validator | 64.7% | Easy |
| 3607 | Power Grid Maintenance | 56.1% | Med. |
| 3608 | Minimum Time for K Connected Components | 45.7% | Med. |
| 3609 | Minimum Moves to Reach Target in Grid | 15.4% | Hard |
| 3610 | Minimum Number of Primes to Sum to Target | 59.8% | Med. |
| 3611 | Find Overbooked Employees | 43.9% | Med. |
| 3612 | Process String with Special Operations I | 71.5% | Med. |
| 3613 | Minimize Maximum Component Cost | 43.8% | Med. |
| 3614 | Process String with Special Operations II | 39.8% | Hard |
| 3615 | Longest Palindromic Path in Graph | 22.6% | Hard |
| 3616 | Number of Student Replacements | 85.5% | Med. |
| 3617 | Find Students with Study Spiral Pattern | 24.1% | Hard |
| 3618 | Split Array by Prime Indices | 49.7% | Med. |
| 3619 | Count Islands With Total Value Divisible by K | 56.2% | Med. |
| 3620 | Network Recovery Pathways | 50.8% | Hard |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | 23.2% | Hard |
| 3622 | Check Divisibility by Digit Sum and Product | 69.7% | Easy |
| 3623 | Count Number of Trapezoids I | 48.2% | Med. |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | 59.5% | Hard |
| 3625 | Count Number of Trapezoids II | 39.9% | Hard |
| 3626 | Find Stores with Inventory Imbalance | 49.7% | Med. |
| 3627 | Maximum Median Sum of Subsequences of Size 3 | 65.1% | Med. |
| 3628 | Maximum Number of Subsequences After One Inserting | 32.2% | Med. |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | 44.6% | Med. |
| 3630 | Partition Array for Maximum XOR and AND | 17.9% | Hard |
| 3631 | Sort Threats by Severity and Exploitability | 64.7% | Med. |
| 3632 | Subarrays with XOR at Least K | 45.0% | Hard |
| 3633 | Earliest Finish Time for Land and Water Rides I | 73.0% | Easy |
| 3634 | Minimum Removals to Balance Array | 47.8% | Med. |
| 3635 | Earliest Finish Time for Land and Water Rides II | 64.3% | Med. |
| 3636 | Threshold Majority Queries | 22.5% | Hard |
| 3637 | Trionic Array I | 49.5% | Easy |
| 3638 | Maximum Balanced Shipments | 61.6% | Med. |
| 3639 | Minimum Time to Activate String | 49.3% | Med. |
| 3640 | Trionic Array II | 47.3% | Hard |
| 3641 | Longest Semi-Repeating Subarray | 63.4% | Med. |
| 3642 | Find Books with Polarized Opinions | 43.9% | Med. |
| 3643 | Flip Square Submatrix Vertically | 79.4% | Easy |
| 3644 | Maximum K to Sort a Permutation | 37.6% | Med. |
| 3645 | Maximum Total from Optimal Activation Order | 33.5% | Med. |
| 3646 | Next Special Palindrome Number | 28.3% | Hard |
| 3647 | Maximum Weight in Two Bags | 57.9% | Med. |
| 3648 | Minimum Sensors to Cover Grid | 68.8% | Med. |
| 3649 | Number of Perfect Pairs | 34.5% | Med. |
| 3650 | Minimum Cost Path with Edge Reversals | 61.8% | Med. |
| 3651 | Minimum Cost Path with Teleportations | 45.3% | Hard |
| 3652 | Best Time to Buy and Sell Stock using Strategy | 59.7% | Med. |
| 3653 | XOR After Range Multiplication Queries I | 73.3% | Med. |
| 3654 | Minimum Sum After Divisible Sum Deletions | 46.5% | Med. |
| 3655 | XOR After Range Multiplication Queries II | 47.7% | Hard |
| 3656 | Determine if a Simple Graph Exists | 47.5% | Med. |
| 3657 | Find Loyal Customers | 61.5% | Med. |
| 3658 | GCD of Odd and Even Sums | 89.8% | Easy |
| 3659 | Partition Array Into K-Distinct Groups | 47.2% | Med. |
| 3660 | Jump Game IX | 46.3% | Med. |
| 3661 | Maximum Walls Destroyed by Robots | 48.0% | Hard |
| 3662 | Filter Characters by Frequency | 86.4% | Easy |
| 3663 | Find The Least Frequent Digit | 69.8% | Easy |
| 3664 | Two-Letter Card Game | 13.1% | Med. |
| 3665 | Twisted Mirror Path Count | 47.5% | Med. |
| 3666 | Minimum Operations to Equalize Binary String | 45.1% | Hard |
| 3667 | Sort Array By Absolute Value | 86.7% | Easy |
| 3668 | Restore Finishing Order | 91.4% | Easy |
| 3669 | Balanced K-Factor Decomposition | 40.4% | Med. |
| 3670 | Maximum Product of Two Integers With No Common Bits | 15.4% | Med. |
| 3671 | Sum of Beautiful Subsequences | 31.6% | Hard |
| 3672 | Sum of Weighted Modes in Subarrays | 53.5% | Med. |
| 3673 | Find Zombie Sessions | 49.2% | Hard |
| 3674 | Minimum Operations to Equalize Array | 60.8% | Easy |
| 3675 | Minimum Operations to Transform String | 62.1% | Med. |
| 3676 | Count Bowl Subarrays | 48.6% | Med. |
| 3677 | Count Binary Palindromic Numbers | 33.8% | Hard |
| 3678 | Smallest Absent Positive Greater Than Average | 34.5% | Easy |
| 3679 | Minimum Discards to Balance Inventory | 35.4% | Med. |
| 3680 | Generate Schedule | 25.0% | Med. |
| 3681 | Maximum XOR of Subsequences | 51.6% | Hard |
| 3682 | Minimum Index Sum of Common Elements | 76.8% | Med. |
| 3683 | Earliest Time to Finish One Task | 84.9% | Easy |
| 3684 | Maximize Sum of At Most K Distinct Elements | 77.2% | Easy |
| 3685 | Subsequence Sum After Capping Elements | 25.5% | Med. |
| 3686 | Number of Stable Subsequences | 60.2% | Hard |
| 3687 | Library Late Fee Calculator | 94.5% | Easy |
| 3688 | Bitwise OR of Even Numbers in an Array | 85.3% | Easy |
| 3689 | Maximum Total Subarray Value I | 71.9% | Med. |
| 3690 | Split and Merge Array Transformation | 59.0% | Med. |
| 3691 | Maximum Total Subarray Value II | 41.7% | Hard |
| 3692 | Majority Frequency Characters | 67.3% | Easy |
| 3693 | Climbing Stairs II | 64.5% | Med. |
| 3694 | Distinct Points Reachable After Substring Removal | 54.3% | Med. |
| 3695 | Maximize Alternating Sum Using Swaps | 64.9% | Hard |
| 3696 | Maximum Distance Between Unequal Words in Array I | 82.2% | Easy |
| 3697 | Compute Decimal Representation | 64.9% | Easy |
| 3698 | Split Array With Minimum Difference | 33.6% | Med. |
| 3699 | Number of ZigZag Arrays I | 50.4% | Hard |
| 3700 | Number of ZigZag Arrays II | 67.6% | Hard |
| 3701 | Compute Alternating Sum | 90.2% | Easy |
| 3702 | Longest Subsequence With Non-Zero Bitwise XOR | 37.6% | Med. |
| 3703 | Remove K-Balanced Substrings | 33.0% | Med. |
| 3704 | Count No-Zero Pairs That Sum to N | 15.2% | Hard |
| 3705 | Find Golden Hour Customers | 34.2% | Med. |
| 3706 | Maximum Distance Between Unequal Words in Array II | 72.3% | Med. |
| 3707 | Equal Score Substrings | 57.0% | Easy |
| 3708 | Longest Fibonacci Subarray | 69.7% | Med. |
| 3709 | Design Exam Scores Tracker | 44.4% | Med. |
| 3710 | Maximum Partition Factor | 32.2% | Hard |
| 3711 | Maximum Transactions Without Negative Balance | 46.1% | Med. |
| 3712 | Sum of Elements With Frequency Divisible by K | 78.3% | Easy |
| 3713 | Longest Balanced Substring I | 69.7% | Med. |
| 3714 | Longest Balanced Substring II | 41.9% | Med. |
| 3715 | Sum of Perfect Square Ancestors | 42.8% | Hard |
| 3716 | Find Churn Risk Customers | 46.8% | Med. |
| 3717 | Minimum Operations to Make the Array Beautiful | 37.4% | Med. |
| 3718 | Smallest Missing Multiple of K | 63.4% | Easy |
| 3719 | Longest Balanced Subarray I | 65.7% | Med. |
| 3720 | Lexicographically Smallest Permutation Greater Than Target | 26.9% | Med. |
| 3721 | Longest Balanced Subarray II | 33.8% | Hard |
| 3722 | Lexicographically Smallest String After Reverse | 54.9% | Med. |
| 3723 | Maximize Sum of Squares of Digits | 59.1% | Med. |
| 3724 | Minimum Operations to Transform Array | 40.3% | Med. |
| 3725 | Count Ways to Choose Coprime Integers from Rows | 48.6% | Hard |
| 3726 | Remove Zeros in Decimal Representation | 76.6% | Easy |
| 3727 | Maximum Alternating Sum of Squares | 61.8% | Med. |
| 3728 | Stable Subarrays With Equal Boundary and Interior Sum | 26.5% | Med. |
| 3729 | Count Distinct Subarrays Divisible by K in Sorted Array | 28.2% | Hard |
| 3730 | Maximum Calories Burnt from Jumps | 72.2% | Med. |
| 3731 | Find Missing Elements | 83.4% | Easy |
| 3732 | Maximum Product of Three Elements After One Replacement | 48.0% | Med. |
| 3733 | Minimum Time to Complete All Deliveries | 35.6% | Med. |
| 3734 | Lexicographically Smallest Palindromic Permutation Greater Than Target | 25.6% | Hard |
| 3735 | Lexicographically Smallest String After Reverse II | 48.1% | Hard |
| 3736 | Minimum Moves to Equal Array Elements III | 82.2% | Easy |
| 3737 | Count Subarrays With Majority Element I | 75.7% | Med. |
| 3738 | Longest Non-Decreasing Subarray After Replacing at Most One Element | 22.7% | Med. |
| 3739 | Count Subarrays With Majority Element II | 64.8% | Hard |
| 3740 | Minimum Distance Between Three Equal Elements I | 73.4% | Easy |
| 3741 | Minimum Distance Between Three Equal Elements II | 74.7% | Med. |
| 3742 | Maximum Path Score in a Grid | 53.7% | Med. |
| 3743 | Maximize Cyclic Partition Score | 14.3% | Hard |
| 3744 | Find Kth Character in Expanded String | 57.0% | Med. |
| 3745 | Maximize Expression of Three Elements | 73.0% | Easy |
| 3746 | Minimum String Length After Balanced Removals | 78.5% | Med. |
| 3747 | Count Distinct Integers After Removing Zeros | 23.1% | Med. |
| 3748 | Count Stable Subarrays | 33.0% | Hard |
| 3749 | Evaluate Valid Expressions | 69.6% | Hard |
| 3750 | Minimum Number of Flips to Reverse Binary String | 76.9% | Easy |
| 3751 | Total Waviness of Numbers in Range I | 87.4% | Med. |
| 3752 | Lexicographically Smallest Negated Permutation that Sums to Target | 31.5% | Med. |
| 3753 | Total Waviness of Numbers in Range II | 56.6% | Hard |
| 3754 | Concatenate Non-Zero Digits and Multiply by Sum I | 66.2% | Easy |
| 3755 | Find Maximum Balanced XOR Subarray Length | 51.3% | Med. |
| 3756 | Concatenate Non-Zero Digits and Multiply by Sum II | 42.7% | Med. |
| 3757 | Number of Effective Subsequences | 32.9% | Hard |
| 3758 | Convert Number Words to Digits | 68.4% | Med. |
| 3759 | Count Elements With at Least K Greater Values | 31.9% | Med. |
| 3760 | Maximum Substrings With Distinct Start | 91.5% | Med. |
| 3761 | Minimum Absolute Distance Between Mirror Pairs | 59.2% | Med. |
| 3762 | Minimum Operations to Equalize Subarrays | 20.9% | Hard |
| 3763 | Maximum Total Sum with Threshold Constraints | 82.5% | Med. |
| 3764 | Most Common Course Pairs | 50.5% | Hard |
| 3765 | Complete Prime Number | 36.6% | Med. |
| 3766 | Minimum Operations to Make Binary Palindrome | 52.2% | Med. |
| 3767 | Maximize Points After Choosing K Tasks | 60.3% | Med. |
| 3768 | Minimum Inversion Count in Subarrays of Fixed Length | 42.8% | Hard |
| 3769 | Sort Integers by Binary Reflection | 61.2% | Easy |
| 3770 | Largest Prime from Consecutive Prime Sum | 39.3% | Med. |
| 3771 | Total Score of Dungeon Runs | 31.2% | Med. |
| 3772 | Maximum Subgraph Score in a Tree | 70.9% | Hard |
| 3773 | Maximum Number of Equal Length Runs | 82.4% | Med. |
| 3774 | Absolute Difference Between Maximum and Minimum K Elements | 75.7% | Easy |
| 3775 | Reverse Words With Same Vowel Count | 67.0% | Med. |
| 3776 | Minimum Moves to Balance Circular Array | 40.5% | Med. |
| 3777 | Minimum Deletions to Make Alternating Substring | 45.6% | Hard |
| 3778 | Minimum Distance Excluding One Maximum Weighted Edge | 46.3% | Med. |
| 3779 | Minimum Number of Operations to Have Distinct Elements | 42.6% | Med. |
| 3780 | Maximum Sum of Three Numbers Divisible by Three | 47.6% | Med. |
| 3781 | Maximum Score After Binary Swaps | 35.5% | Med. |
| 3782 | Last Remaining Integer After Alternating Deletion Operations | 49.0% | Hard |
| 3783 | Mirror Distance of an Integer | 91.5% | Easy |
| 3784 | Minimum Deletion Cost to Make All Characters Equal | 55.3% | Med. |
| 3785 | Minimum Swaps to Avoid Forbidden Values | 31.0% | Hard |
| 3786 | Total Sum of Interaction Cost in Tree Groups | 54.5% | Hard |
| 3787 | Find Diameter Endpoints of a Tree | 65.9% | Med. |
| 3788 | Maximum Score of a Split | 52.1% | Med. |
| 3789 | Minimum Cost to Acquire Required Items | 35.2% | Med. |
| 3790 | Smallest All-Ones Multiple | 47.1% | Med. |
| 3791 | Number of Balanced Integers in a Range | 36.2% | Hard |
| 3792 | Sum of Increasing Product Blocks | 67.8% | Med. |
| 3793 | Find Users with High Token Usage | 57.0% | Easy |
| 3794 | Reverse String Prefix | 89.5% | Easy |
| 3795 | Minimum Subarray Length With Distinct Sum At Least K | 32.0% | Med. |
| 3796 | Find Maximum Value in a Constrained Sequence | 62.5% | Med. |
| 3797 | Count Routes to Climb a Rectangular Grid | 25.2% | Hard |
| 3798 | Largest Even Number | 69.3% | Easy |
| 3799 | Word Squares II | 55.2% | Med. |
| 3800 | Minimum Cost to Make Two Binary Strings Equal | 39.7% | Med. |
| 3801 | Minimum Cost to Merge Sorted Lists | 35.3% | Hard |
| 3802 | Number of Ways to Paint Sheets | 67.1% | Hard |
| 3803 | Count Residue Prefixes | 65.9% | Easy |
| 3804 | Number of Centered Subarrays | 67.4% | Med. |
| 3805 | Count Caesar Cipher Pairs | 51.5% | Med. |
| 3806 | Maximum Bitwise AND After Increment Operations | 32.3% | Hard |
| 3807 | Minimum Cost to Repair Edges to Traverse a Graph | 54.9% | Med. |
| 3808 | Find Emotionally Consistent Users | 52.0% | Med. |
| 3809 | Best Reachable Tower | 56.1% | Med. |
| 3810 | Minimum Operations to Reach Target Array | 64.0% | Med. |
| 3811 | Number of Alternating XOR Partitions | 27.3% | Med. |
| 3812 | Minimum Edge Toggles on a Tree | 69.2% | Hard |
| 3813 | Vowel-Consonant Score | 53.8% | Easy |
| 3814 | Maximum Capacity Within Budget | 20.6% | Med. |
| 3815 | Design Auction System | 41.9% | Med. |
| 3816 | Lexicographically Smallest String After Deleting Duplicate Characters | 21.0% | Hard |
| 3817 | Good Indices in a Digit String | 85.5% | Med. |
| 3818 | Minimum Prefix Removal to Make Array Strictly Increasing | 74.1% | Med. |
| 3819 | Rotate Non Negative Elements | 48.1% | Med. |
| 3820 | Pythagorean Distance Nodes in a Tree | 58.0% | Med. |
| 3821 | Find Nth Smallest Integer With K One Bits | 35.4% | Hard |
| 3822 | Design Order Management System | 78.7% | Med. |
| 3823 | Reverse Letters Then Special Characters in a String | 82.3% | Easy |
| 3824 | Minimum K to Reduce Array Within Limit | 41.0% | Med. |
| 3825 | Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND | 50.6% | Med. |
| 3826 | Minimum Partition Score | 33.9% | Hard |
| 3827 | Count Monobit Integers | 66.7% | Easy |
| 3828 | Final Element After Subarray Deletions | 41.0% | Med. |
| 3829 | Design Ride Sharing System | 63.3% | Med. |
| 3830 | Longest Alternating Subarray After Removing At Most One Element | 31.5% | Hard |
| 3831 | Median of a Binary Search Tree Level | 87.3% | Med. |
| 3832 | Find Users with Persistent Behavior Patterns | 48.5% | Hard |
| 3833 | Count Dominant Indices | 66.2% | Easy |
| 3834 | Merge Adjacent Equal Elements | 42.6% | Med. |
| 3835 | Count Subarrays With Cost Less Than or Equal to K | 46.3% | Med. |
| 3836 | Maximum Score Using Exactly K Pairs | 41.8% | Hard |
| 3837 | Delayed Count of Equal Elements | 78.1% | Med. |
| 3838 | Weighted Word Mapping | 90.6% | Easy |
| 3839 | Number of Prefix Connected Groups | 60.7% | Med. |
| 3840 | House Robber V | 53.9% | Med. |
| 3841 | Palindromic Path Queries in a Tree | 37.0% | Hard |
| 3842 | Toggle Light Bulbs | 72.0% | Easy |
| 3843 | First Element with Unique Frequency | 70.3% | Med. |
| 3844 | Longest Almost-Palindromic Substring | 22.8% | Med. |
| 3845 | Maximum Subarray XOR with Bounded Range | 33.3% | Hard |
| 3846 | Total Distance to Type a String Using One Finger | 89.3% | Med. |
| 3847 | Find the Score Difference in a Game | 72.6% | Med. |
| 3848 | Check Digitorial Permutation | 46.9% | Med. |
| 3849 | Maximum Bitwise XOR After Rearrangement | 71.5% | Med. |
| 3850 | Count Sequences to K | 36.2% | Hard |
| 3851 | Maximum Requests Without Violating the Limit | 63.5% | Med. |
| 3852 | Smallest Pair With Different Frequencies | 69.4% | Easy |
| 3853 | Merge Close Characters | 54.8% | Med. |
| 3854 | Minimum Operations to Make Array Parity Alternating | 17.4% | Med. |
| 3855 | Sum of K-Digit Numbers in a Range | 50.8% | Hard |
| 3856 | Trim Trailing Vowels | 77.6% | Easy |
| 3857 | Minimum Cost to Split into Ones | 82.5% | Med. |
| 3858 | Minimum Bitwise OR From Grid | 27.4% | Med. |
| 3859 | Count Subarrays With K Distinct Integers | 20.6% | Hard |
| 3860 | Unique Email Groups | 85.3% | Med. |
| 3861 | Minimum Capacity Box | 72.9% | Easy |
| 3862 | Find the Smallest Balanced Index | 19.5% | Med. |
| 3863 | Minimum Operations to Sort a String | 19.3% | Med. |
| 3864 | Minimum Cost to Partition a Binary String | 52.7% | Hard |
| 3865 | Reverse K Subarrays | 88.3% | Med. |
| 3866 | First Unique Even Element | 66.2% | Easy |
| 3867 | Sum of GCD of Formed Pairs | 75.0% | Med. |
| 3868 | Minimum Cost to Equalize Arrays Using Swaps | 48.9% | Med. |
| 3869 | Count Fancy Numbers in a Range | 27.3% | Hard |
| 3870 | Count Commas in Range | 69.2% | Easy |
| 3871 | Count Commas in Range II | 41.0% | Med. |
| 3872 | Longest Arithmetic Sequence After Changing At Most One Element | 21.6% | Med. |
| 3873 | Maximum Points Activated with One Addition | 44.6% | Hard |
| 3874 | Valid Subarrays With Exactly One Peak | 67.6% | Med. |
| 3875 | Construct Uniform Parity Array I | 76.7% | Easy |
| 3876 | Construct Uniform Parity Array II | 50.3% | Med. |
| 3877 | Minimum Removals to Achieve Target XOR | 41.8% | Med. |
| 3878 | Count Good Subarrays | 25.6% | Hard |
| 3879 | Maximum Distinct Path Sum in a Binary Tree | 51.2% | Med. |
| 3880 | Minimum Absolute Difference Between Two Values | 66.9% | Easy |
| 3881 | Direction Assignments with Exactly K Visible People | 36.4% | Med. |
| 3882 | Minimum XOR Path in a Grid | 39.9% | Med. |
| 3883 | Count Non Decreasing Arrays With Given Digit Sums | 41.7% | Hard |
| 3884 | First Matching Character From Both Ends | 82.2% | Easy |
| 3885 | Design Event Manager | 50.9% | Med. |
| 3886 | Sum of Sortable Integers | 31.7% | Hard |
| 3887 | Incremental Even-Weighted Cycle Queries | 51.9% | Hard |
| 3888 | Minimum Operations to Make All Grid Elements Equal | 62.4% | Hard |
| 3889 | Mirror Frequency Distance | 61.0% | Med. |
| 3890 | Integers With Multiple Sum of Two Cubes | 55.5% | Med. |
| 3891 | Minimum Increase to Maximize Special Indices | 19.9% | Med. |
| 3892 | Minimum Operations to Achieve At Least K Peaks | 30.7% | Hard |
| 3893 | Maximum Team Size with Overlapping Intervals | 43.6% | Med. |
| 3894 | Traffic Signal Color | 83.8% | Easy |
| 3895 | Count Digit Appearances | 86.8% | Med. |
| 3896 | Minimum Operations to Transform Array into Alternating Prime | 53.2% | Med. |
| 3897 | Maximum Value of Concatenated Binary Segments | 26.9% | Hard |
| 3898 | Find the Degree of Each Vertex | 92.6% | Easy |
| 3899 | Angles of a Triangle | 62.3% | Med. |
| 3900 | Longest Balanced Substring After One Swap | 14.0% | Med. |
| 3901 | Good Subsequence Queries | 20.5% | Hard |
| 3902 | Zigzag Level Sum of Binary Tree | 69.3% | Med. |
| 3903 | Smallest Stable Index I | 68.6% | Easy |
| 3904 | Smallest Stable Index II | 73.6% | Med. |
| 3905 | Multi Source Flood Fill | 56.5% | Med. |
| 3906 | Count Good Integers on a Grid Path | 49.2% | Hard |
| 3907 | Count Smaller Elements With Opposite Parity | 73.9% | Med. |
| 3908 | Valid Digit Number | 70.8% | Easy |
| 3909 | Compare Sums of Bitonic Parts | 53.6% | Med. |
| 3910 | Count Connected Subgraphs with Even Node Sum | 62.3% | Hard |
| 3911 | K-th Smallest Remaining Even Integer in Subarray Queries | 29.7% | Hard |
| 3912 | Valid Elements in an Array | 57.3% | Easy |
| 3913 | Sort Vowels by Frequency | 62.9% | Med. |
| 3914 | Minimum Operations to Make Array Non Decreasing | 55.6% | Med. |
| 3915 | Maximum Sum of Alternating Subsequence With Distance at Least K | 32.2% | Hard |
| 3916 | Number of ZigZag Arrays III | 63.9% | Hard |
| 3917 | Count Indices With Opposite Parity | 81.9% | Easy |
| 3918 | Sum of Primes Between Number and Its Reverse | 76.3% | Med. |
| 3919 | Minimum Cost to Move Between Indices | 50.7% | Med. |
| 3920 | Maximize Fixed Points After Deletions | 19.8% | Hard |
| 3921 | Score Validator | 73.7% | Easy |
| 3922 | Minimum Flips to Make Binary String Coherent | 20.0% | Med. |
| 3923 | Minimum Generations to Target Point | 44.2% | Med. |
| 3924 | Minimum Threshold Path With Limited Heavy Edges | 39.9% | Hard |
| 3925 | Concatenate Array With Reverse | 91.8% | Easy |
| 3926 | Count Valid Word Occurrences | 48.4% | Med. |
| 3927 | Minimize Array Sum Using Divisible Replacements | 32.2% | Med. |
| 3928 | Minimum Cost to Buy Apples II | 31.9% | Hard |
| 3929 | Minimum Partition Score II | 44.4% | Hard |
| 3930 | Power Update After K-th Largest Insertion II | 81.2% | Hard |
| 3931 | Check Adjacent Digit Differences | 78.0% | Easy |
| 3932 | Count K-th Roots in a Range | 24.6% | Med. |
| 3933 | Largest Local Values in a Matrix II | 18.7% | Med. |
| 3934 | Smallest Unique Subarray | 40.9% | Hard |
| 3935 | Power Update After K-th Largest Insertion I | 67.9% | Med. |
| 3936 | Minimum Swaps to Move Zeros to End | 60.7% | Easy |
| 3937 | Minimum Operations to Make Array Modulo Alternating I | 46.8% | Med. |
| 3938 | Maximum Path Intersection Sum in a Grid | 25.9% | Med. |
| 3939 | Count Non Adjacent Subsets in a Rooted Tree | 56.1% | Hard |
| 3940 | Limit Occurrences in Sorted Array | 73.4% | Easy |
| 3941 | Password Strength | 75.2% | Med. |
| 3942 | Minimum Operations to Sort a Permutation | 27.7% | Med. |
| 3943 | Number of Pairs After Increment | 20.8% | Hard |
| 3944 | Minimum Operations to Make Array Modulo Alternating II | 64.4% | Hard |
| 3945 | Digit Frequency Score | 91.6% | Easy |
| 3946 | Maximum Number of Items From Sale I | 37.4% | Med. |
| 3947 | Maximum Number of Items From Sale II | 30.3% | Med. |
| 3948 | Lexicographically Maximum MEX Array | 57.2% | Hard |
| 3949 | Subtree Inversion Sum II | 72.3% | Hard |
| 3950 | Exactly One Consecutive Set Bits Pair | 50.9% | Easy |
| 3951 | Minimum Energy to Maintain Brightness | 54.1% | Med. |
| 3952 | Maximum Total Value of Covered Indices | 28.3% | Med. |
| 3953 | Maximum Score with Co-Prime Element | 27.7% | Hard |
| 3954 | Sum of Compatible Numbers in Range I | 58.9% | Easy |
| 3955 | Valid Binary Strings With Cost Limit | 78.9% | Med. |
| 3956 | Maximum Sum of M Non-Overlapping Subarrays I | 26.3% | Hard |
| 3957 | Maximum Sum of M Non-Overlapping Subarrays II | 15.5% | Hard |
| 3958 | Minimum Cost to Split into Ones II | 67.7% | Med. |
| 3959 | Check Good Integer | 83.2% | Easy |
| 3960 | Frequency Balance Subarray | 29.3% | Med. |
| 3961 | Maximize Sum of Device Ratings | 39.4% | Med. |
| 3962 | Maximum Subarray Sum After at Most K Swaps | 14.0% | Hard |
| 3963 | Create Grid With Exactly One Path | 76.3% | Easy |
| 3964 | Minimum Lights to Illuminate a Road | 37.9% | Med. |
| 3965 | Finish Time of Tasks I | 61.8% | Med. |
| 3966 | Count Good Integers in a Range | 52.2% | Hard |
| 3967 | Finish Time of Tasks II | 22.7% | Hard |
| 3968 | Maximum Manhattan Distance After All Moves | 63.6% | Med. |
| 3969 | Valid Subarrays With Matching Sum Digits I | 46.7% | Med. |
| 3970 | Shortest Path With At Most K Consecutive Identical Characters | 45.2% | Med. |
| 3971 | Maximum Total Value | 30.3% | Hard |
| 3972 | Valid Subarrays With Matching Sum Digits II | 33.6% | Hard |
| 3973 | Distinct Gate Paths to LCA | 56.6% | Hard |
| 3974 | Maximum Total Sum of K Selected Elements | 49.4% | Med. |
| 3975 | Filter Occupied Intervals | 46.0% | Med. |
| 3976 | Maximum Subarray Sum After Multiplier | 25.9% | Med. |
| 3977 | Minimum Time to Reach Target With Limited Power | 41.4% | Hard |
| 3978 | Unique Middle Element | 72.3% | Easy |
| 3979 | Maximum Valid Pair Sum | 49.2% | Med. |
| 3980 | Minimum Operations to Transform Binary String | 36.4% | Med. |
| 3981 | Count Distinct Ways to Form Target from Two Strings | 46.5% | Hard |
| 3982 | Sum of Integers with Maximum Digit Range | 72.9% | Easy |
| 3983 | Subsequence After One Replacement | 21.6% | Med. |
| 3984 | Divisible Game | 42.3% | Med. |
| 3985 | Palindromic Subarray Sum | 34.1% | Hard |
| 3986 | Number of Elapsed Seconds Between Two Times | 82.0% | Easy |
| 3987 | Minimum Total Cost to Process All Elements | 24.7% | Med. |
| 3988 | Create Grid With Exactly K Paths I | 32.7% | Med. |
| 3989 | Maximum Consistent Columns in a Grid | 68.7% | Hard |
| 3990 | Create Grid With Exactly K Paths II | 74.2% | Hard |
| 3991 | Sort Array Using Prefix Reversals | 68.9% | Med. |
| 3992 | Rearrange String to Avoid Character Pair | 78.0% | Easy |
| 3993 | Maximum Value of an Alternating Sequence | 31.5% | Med. |
| 3994 | Minimum Adjacent Swaps to Partition Array | 57.3% | Med. |
| 3995 | Minimum Cost to Convert String III | 55.4% | Hard |
| 3996 | Even Number of Knight Moves | 74.7% | Easy |
| 3997 | Count Dominant Nodes in a Binary Tree | 72.1% | Med. |
| 3998 | Transform Binary String Using Subsequence Sort | 37.7% | Med. |
| 3999 | Minimum Number of String Groups Through Transformations | 47.6% | Hard |
| 4000 | Largest Integer With Given Digit Sum | 60.8% | Easy |