2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | Medium |
| 1478 | Allocate Mailboxes | Hard |
| 1480 | Running Sum of 1d Array |
Page 25 of 59
| Easy |
| 1481 | Least Number of Unique Integers after K Removals | Medium |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium |
| 1483 | Kth Ancestor of a Tree Node | Hard |
| 1484 | Group Sold Products By The Date | Easy |
| 1486 | XOR Operation in an Array | Easy |
| 1487 | Making File Names Unique | Medium |
| 1488 | Avoid Flood in The City | Medium |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | Easy |
| 1492 | The kth Factor of n | Medium |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium |
| 1494 | Parallel Courses II | Hard |
| 1496 | Path Crossing | Easy |
| 1497 | Check If Array Pairs Are Divisible by k | Medium |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium |
| 1499 | Max Value of Equation | Hard |
| 1502 | Can Make Arithmetic Progression From Sequence | Easy |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | Medium |
| 1504 | Count Submatrices With All Ones | Medium |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard |
| 1507 | Reformat Date | Easy |
| 1508 | Range Sum of Sorted Subarray Sums | Medium |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium |
| 1510 | Stone Game IV | Hard |
| 1512 | Number of Good Pairs | Easy |
| 1513 | Number of Substrings With Only 1s | Medium |
| 1514 | Path with Maximum Probability | Medium |
| 1515 | Best Position for a Service Centre | Hard |
| 1517 | Find Users With Valid E-Mails | Easy |
| 1518 | Water Bottles | Easy |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium |
| 1520 | Maximum Number of Non-Overlapping Substrings | Hard |
| 1521 | Find a Value of a Mysterious Function Closest to Target | Hard |
| 1523 | Count Odd Numbers in an Interval Range | Easy |
| 1524 | Number of Sub-arrays With Odd Sum | Medium |
| 1525 | Number of Good Ways to Split a String | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard |
| 1527 | Patients With a Condition | Easy |
| 1528 | Shuffle String | Easy |
| 1529 | Minimum Suffix Flips | Medium |
| 1530 | Number of Good Leaf Nodes Pairs | Medium |
| 1531 | String Compression II | Hard |
| 1534 | Count Good Triplets | Easy |
| 1535 | Find the Winner of an Array Game | Medium |
| 1536 | Minimum Swaps to Arrange a Binary Grid | Medium |
| 1537 | Get the Maximum Score | Hard |
| 1539 | Kth Missing Positive Number | Easy |
© 2026 PhantomCodeAI. All rights reserved.