-
If you like, star the original repository https://github.com/kaiwensun/leetcode
-
LeetCode websites
-
This report is generated by janitor.py.
-
Last update: Sunday, September 7, 2025
| Total | Solved | Attempted | US site non-DB unsolved w/o lock (solved rate) | Starred |
|---|---|---|---|---|
| 4071 | 2168 | 6 | 764 (73.16%) | 16 |
| py | ts | java | rb | c | cpp | js | php | kt |
|---|---|---|---|---|---|---|---|---|
| 61.0% | 13.8% | 10.5% | 6.5% | 4.3% | 2.2% | 0.9% | 0.7% | 0.1% |
| 0001-0500 | 0501-1000 | 1001-1500 | 1501-2000 | 2001-2500 | 2501-3000 |
| 3001-3500 | 3501-4000 | ||||
| DD | LCP | LCR | LCS | ιΆθ | ι’θ―ι’ |
The table below lists only the latest 1000 items. Unfortunately, starting from May 2023 GitHub introduced a breaking change to further reduce the rendered blob size. For a full list, check full_table.md.
| Status | # | Title | Question Links | My Solutions | Difficulty (CN) |
|---|---|---|---|---|---|
| βοΈ | 3677 | Count Binary Palindromic Numbers | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3676 | Count Bowl Subarrays | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3675 | Minimum Operations to Transform String | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3674 | Minimum Operations to Equalize Array | πΊπΈ π¨π³ | py | Easy |
| sql | 3673 | Find Zombie Sessions | πΊπΈ π¨π³ | Hard | |
| π | 3672 | Sum of Weighted Modes in Subarrays | πΊπΈ π¨π³ | Medium | |
| 3671 | Sum of Beautiful Subsequences | πΊπΈ π¨π³ | Hard | ||
| 3670 | Maximum Product of Two Integers With No Common Bits | πΊπΈ π¨π³ | Medium | ||
| 3669 | Balanced K-Factor Decomposition | πΊπΈ π¨π³ | Medium | ||
| 3668 | Restore Finishing Order | πΊπΈ π¨π³ | Easy | ||
| π | 3667 | Sort Array By Absolute Value | πΊπΈ π¨π³ | Easy | |
| 3666 | Minimum Operations to Equalize Binary String | πΊπΈ π¨π³ | Hard | ||
| 3665 | Twisted Mirror Path Count | πΊπΈ π¨π³ | Medium | ||
| 3664 | Two-Letter Card Game | πΊπΈ π¨π³ | Medium | ||
| 3663 | Find The Least Frequent Digit | πΊπΈ π¨π³ | Easy | ||
| π | 3662 | Filter Characters by Frequency | πΊπΈ π¨π³ | Easy | |
| βοΈ | 3661 | Maximum Walls Destroyed by Robots | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3660 | Jump Game IX | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3659 | Partition Array Into K-Distinct Groups | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3658 | GCD of Odd and Even Sums | πΊπΈ π¨π³ | py | Easy |
| sql | 3657 | Find Loyal Customers | πΊπΈ π¨π³ | Medium | |
| π | 3656 | Determine if a Simple Graph Exists | πΊπΈ π¨π³ | Medium | |
| 3655 | XOR After Range Multiplication Queries II | πΊπΈ π¨π³ | Hard | ||
| 3654 | Minimum Sum After Divisible Sum Deletions | πΊπΈ π¨π³ | Medium | ||
| 3653 | XOR After Range Multiplication Queries I | πΊπΈ π¨π³ | Medium | ||
| 3652 | Best Time to Buy and Sell Stock using Strategy | πΊπΈ π¨π³ | Medium | ||
| 3651 | Minimum Cost Path with Teleportations | πΊπΈ π¨π³ | Hard | ||
| 3650 | Minimum Cost Path with Edge Reversals | πΊπΈ π¨π³ | Medium | ||
| 3649 | Number of Perfect Pairs | πΊπΈ π¨π³ | Medium | ||
| 3648 | Minimum Sensors to Cover Grid | πΊπΈ π¨π³ | Medium | ||
| π | 3647 | Maximum Weight in Two Bags | πΊπΈ π¨π³ | Medium | |
| 3646 | Next Special Palindrome Number | πΊπΈ π¨π³ | Hard | ||
| 3645 | Maximum Total from Optimal Activation Order | πΊπΈ π¨π³ | Medium | ||
| 3644 | Maximum K to Sort a Permutation | πΊπΈ π¨π³ | Medium | ||
| 3643 | Flip Square Submatrix Vertically | πΊπΈ π¨π³ | Easy | ||
| sql | 3642 | Find Books with Polarized Opinions | πΊπΈ π¨π³ | Easy | |
| π | 3641 | Longest Semi-Repeating Subarray | πΊπΈ π¨π³ | Medium | |
| 3640 | Trionic Array II | πΊπΈ π¨π³ | Hard | ||
| 3639 | Minimum Time to Activate String | πΊπΈ π¨π³ | Medium | ||
| 3638 | Maximum Balanced Shipments | πΊπΈ π¨π³ | Medium | ||
| 3637 | Trionic Array I | πΊπΈ π¨π³ | Easy | ||
| 3636 | Threshold Majority Queries | πΊπΈ π¨π³ | Hard | ||
| 3635 | Earliest Finish Time for Land and Water Rides II | πΊπΈ π¨π³ | Medium | ||
| 3634 | Minimum Removals to Balance Array | πΊπΈ π¨π³ | Medium | ||
| 3633 | Earliest Finish Time for Land and Water Rides I | πΊπΈ π¨π³ | Easy | ||
| π | 3632 | Subarrays with XOR at Least K | πΊπΈ π¨π³ | Hard | |
| π | 3631 | Sort Threats by Severity and Exploitability | πΊπΈ π¨π³ | Medium | |
| 3630 | Partition Array for Maximum XOR and AND | πΊπΈ π¨π³ | Hard | ||
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 3628 | Maximum Number of Subsequences After One Inserting | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3627 | Maximum Median Sum of Subsequences of Size 3 | πΊπΈ π¨π³ | py | Medium |
| sql | 3626 | Find Stores with Inventory Imbalance | πΊπΈ π¨π³ | Medium | |
| βοΈ | 3625 | Count Number of Trapezoids II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3624 | Number of Integers With Popcount-Depth Equal to K II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3623 | Count Number of Trapezoids I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3622 | Check Divisibility by Digit Sum and Product | πΊπΈ π¨π³ | py | Easy |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 3620 | Network Recovery Pathways | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3619 | Count Islands With Total Value Divisible by K | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3618 | Split Array by Prime Indices | πΊπΈ π¨π³ | py | Medium |
| sql | 3617 | Find Students with Study Spiral Pattern | πΊπΈ π¨π³ | Hard | |
| π | 3616 | Number of Student Replacements | πΊπΈ π¨π³ | Medium | |
| 3615 | Longest Palindromic Path in Graph | πΊπΈ π¨π³ | Hard | ||
| 3614 | Process String with Special Operations II | πΊπΈ π¨π³ | Hard | ||
| 3613 | Minimize Maximum Component Cost | πΊπΈ π¨π³ | Medium | ||
| 3612 | Process String with Special Operations I | πΊπΈ π¨π³ | Medium | ||
| sql | 3611 | Find Overbooked Employees | πΊπΈ π¨π³ | Medium | |
| π | 3610 | Minimum Number of Primes to Sum to Target | πΊπΈ π¨π³ | Medium | |
| 3609 | Minimum Moves to Reach Target in Grid | πΊπΈ π¨π³ | Hard | ||
| 3608 | Minimum Time for K Connected Components | πΊπΈ π¨π³ | Medium | ||
| 3607 | Power Grid Maintenance | πΊπΈ π¨π³ | Medium | ||
| 3606 | Coupon Code Validator | πΊπΈ π¨π³ | Easy | ||
| 3605 | Minimum Stability Factor of Array | πΊπΈ π¨π³ | Hard | ||
| 3604 | Minimum Time to Reach Destination in Directed Graph | πΊπΈ π¨π³ | Medium | ||
| 3603 | Minimum Cost Path with Alternating Directions II | πΊπΈ π¨π³ | Medium | ||
| 3602 | Hexadecimal and Hexatrigesimal Conversion | πΊπΈ π¨π³ | Easy | ||
| sql | 3601 | Find Drivers with Improved Fuel Efficiency | πΊπΈ π¨π³ | Medium | |
| 3600 | Maximize Spanning Tree Stability with Upgrades | πΊπΈ π¨π³ | Hard | ||
| 3599 | Partition Array to Minimize XOR | πΊπΈ π¨π³ | Medium | ||
| 3598 | Longest Common Prefix Between Adjacent Strings After Removals | πΊπΈ π¨π³ | Medium | ||
| 3597 | Partition String | πΊπΈ π¨π³ | Medium | ||
| π | 3596 | Minimum Cost Path with Alternating Directions I | πΊπΈ π¨π³ | Medium | |
| π | 3595 | Once Twice | πΊπΈ π¨π³ | Medium | |
| 3594 | Minimum Time to Transport All Individuals | πΊπΈ π¨π³ | Hard | ||
| 3593 | Minimum Increments to Equalize Leaf Paths | πΊπΈ π¨π³ | Medium | ||
| 3592 | Inverse Coin Change | πΊπΈ π¨π³ | Medium | ||
| 3591 | Check if Any Element Has Prime Frequency | πΊπΈ π¨π³ | Easy | ||
| 3590 | Kth Smallest Path XOR Sum | πΊπΈ π¨π³ | Hard | ||
| 3589 | Count Prime-Gap Balanced Subarrays | πΊπΈ π¨π³ | Medium | ||
| 3588 | Find Maximum Area of a Triangle | πΊπΈ π¨π³ | Medium | ||
| 3587 | Minimum Adjacent Swaps to Alternate Parity | πΊπΈ π¨π³ | Medium | ||
| sql | 3586 | Find COVID Recovery Patients | πΊπΈ π¨π³ | Medium | |
| 3585 | Find Weighted Median Node in Tree | πΊπΈ π¨π³ | Hard | ||
| 3584 | Maximum Product of First and Last Elements of a Subsequence | πΊπΈ π¨π³ | Medium | ||
| 3583 | Count Special Triplets | πΊπΈ π¨π³ | Medium | ||
| 3582 | Generate Tag for Video Caption | πΊπΈ π¨π³ | Easy | ||
| π | 3581 | Count Odd Letters from Number | πΊπΈ π¨π³ | Easy | |
| sql | 3580 | Find Consistently Improving Employees | πΊπΈ π¨π³ | Medium | |
| 3579 | Minimum Steps to Convert String with Operations | πΊπΈ π¨π³ | Hard | ||
| 3578 | Count Partitions With Max-Min Difference at Most K | πΊπΈ π¨π³ | Medium | ||
| 3577 | Count the Number of Computer Unlocking Permutations | πΊπΈ π¨π³ | Medium | ||
| 3576 | Transform Array to All Equal Elements | πΊπΈ π¨π³ | Medium | ||
| 3575 | Maximum Good Subtree Score | πΊπΈ π¨π³ | Hard | ||
| 3574 | Maximize Subarray GCD Score | πΊπΈ π¨π³ | Hard | ||
| 3573 | Best Time to Buy and Sell Stock V | πΊπΈ π¨π³ | Medium | ||
| 3572 | Maximize YβSum by Picking a Triplet of Distinct XβValues | πΊπΈ π¨π³ | Medium | ||
| π | 3571 | Find the Shortest Superstring II | πΊπΈ π¨π³ | Easy | |
| sql | 3570 | Find Books with No Available Copies | πΊπΈ π¨π³ | Easy | |
| 3569 | Maximize Count of Distinct Primes After Split | πΊπΈ π¨π³ | Hard | ||
| 3568 | Minimum Moves to Clean the Classroom | πΊπΈ π¨π³ | Medium | ||
| 3567 | Minimum Absolute Difference in Sliding Submatrix | πΊπΈ π¨π³ | Medium | ||
| 3566 | Partition Array into Two Equal Product Subsets | πΊπΈ π¨π³ | Medium | ||
| π | 3565 | Sequential Grid Path Cover | πΊπΈ π¨π³ | Medium | |
| sql | 3564 | Seasonal Sales Analysis | πΊπΈ π¨π³ | Medium | |
| 3563 | Lexicographically Smallest String After Adjacent Removals | πΊπΈ π¨π³ | Hard | ||
| 3562 | Maximum Profit from Trading Stocks with Discounts | πΊπΈ π¨π³ | Hard | ||
| 3561 | Resulting String After Adjacent Removals | πΊπΈ π¨π³ | Medium | ||
| 3560 | Find Minimum Log Transportation Cost | πΊπΈ π¨π³ | Easy | ||
| 3559 | Number of Ways to Assign Edge Weights II | πΊπΈ π¨π³ | Hard | ||
| 3558 | Number of Ways to Assign Edge Weights I | πΊπΈ π¨π³ | Medium | ||
| 3557 | Find Maximum Number of Non Intersecting Substrings | πΊπΈ π¨π³ | Medium | ||
| 3556 | Sum of Largest Prime Substrings | πΊπΈ π¨π³ | Medium | ||
| π | 3555 | Smallest Subarray to Sort in Every Sliding Window | πΊπΈ π¨π³ | Medium | |
| sql | 3554 | Find Category Recommendation Pairs | πΊπΈ π¨π³ | Hard | |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | πΊπΈ π¨π³ | Hard | ||
| 3552 | Grid Teleportation Traversal | πΊπΈ π¨π³ | Medium | ||
| 3551 | Minimum Swaps to Sort by Digit Sum | πΊπΈ π¨π³ | Medium | ||
| 3550 | Smallest Index With Digit Sum Equal to Index | πΊπΈ π¨π³ | Easy | ||
| π | 3549 | Multiply Two Polynomials | πΊπΈ π¨π³ | Hard | |
| 3548 | Equal Sum Grid Partition II | πΊπΈ π¨π³ | Hard | ||
| 3547 | Maximum Sum of Edge Values in a Graph | πΊπΈ π¨π³ | Hard | ||
| 3546 | Equal Sum Grid Partition I | πΊπΈ π¨π³ | Medium | ||
| 3545 | Minimum Deletions for At Most K Distinct Characters | πΊπΈ π¨π³ | Easy | ||
| 3544 | Subtree Inversion Sum | πΊπΈ π¨π³ | Hard | ||
| 3543 | Maximum Weighted K-Edge Path | πΊπΈ π¨π³ | Medium | ||
| 3542 | Minimum Operations to Convert All Elements to Zero | πΊπΈ π¨π³ | Medium | ||
| 3541 | Find Most Frequent Vowel and Consonant | πΊπΈ π¨π³ | Easy | ||
| π | 3540 | Minimum Time to Visit All Houses | πΊπΈ π¨π³ | Medium | |
| 3539 | Find Sum of Array Product of Magical Sequences | πΊπΈ π¨π³ | Hard | ||
| 3538 | Merge Operations for Minimum Travel Time | πΊπΈ π¨π³ | Hard | ||
| 3537 | Fill a Special Grid | πΊπΈ π¨π³ | Medium | ||
| 3536 | Maximum Product of Two Digits | πΊπΈ π¨π³ | Easy | ||
| π | 3535 | Unit Conversion II | πΊπΈ π¨π³ | Medium | |
| 3534 | Path Existence Queries in a Graph II | πΊπΈ π¨π³ | Hard | ||
| 3533 | Concatenated Divisibility | πΊπΈ π¨π³ | Hard | ||
| 3532 | Path Existence Queries in a Graph I | πΊπΈ π¨π³ | Medium | ||
| 3531 | Count Covered Buildings | πΊπΈ π¨π³ | Medium | ||
| 3530 | Maximum Profit from Valid Topological Order in DAG | πΊπΈ π¨π³ | Hard | ||
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | πΊπΈ π¨π³ | Medium | ||
| 3528 | Unit Conversion I | πΊπΈ π¨π³ | Medium | ||
| 3527 | Find the Most Common Response | πΊπΈ π¨π³ | Medium | ||
| π | 3526 | Range XOR Queries with Subarray Reversals | πΊπΈ π¨π³ | Hard | |
| 3525 | Find X Value of Array II | πΊπΈ π¨π³ | Hard | ||
| 3524 | Find X Value of Array I | πΊπΈ π¨π³ | Medium | ||
| 3523 | Make Array Non-decreasing | πΊπΈ π¨π³ | Medium | ||
| 3522 | Calculate Score After Performing Instructions | πΊπΈ π¨π³ | Medium | ||
| sql | 3521 | Find Product Recommendation Pairs | πΊπΈ π¨π³ | Medium | |
| π | 3520 | Minimum Threshold for Inversion Pairs Count | πΊπΈ π¨π³ | Medium | |
| 3519 | Count Numbers with Non-Decreasing Digits | πΊπΈ π¨π³ | Hard | ||
| 3518 | Smallest Palindromic Rearrangement II | πΊπΈ π¨π³ | Hard | ||
| 3517 | Smallest Palindromic Rearrangement I | πΊπΈ π¨π³ | Medium | ||
| 3516 | Find Closest Person | πΊπΈ π¨π³ | Easy | ||
| 3515 | Shortest Path in a Weighted Tree | πΊπΈ π¨π³ | Hard | ||
| 3514 | Number of Unique XOR Triplets II | πΊπΈ π¨π³ | Medium | ||
| 3513 | Number of Unique XOR Triplets I | πΊπΈ π¨π³ | Medium | ||
| 3512 | Minimum Operations to Make Array Sum Divisible by K | πΊπΈ π¨π³ | Easy | ||
| π | 3511 | Make a Positive Array | πΊπΈ π¨π³ | Medium | |
| 3510 | Minimum Pair Removal to Sort Array II | πΊπΈ π¨π³ | Hard | ||
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | πΊπΈ π¨π³ | Hard | ||
| 3508 | Implement Router | πΊπΈ π¨π³ | Medium | ||
| 3507 | Minimum Pair Removal to Sort Array I | πΊπΈ π¨π³ | Easy | ||
| π | 3506 | Find Time Required to Eliminate Bacterial Strains | πΊπΈ π¨π³ | Hard | |
| 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | πΊπΈ π¨π³ | Hard | ||
| 3504 | Longest Palindrome After Substring Concatenation II | πΊπΈ π¨π³ | Hard | ||
| 3503 | Longest Palindrome After Substring Concatenation I | πΊπΈ π¨π³ | Medium | ||
| 3502 | Minimum Cost to Reach Every Position | πΊπΈ π¨π³ | Easy | ||
| 3501 | Maximize Active Section with Trade II | πΊπΈ π¨π³ | Hard | ||
| 3500 | Minimum Cost to Divide Array Into Subarrays | πΊπΈ π¨π³ | Hard | ||
| 3499 | Maximize Active Section with Trade I | πΊπΈ π¨π³ | Medium | ||
| 3498 | Reverse Degree of a String | πΊπΈ π¨π³ | Easy | ||
| sql | 3497 | Analyze Subscription Conversion | πΊπΈ π¨π³ | Medium | |
| π | 3496 | Maximize Score After Pair Deletions | πΊπΈ π¨π³ | Medium | |
| 3495 | Minimum Operations to Make Array Elements Zero | πΊπΈ π¨π³ | Hard | ||
| 3494 | Find the Minimum Amount of Time to Brew Potions | πΊπΈ π¨π³ | Medium | ||
| 3493 | Properties Graph | πΊπΈ π¨π³ | Medium | ||
| 3492 | Maximum Containers on a Ship | πΊπΈ π¨π³ | Easy | ||
| π | 3491 | Phone Number Prefix | πΊπΈ π¨π³ | Easy | |
| 3490 | Count Beautiful Numbers | πΊπΈ π¨π³ | Hard | ||
| 3489 | Zero Array Transformation IV | πΊπΈ π¨π³ | Medium | ||
| 3488 | Closest Equal Element Queries | πΊπΈ π¨π³ | Medium | ||
| 3487 | Maximum Unique Subarray Sum After Deletion | πΊπΈ π¨π³ | Easy | ||
| 3486 | Longest Special Path II | πΊπΈ π¨π³ | Hard | ||
| 3485 | Longest Common Prefix of K Strings After Removal | πΊπΈ π¨π³ | Hard | ||
| 3484 | Design Spreadsheet | πΊπΈ π¨π³ | Medium | ||
| 3483 | Unique 3-Digit Even Numbers | πΊπΈ π¨π³ | Easy | ||
| sql | 3482 | Analyze Organization Hierarchy | πΊπΈ π¨π³ | Hard | |
| π | 3481 | Apply Substitutions | πΊπΈ π¨π³ | Medium | |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | πΊπΈ π¨π³ | Hard | ||
| 3479 | Fruits Into Baskets III | πΊπΈ π¨π³ | Medium | ||
| 3478 | Choose K Elements With Maximum Sum | πΊπΈ π¨π³ | Medium | ||
| 3477 | Fruits Into Baskets II | πΊπΈ π¨π³ | Easy | ||
| π | 3476 | Maximize Profit from Task Assignment | πΊπΈ π¨π³ | Medium | |
| sql | 3475 | DNA Pattern Recognition | πΊπΈ π¨π³ | Medium | |
| 3474 | Lexicographically Smallest Generated String | πΊπΈ π¨π³ | Hard | ||
| 3473 | Sum of K Subarrays With Length at Least M | πΊπΈ π¨π³ | Medium | ||
| 3472 | Longest Palindromic Subsequence After at Most K Operations | πΊπΈ π¨π³ | Medium | ||
| 3471 | Find the Largest Almost Missing Integer | πΊπΈ π¨π³ | Easy | ||
| 3470 | Permutations IV | πΊπΈ π¨π³ | Hard | ||
| 3469 | Find Minimum Cost to Remove Array Elements | πΊπΈ π¨π³ | Medium | ||
| 3468 | Find the Number of Copy Arrays | πΊπΈ π¨π³ | Medium | ||
| 3467 | Transform Array by Parity | πΊπΈ π¨π³ | Easy | ||
| π | 3466 | Maximum Coin Collection | πΊπΈ π¨π³ | Medium | |
| sql | 3465 | Find Products with Valid Serial Numbers | πΊπΈ π¨π³ | Easy | |
| 3464 | Maximize the Distance Between Points on a Square | πΊπΈ π¨π³ | Hard | ||
| 3463 | Check If Digits Are Equal in String After Operations II | πΊπΈ π¨π³ | Hard | ||
| 3462 | Maximum Sum With at Most K Elements | πΊπΈ π¨π³ | Medium | ||
| 3461 | Check If Digits Are Equal in String After Operations I | πΊπΈ π¨π³ | Easy | ||
| π | 3460 | Longest Common Prefix After at Most One Removal | πΊπΈ π¨π³ | Medium | |
| 3459 | Length of Longest V-Shaped Diagonal Segment | πΊπΈ π¨π³ | Hard | ||
| 3458 | Select K Disjoint Special Substrings | πΊπΈ π¨π³ | Medium | ||
| 3457 | Eat Pizzas! | πΊπΈ π¨π³ | Medium | ||
| 3456 | Find Special Substring of Length K | πΊπΈ π¨π³ | Easy | ||
| 3455 | Shortest Matching Substring | πΊπΈ π¨π³ | Hard | ||
| 3454 | Separate Squares II | πΊπΈ π¨π³ | Hard | ||
| 3453 | Separate Squares I | πΊπΈ π¨π³ | Medium | ||
| 3452 | Sum of Good Numbers | πΊπΈ π¨π³ | Easy | ||
| sql | 3451 | Find Invalid IP Addresses | πΊπΈ π¨π³ | Hard | |
| π | 3450 | Maximum Students on a Single Bench | πΊπΈ π¨π³ | Easy | |
| 3449 | Maximize the Minimum Game Score | πΊπΈ π¨π³ | Hard | ||
| 3448 | Count Substrings Divisible By Last Digit | πΊπΈ π¨π³ | Hard | ||
| 3447 | Assign Elements to Groups with Constraints | πΊπΈ π¨π³ | Medium | ||
| 3446 | Sort Matrix by Diagonals | πΊπΈ π¨π³ | Medium | ||
| 3445 | Maximum Difference Between Even and Odd Frequency II | πΊπΈ π¨π³ | Hard | ||
| 3444 | Minimum Increments for Target Multiples in an Array | πΊπΈ π¨π³ | Hard | ||
| 3443 | Maximum Manhattan Distance After K Changes | πΊπΈ π¨π³ | Medium | ||
| 3442 | Maximum Difference Between Even and Odd Frequency I | πΊπΈ π¨π³ | Easy | ||
| 3441 | Minimum Cost Good Caption | πΊπΈ π¨π³ | Hard | ||
| 3440 | Reschedule Meetings for Maximum Free Time II | πΊπΈ π¨π³ | Medium | ||
| 3439 | Reschedule Meetings for Maximum Free Time I | πΊπΈ π¨π³ | Medium | ||
| 3438 | Find Valid Pair of Adjacent Digits in String | πΊπΈ π¨π³ | Easy | ||
| π | 3437 | Permutations III | πΊπΈ π¨π³ | Medium | |
| sql | 3436 | Find Valid Emails | πΊπΈ π¨π³ | Easy | |
| 3435 | Frequencies of Shortest Supersequences | πΊπΈ π¨π³ | Hard | ||
| 3434 | Maximum Frequency After Subarray Operation | πΊπΈ π¨π³ | Medium | ||
| 3433 | Count Mentions Per User | πΊπΈ π¨π³ | Medium | ||
| 3432 | Count Partitions with Even Sum Difference | πΊπΈ π¨π³ | Easy | ||
| π | 3431 | Minimum Unlocked Indices to Sort Nums | πΊπΈ π¨π³ | Medium | |
| 3430 | Maximum and Minimum Sums of at Most Size K Subarrays | πΊπΈ π¨π³ | Hard | ||
| 3429 | Paint House IV | πΊπΈ π¨π³ | Medium | ||
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | πΊπΈ π¨π³ | Medium | ||
| 3427 | Sum of Variable Length Subarrays | πΊπΈ π¨π³ | Easy | ||
| 3426 | Manhattan Distances of All Arrangements of Pieces | πΊπΈ π¨π³ | Hard | ||
| 3425 | Longest Special Path | πΊπΈ π¨π³ | Hard | ||
| 3424 | Minimum Cost to Make Arrays Identical | πΊπΈ π¨π³ | Medium | ||
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | πΊπΈ π¨π³ | Easy | ||
| π | 3422 | Minimum Operations to Make Subarray Elements Equal | πΊπΈ π¨π³ | Medium | |
| sql | 3421 | Find Students Who Improved | πΊπΈ π¨π³ | Medium | |
| 3420 | Count Non-Decreasing Subarrays After K Operations | πΊπΈ π¨π³ | Hard | ||
| 3419 | Minimize the Maximum Edge Weight of Graph | πΊπΈ π¨π³ | Medium | ||
| 3418 | Maximum Amount of Money Robot Can Earn | πΊπΈ π¨π³ | Medium | ||
| 3417 | Zigzag Grid Traversal With Skip | πΊπΈ π¨π³ | Easy | ||
| π | 3416 | Subsequences with a Unique Middle Mode II | πΊπΈ π¨π³ | Hard | |
| π sql | 3415 | Find Products with Three Consecutive Digits | πΊπΈ π¨π³ | Easy | |
| 3414 | Maximum Score of Non-overlapping Intervals | πΊπΈ π¨π³ | Hard | ||
| 3413 | Maximum Coins From K Consecutive Bags | πΊπΈ π¨π³ | Medium | ||
| 3412 | Find Mirror Score of a String | πΊπΈ π¨π³ | Medium | ||
| 3411 | Maximum Subarray With Equal Products | πΊπΈ π¨π³ | Easy | ||
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | πΊπΈ π¨π³ | Hard | ||
| 3409 | Longest Subsequence With Decreasing Adjacent Difference | πΊπΈ π¨π³ | Medium | ||
| 3408 | Design Task Manager | πΊπΈ π¨π³ | Medium | ||
| 3407 | Substring Matching Pattern | πΊπΈ π¨π³ | Easy | ||
| π | 3406 | Find the Lexicographically Largest String From the Box II | πΊπΈ π¨π³ | Hard | |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | πΊπΈ π¨π³ | Hard | ||
| 3404 | Count Special Subsequences | πΊπΈ π¨π³ | Medium | ||
| 3403 | Find the Lexicographically Largest String From the Box I | πΊπΈ π¨π³ | Medium | ||
| 3402 | Minimum Operations to Make Columns Strictly Increasing | πΊπΈ π¨π³ | Easy | ||
| π sql | 3401 | Find Circular Gift Exchange Chains | πΊπΈ π¨π³ | Hard | |
| π | 3400 | Maximum Number of Matching Indices After Right Shifts | πΊπΈ π¨π³ | Medium | |
| 3399 | Smallest Substring With Identical Characters II | πΊπΈ π¨π³ | Hard | ||
| 3398 | Smallest Substring With Identical Characters I | πΊπΈ π¨π³ | Hard | ||
| 3397 | Maximum Number of Distinct Elements After Operations | πΊπΈ π¨π³ | Medium | ||
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | πΊπΈ π¨π³ | Easy | ||
| 3395 | Subsequences with a Unique Middle Mode I | πΊπΈ π¨π³ | Hard | ||
| 3394 | Check if Grid can be Cut into Sections | πΊπΈ π¨π³ | Medium | ||
| 3393 | Count Paths With the Given XOR Value | πΊπΈ π¨π³ | Medium | ||
| 3392 | Count Subarrays of Length Three With a Condition | πΊπΈ π¨π³ | Easy | ||
| π | 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | πΊπΈ π¨π³ | Medium | |
| π sql | 3390 | Longest Team Pass Streak | πΊπΈ π¨π³ | Hard | |
| 3389 | Minimum Operations to Make Character Frequencies Equal | πΊπΈ π¨π³ | Hard | ||
| 3388 | Count Beautiful Splits in an Array | πΊπΈ π¨π³ | Medium | ||
| 3387 | Maximize Amount After Two Days of Conversions | πΊπΈ π¨π³ | Medium | ||
| 3386 | Button with Longest Push Time | πΊπΈ π¨π³ | Easy | ||
| π | 3385 | Minimum Time to Break Locks II | πΊπΈ π¨π³ | Hard | |
| π sql | 3384 | Team Dominance by Pass Success | πΊπΈ π¨π³ | Hard | |
| π | 3383 | Minimum Runes to Add to Cast Spell | πΊπΈ π¨π³ | Hard | |
| 3382 | Maximum Area Rectangle With Point Constraints II | πΊπΈ π¨π³ | Hard | ||
| 3381 | Maximum Subarray Sum With Length Divisible by K | πΊπΈ π¨π³ | Medium | ||
| 3380 | Maximum Area Rectangle With Point Constraints I | πΊπΈ π¨π³ | Medium | ||
| 3379 | Transformed Array | πΊπΈ π¨π³ | Easy | ||
| 3378 | Count Connected Components in LCM Graph | πΊπΈ π¨π³ | Hard | ||
| 3377 | Digit Operations to Make Two Integers Equal | πΊπΈ π¨π³ | Medium | ||
| 3376 | Minimum Time to Break Locks I | πΊπΈ π¨π³ | Medium | ||
| 3375 | Minimum Operations to Make Array Values Equal to K | πΊπΈ π¨π³ | Easy | ||
| sql | 3374 | First Letter Capitalization II | πΊπΈ π¨π³ | Hard | |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | πΊπΈ π¨π³ | Hard | ||
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | πΊπΈ π¨π³ | Medium | ||
| 3371 | Identify the Largest Outlier in an Array | πΊπΈ π¨π³ | Medium | ||
| 3370 | Smallest Number With All Set Bits | πΊπΈ π¨π³ | Easy | ||
| π | 3369 | Design an Array Statistics Tracker | πΊπΈ π¨π³ | Hard | |
| π sql | 3368 | First Letter Capitalization | πΊπΈ π¨π³ | Hard | |
| 3367 | Maximize Sum of Weights after Edge Removals | πΊπΈ π¨π³ | Hard | ||
| 3366 | Minimum Array Sum | πΊπΈ π¨π³ | Medium | ||
| 3365 | Rearrange K Substrings to Form Target String | πΊπΈ π¨π³ | Medium | ||
| 3364 | Minimum Positive Sum Subarray | πΊπΈ π¨π³ | Easy | ||
| 3363 | Find the Maximum Number of Fruits Collected | πΊπΈ π¨π³ | Hard | ||
| 3362 | Zero Array Transformation III | πΊπΈ π¨π³ | Medium | ||
| 3361 | Shift Distance Between Two Strings | πΊπΈ π¨π³ | Medium | ||
| 3360 | Stone Removal Game | πΊπΈ π¨π³ | Easy | ||
| π | 3359 | Find Sorted Submatrices With Maximum Element at Most K | πΊπΈ π¨π³ | Hard | |
| π sql | 3358 | Books with NULL Ratings | πΊπΈ π¨π³ | Easy | |
| 3357 | Minimize the Maximum Adjacent Element Difference | πΊπΈ π¨π³ | Hard | ||
| 3356 | Zero Array Transformation II | πΊπΈ π¨π³ | Medium | ||
| 3355 | Zero Array Transformation I | πΊπΈ π¨π³ | Medium | ||
| 3354 | Make Array Elements Equal to Zero | πΊπΈ π¨π³ | Easy | ||
| π | 3353 | Minimum Total Operations | πΊπΈ π¨π³ | Easy | |
| 3352 | Count K-Reducible Numbers Less Than N | πΊπΈ π¨π³ | Hard | ||
| 3351 | Sum of Good Subsequences | πΊπΈ π¨π³ | Hard | ||
| 3350 | Adjacent Increasing Subarrays Detection II | πΊπΈ π¨π³ | Medium | ||
| 3349 | Adjacent Increasing Subarrays Detection I | πΊπΈ π¨π³ | Easy | ||
| 3348 | Smallest Divisible Digit Product II | πΊπΈ π¨π³ | Hard | ||
| 3347 | Maximum Frequency of an Element After Performing Operations II | πΊπΈ π¨π³ | Hard | ||
| 3346 | Maximum Frequency of an Element After Performing Operations I | πΊπΈ π¨π³ | Medium | ||
| 3345 | Smallest Divisible Digit Product I | πΊπΈ π¨π³ | Easy | ||
| π | 3344 | Maximum Sized Array | πΊπΈ π¨π³ | Medium | |
| 3343 | Count Number of Balanced Permutations | πΊπΈ π¨π³ | Hard | ||
| 3342 | Find Minimum Time to Reach Last Room II | πΊπΈ π¨π³ | Medium | ||
| 3341 | Find Minimum Time to Reach Last Room I | πΊπΈ π¨π³ | Medium | ||
| 3340 | Check Balanced String | πΊπΈ π¨π³ | Easy | ||
| π | 3339 | Find the Number of K-Even Arrays | πΊπΈ π¨π³ | Medium | |
| π sql | 3338 | Second Highest Salary II | πΊπΈ π¨π³ | Medium | |
| 3337 | Total Characters in String After Transformations II | πΊπΈ π¨π³ | Hard | ||
| 3336 | Find the Number of Subsequences With Equal GCD | πΊπΈ π¨π³ | Hard | ||
| 3335 | Total Characters in String After Transformations I | πΊπΈ π¨π³ | Medium | ||
| 3334 | Find the Maximum Factor Score of Array | πΊπΈ π¨π³ | Medium | ||
| 3333 | Find the Original Typed String II | πΊπΈ π¨π³ | Hard | ||
| 3332 | Maximum Points Tourist Can Earn | πΊπΈ π¨π³ | Medium | ||
| 3331 | Find Subtree Sizes After Changes | πΊπΈ π¨π³ | Medium | ||
| 3330 | Find the Original Typed String I | πΊπΈ π¨π³ | Easy | ||
| π | 3329 | Count Substrings With K-Frequency Characters II | πΊπΈ π¨π³ | Hard | |
| π sql | 3328 | Find Cities in Each State II | πΊπΈ π¨π³ | Medium | |
| 3327 | Check if DFS Strings Are Palindromes | πΊπΈ π¨π³ | Hard | ||
| 3326 | Minimum Division Operations to Make Array Non Decreasing | πΊπΈ π¨π³ | Medium | ||
| 3325 | Count Substrings With K-Frequency Characters I | πΊπΈ π¨π³ | Medium | ||
| 3324 | Find the Sequence of Strings Appeared on the Screen | πΊπΈ π¨π³ | Medium | ||
| π | 3323 | Minimize Connected Groups by Inserting Interval | πΊπΈ π¨π³ | Medium | |
| π sql | 3322 | Premier League Table Ranking III | πΊπΈ π¨π³ | Medium | |
| 3321 | Find X-Sum of All K-Long Subarrays II | πΊπΈ π¨π³ | Hard | ||
| 3320 | Count The Number of Winning Sequences | πΊπΈ π¨π³ | Hard | ||
| 3319 | K-th Largest Perfect Subtree Size in Binary Tree | πΊπΈ π¨π³ | Medium | ||
| 3318 | Find X-Sum of All K-Long Subarrays I | πΊπΈ π¨π³ | Easy | ||
| 3317 | Find the Number of Possible Ways for an Event | πΊπΈ π¨π³ | Hard | ||
| 3316 | Find Maximum Removals From Source String | πΊπΈ π¨π³ | Medium | ||
| 3315 | Construct the Minimum Bitwise Array II | πΊπΈ π¨π³ | Medium | ||
| 3314 | Construct the Minimum Bitwise Array I | πΊπΈ π¨π³ | Easy | ||
| π | 3313 | Find the Last Marked Nodes in Tree | πΊπΈ π¨π³ | Hard | |
| 3312 | Sorted GCD Pair Queries | πΊπΈ π¨π³ | Hard | ||
| 3311 | Construct 2D Grid Matching Graph Layout | πΊπΈ π¨π³ | Hard | ||
| 3310 | Remove Methods From Project | πΊπΈ π¨π³ | Medium | ||
| 3309 | Maximum Possible Number by Binary Concatenation | πΊπΈ π¨π³ | Medium | ||
| π sql | 3308 | Find Top Performing Driver | πΊπΈ π¨π³ | Medium | |
| 3307 | Find the K-th Character in String Game II | πΊπΈ π¨π³ | Hard | ||
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | πΊπΈ π¨π³ | Medium | ||
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | πΊπΈ π¨π³ | Medium | ||
| 3304 | Find the K-th Character in String Game I | πΊπΈ π¨π³ | Easy | ||
| 3303 | Find the Occurrence of First Almost Equal Substring | πΊπΈ π¨π³ | Hard | ||
| 3302 | Find the Lexicographically Smallest Valid Sequence | πΊπΈ π¨π³ | Medium | ||
| 3301 | Maximize the Total Height of Unique Towers | πΊπΈ π¨π³ | Medium | ||
| 3300 | Minimum Element After Replacement With Digit Sum | πΊπΈ π¨π³ | Easy | ||
| π | 3299 | Sum of Consecutive Subsequences | πΊπΈ π¨π³ | Hard | |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | πΊπΈ π¨π³ | Hard | ||
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | πΊπΈ π¨π³ | Medium | ||
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | πΊπΈ π¨π³ | Medium | ||
| 3295 | Report Spam Message | πΊπΈ π¨π³ | Medium | ||
| π | 3294 | Convert Doubly Linked List to Array II | πΊπΈ π¨π³ | Medium | |
| π sql | 3293 | Calculate Product Final Price | πΊπΈ π¨π³ | Medium | |
| 3292 | Minimum Number of Valid Strings to Form Target II | πΊπΈ π¨π³ | Hard | ||
| 3291 | Minimum Number of Valid Strings to Form Target I | πΊπΈ π¨π³ | Medium | ||
| 3290 | Maximum Multiplication Score | πΊπΈ π¨π³ | Medium | ||
| 3289 | The Two Sneaky Numbers of Digitville | πΊπΈ π¨π³ | Easy | ||
| 3288 | Length of the Longest Increasing Path | πΊπΈ π¨π³ | Hard | ||
| 3287 | Find the Maximum Sequence Value of Array | πΊπΈ π¨π³ | Hard | ||
| 3286 | Find a Safe Walk Through a Grid | πΊπΈ π¨π³ | Medium | ||
| 3285 | Find Indices of Stable Mountains | πΊπΈ π¨π³ | Easy | ||
| π | 3284 | Sum of Consecutive Subarrays | πΊπΈ π¨π³ | Medium | |
| 3283 | Maximum Number of Moves to Kill All Pawns | πΊπΈ π¨π³ | Hard | ||
| 3282 | Reach End of Array With Max Score | πΊπΈ π¨π³ | Medium | ||
| 3281 | Maximize Score of Numbers in Ranges | πΊπΈ π¨π³ | Medium | ||
| 3280 | Convert Date to Binary | πΊπΈ π¨π³ | Easy | ||
| π | 3279 | Maximum Total Area Occupied by Pistons | πΊπΈ π¨π³ | Hard | |
| π sql | 3278 | Find Candidates for Data Scientist Position II | πΊπΈ π¨π³ | Medium | |
| 3277 | Maximum XOR Score Subarray Queries | πΊπΈ π¨π³ | Hard | ||
| 3276 | Select Cells in Grid With Maximum Score | πΊπΈ π¨π³ | Hard | ||
| 3275 | K-th Nearest Obstacle Queries | πΊπΈ π¨π³ | Medium | ||
| 3274 | Check if Two Chessboard Squares Have the Same Color | πΊπΈ π¨π³ | Easy | ||
| 3273 | Minimum Amount of Damage Dealt to Bob | πΊπΈ π¨π³ | Hard | ||
| 3272 | Find the Count of Good Integers | πΊπΈ π¨π³ | Hard | ||
| 3271 | Hash Divided String | πΊπΈ π¨π³ | Medium | ||
| 3270 | Find the Key of the Numbers | πΊπΈ π¨π³ | Easy | ||
| π | 3269 | Constructing Two Increasing Arrays | πΊπΈ π¨π³ | Hard | |
| π sql | 3268 | Find Overlapping Shifts II | πΊπΈ π¨π³ | Hard | |
| 3267 | Count Almost Equal Pairs II | πΊπΈ π¨π³ | Hard | ||
| 3266 | Final Array State After K Multiplication Operations II | πΊπΈ π¨π³ | Hard | ||
| 3265 | Count Almost Equal Pairs I | πΊπΈ π¨π³ | Medium | ||
| 3264 | Final Array State After K Multiplication Operations I | πΊπΈ π¨π³ | Easy | ||
| π | 3263 | Convert Doubly Linked List to Array I | πΊπΈ π¨π³ | Easy | |
| π sql | 3262 | Find Overlapping Shifts | πΊπΈ π¨π³ | Medium | |
| 3261 | Count Substrings That Satisfy K-Constraint II | πΊπΈ π¨π³ | Hard | ||
| 3260 | Find the Largest Palindrome Divisible by K | πΊπΈ π¨π³ | Hard | ||
| 3259 | Maximum Energy Boost From Two Drinks | πΊπΈ π¨π³ | Medium | ||
| 3258 | Count Substrings That Satisfy K-Constraint I | πΊπΈ π¨π³ | Easy | ||
| 3257 | Maximum Value Sum by Placing Three Rooks II | πΊπΈ π¨π³ | Hard | ||
| 3256 | Maximum Value Sum by Placing Three Rooks I | πΊπΈ π¨π³ | Hard | ||
| 3255 | Find the Power of K-Size Subarrays II | πΊπΈ π¨π³ | Medium | ||
| 3254 | Find the Power of K-Size Subarrays I | πΊπΈ π¨π³ | Medium | ||
| π | 3253 | Construct String with Minimum Cost (Easy) | πΊπΈ π¨π³ | Medium | |
| π sql | 3252 | Premier League Table Ranking II | πΊπΈ π¨π³ | Medium | |
| 3251 | Find the Count of Monotonic Pairs II | πΊπΈ π¨π³ | Hard | ||
| 3250 | Find the Count of Monotonic Pairs I | πΊπΈ π¨π³ | Hard | ||
| 3249 | Count the Number of Good Nodes | πΊπΈ π¨π³ | Medium | ||
| 3248 | Snake in Matrix | πΊπΈ π¨π³ | Easy | ||
| π | 3247 | Number of Subsequences with Odd Sum | πΊπΈ π¨π³ | Medium | |
| π sql | 3246 | Premier League Table Ranking | πΊπΈ π¨π³ | Easy | |
| 3245 | Alternating Groups III | πΊπΈ π¨π³ | Hard | ||
| 3244 | Shortest Distance After Road Addition Queries II | πΊπΈ π¨π³ | Hard | ||
| 3243 | Shortest Distance After Road Addition Queries I | πΊπΈ π¨π³ | Medium | ||
| 3242 | Design Neighbor Sum Service | πΊπΈ π¨π³ | Easy | ||
| 3241 | Time Taken to Mark All Nodes | πΊπΈ π¨π³ | Hard | ||
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | πΊπΈ π¨π³ | Medium | ||
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | πΊπΈ π¨π³ | Medium | ||
| 3238 | Find the Number of Winning Players | πΊπΈ π¨π³ | Easy | ||
| π | 3237 | Alt and Tab Simulation | πΊπΈ π¨π³ | Medium | |
| π sql | 3236 | CEO Subordinate Hierarchy | πΊπΈ π¨π³ | Hard | |
| βοΈ | 3235 | Check if the Rectangle Corner Is Reachable | πΊπΈ π¨π³ | py | Hard |
| 3234 | Count the Number of Substrings With Dominant Ones | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 3233 | Find the Count of Numbers Which Are Not Special | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3232 | Find if Digit Game Can Be Won | πΊπΈ π¨π³ | py | Easy |
| π | 3231 | Minimum Number of Increasing Subsequence to Be Removed | πΊπΈ π¨π³ | Hard | |
| π sql | 3230 | Customer Purchasing Behavior Analysis | πΊπΈ π¨π³ | Medium | |
| 3229 | Minimum Operations to Make Array Equal to Target | πΊπΈ π¨π³ | Hard | ||
| 3228 | Maximum Number of Operations to Move Ones to the End | πΊπΈ π¨π³ | Medium | ||
| 3227 | Vowels Game in a String | πΊπΈ π¨π³ | Medium | ||
| 3226 | Number of Bit Changes to Make Two Integers Equal | πΊπΈ π¨π³ | Easy | ||
| 3225 | Maximum Score From Grid Operations | πΊπΈ π¨π³ | Hard | ||
| 3224 | Minimum Array Changes to Make Differences Equal | πΊπΈ π¨π³ | Medium | ||
| 3223 | Minimum Length of String After Operations | πΊπΈ π¨π³ | Medium | ||
| 3222 | Find the Winning Player in Coin Game | πΊπΈ π¨π³ | Easy | ||
| π | 3221 | Maximum Array Hopping Score II | πΊπΈ π¨π³ | Medium | |
| sql | 3220 | Odd and Even Transactions | πΊπΈ π¨π³ | Medium | |
| 3219 | Minimum Cost for Cutting Cake II | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 3218 | Minimum Cost for Cutting Cake I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3217 | Delete Nodes From Linked List Present in Array | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3216 | Lexicographically Smallest String After a Swap | πΊπΈ π¨π³ | py | Easy |
| π | 3215 | Count Triplets with Even XOR Set Bits II | πΊπΈ π¨π³ | Medium | |
| π sql | 3214 | Year on Year Growth Rate | πΊπΈ π¨π³ | Hard | |
| 3213 | Construct String with Minimum Cost | πΊπΈ π¨π³ | Hard | ||
| 3212 | Count Submatrices With Equal Frequency of X and Y | πΊπΈ π¨π³ | Medium | ||
| 3211 | Generate Binary Strings Without Adjacent Zeros | πΊπΈ π¨π³ | Medium | ||
| 3210 | Find the Encrypted String | πΊπΈ π¨π³ | Easy | ||
| 3209 | Number of Subarrays With AND Value of K | πΊπΈ π¨π³ | Hard | ||
| 3208 | Alternating Groups II | πΊπΈ π¨π³ | Medium | ||
| 3207 | Maximum Points After Enemy Battles | πΊπΈ π¨π³ | Medium | ||
| 3206 | Alternating Groups I | πΊπΈ π¨π³ | Easy | ||
| π | 3205 | Maximum Array Hopping Score I | πΊπΈ π¨π³ | Medium | |
| π sql | 3204 | Bitwise User Permissions Analysis | πΊπΈ π¨π³ | Medium | |
| βοΈ | 3203 | Find Minimum Diameter After Merging Two Trees | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3202 | Find the Maximum Length of Valid Subsequence II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3201 | Find the Maximum Length of Valid Subsequence I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3200 | Maximum Height of a Triangle | πΊπΈ π¨π³ | py | Easy |
| π | 3199 | Count Triplets with Even XOR Set Bits I | πΊπΈ π¨π³ | Easy | |
| π sql | 3198 | Find Cities in Each State | πΊπΈ π¨π³ | Easy | |
| 3197 | Find the Minimum Area to Cover All Ones II | πΊπΈ π¨π³ | Hard | ||
| 3196 | Maximize Total Cost of Alternating Subarrays | πΊπΈ π¨π³ | Medium | ||
| 3195 | Find the Minimum Area to Cover All Ones I | πΊπΈ π¨π³ | Medium | ||
| 3194 | Minimum Average of Smallest and Largest Elements | πΊπΈ π¨π³ | Easy | ||
| 3193 | Count the Number of Inversions | πΊπΈ π¨π³ | Hard | ||
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | πΊπΈ π¨π³ | Medium | ||
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | πΊπΈ π¨π³ | Medium | ||
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | πΊπΈ π¨π³ | Easy | ||
| π | 3189 | Minimum Moves to Get a Peaceful Board | πΊπΈ π¨π³ | Medium | |
| π sql | 3188 | Find Top Scoring Students II | πΊπΈ π¨π³ | Hard | |
| βοΈ | 3187 | Peaks in Array | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3186 | Maximum Total Damage With Spell Casting | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3185 | Count Pairs That Form a Complete Day II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3184 | Count Pairs That Form a Complete Day I | πΊπΈ π¨π³ | py | Easy |
| π | 3183 | The Number of Ways to Make the Sum | πΊπΈ π¨π³ | Medium | |
| π sql | 3182 | Find Top Scoring Students | πΊπΈ π¨π³ | Medium | |
| βοΈ | 3181 | Maximum Total Reward Using Operations II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3180 | Maximum Total Reward Using Operations I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3179 | Find the N-th Value After K Seconds | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3178 | Find the Child Who Has the Ball After K Seconds | πΊπΈ π¨π³ | kt | Easy |
| 3177 | Find the Maximum Length of a Good Subsequence II | πΊπΈ π¨π³ | Hard | ||
| 3176 | Find the Maximum Length of a Good Subsequence I | πΊπΈ π¨π³ | Medium | ||
| 3175 | Find The First Player to win K Games in a Row | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 3174 | Clear Digits | πΊπΈ π¨π³ | kt | Easy |
| π | 3173 | Bitwise OR of Adjacent Elements | πΊπΈ π¨π³ | Easy | |
| π sql | 3172 | Second Day Verification | πΊπΈ π¨π³ | Easy | |
| βοΈ | 3171 | Find Subarray With Bitwise OR Closest to K | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3170 | Lexicographically Minimum String After Removing Stars | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3169 | Count Days Without Meetings | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3168 | Minimum Number of Chairs in a Waiting Room | πΊπΈ π¨π³ | py | Easy |
| π | 3167 | Better Compression of String | πΊπΈ π¨π³ | Medium | |
| π sql | 3166 | Calculate Parking Fees and Duration | πΊπΈ π¨π³ | Medium | |
| 3165 | Maximum Sum of Subsequence With Non-adjacent Elements | πΊπΈ π¨π³ | Hard | ||
| 3164 | Find the Number of Good Pairs II | πΊπΈ π¨π³ | Medium | ||
| 3163 | String Compression III | πΊπΈ π¨π³ | Medium | ||
| 3162 | Find the Number of Good Pairs I | πΊπΈ π¨π³ | Easy | ||
| 3161 | Block Placement Queries | πΊπΈ π¨π³ | Hard | ||
| 3160 | Find the Number of Distinct Colors Among the Balls | πΊπΈ π¨π³ | Medium | ||
| 3159 | Find Occurrences of an Element in an Array | πΊπΈ π¨π³ | Medium | ||
| 3158 | Find the XOR of Numbers Which Appear Twice | πΊπΈ π¨π³ | Easy | ||
| π | 3157 | Find the Level of Tree with Minimum Sum | πΊπΈ π¨π³ | Medium | |
| π sql | 3156 | Employee Task Duration and Concurrent Tasks | πΊπΈ π¨π³ | Hard | |
| π | 3155 | Maximum Number of Upgradable Servers | πΊπΈ π¨π³ | Medium | |
| 3154 | Find Number of Ways to Reach the K-th Stair | πΊπΈ π¨π³ | Hard | ||
| 3153 | Sum of Digit Differences of All Pairs | πΊπΈ π¨π³ | Medium | ||
| 3152 | Special Array II | πΊπΈ π¨π³ | Medium | ||
| 3151 | Special Array I | πΊπΈ π¨π³ | Easy | ||
| π sql | 3150 | Invalid Tweets II | πΊπΈ π¨π³ | Easy | |
| βοΈ | 3149 | Find the Minimum Cost Array Permutation | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3148 | Maximum Difference Score in a Grid | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3147 | Taking Maximum Energy From the Mystic Dungeon | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3146 | Permutation Difference between Two Strings | πΊπΈ π¨π³ | py | Easy |
| 3145 | Find Products of Elements of Big Array | πΊπΈ π¨π³ | Hard | ||
| 3144 | Minimum Substring Partition of Equal Character Frequency | πΊπΈ π¨π³ | Medium | ||
| 3143 | Maximum Points Inside the Square | πΊπΈ π¨π³ | Medium | ||
| 3142 | Check if Grid Satisfies Conditions | πΊπΈ π¨π³ | Easy | ||
| π | 3141 | Maximum Hamming Distances | πΊπΈ π¨π³ | Hard | |
| π sql | 3140 | Consecutive Available Seats II | πΊπΈ π¨π³ | Medium | |
| βοΈ | 3139 | Minimum Cost to Equalize Array | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3138 | Minimum Length of Anagram Concatenation | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3137 | Minimum Number of Operations to Make Word K-Periodic | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3136 | Valid Word | πΊπΈ π¨π³ | py | Easy |
| π | 3135 | Equalize Strings by Adding or Removing Characters at Ends | πΊπΈ π¨π³ | Medium | |
| 3134 | Find the Median of the Uniqueness Array | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 3133 | Minimum Array End | πΊπΈ π¨π³ | c | Medium |
| βοΈ | 3132 | Find the Integer Added to Array II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3131 | Find the Integer Added to Array I | πΊπΈ π¨π³ | ts | Easy |
| 3130 | Find All Possible Stable Binary Arrays II | πΊπΈ π¨π³ | Hard | ||
| 3129 | Find All Possible Stable Binary Arrays I | πΊπΈ π¨π³ | Medium | ||
| 3128 | Right Triangles | πΊπΈ π¨π³ | Medium | ||
| 3127 | Make a Square with the Same Color | πΊπΈ π¨π³ | Easy | ||
| π sql | 3126 | Server Utilization Time | πΊπΈ π¨π³ | Medium | |
| π | 3125 | Maximum Number That Makes Result of Bitwise AND Zero | πΊπΈ π¨π³ | Medium | |
| π sql | 3124 | Find Longest Calls | πΊπΈ π¨π³ | Medium | |
| 3123 | Find Edges in Shortest Paths | πΊπΈ π¨π³ | Hard | ||
| 3122 | Minimum Number of Operations to Satisfy Conditions | πΊπΈ π¨π³ | Medium | ||
| 3121 | Count the Number of Special Characters II | πΊπΈ π¨π³ | Medium | ||
| 3120 | Count the Number of Special Characters I | πΊπΈ π¨π³ | Easy | ||
| π | 3119 | Maximum Number of Potholes That Can Be Fixed | πΊπΈ π¨π³ | Medium | |
| π sql | 3118 | Friday Purchase III | πΊπΈ π¨π³ | Medium | |
| 3117 | Minimum Sum of Values by Dividing Array | πΊπΈ π¨π³ | Hard | ||
| 3116 | Kth Smallest Amount With Single Denomination Combination | πΊπΈ π¨π³ | Hard | ||
| 3115 | Maximum Prime Difference | πΊπΈ π¨π³ | Medium | ||
| 3114 | Latest Time You Can Obtain After Replacing Characters | πΊπΈ π¨π³ | Easy | ||
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | πΊπΈ π¨π³ | Hard | ||
| 3112 | Minimum Time to Visit Disappearing Nodes | πΊπΈ π¨π³ | Medium | ||
| 3111 | Minimum Rectangles to Cover Points | πΊπΈ π¨π³ | Medium | ||
| 3110 | Score of a String | πΊπΈ π¨π³ | Easy | ||
| π | 3109 | Find the Index of Permutation | πΊπΈ π¨π³ | Medium | |
| 3108 | Minimum Cost Walk in Weighted Graph | πΊπΈ π¨π³ | Hard | ||
| 3107 | Minimum Operations to Make Median of Array Equal to K | πΊπΈ π¨π³ | Medium | ||
| 3106 | Lexicographically Smallest String After Operations With Constraint | πΊπΈ π¨π³ | Medium | ||
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | πΊπΈ π¨π³ | Easy | ||
| π | 3104 | Find Longest Self-Contained Substring | πΊπΈ π¨π³ | Hard | |
| π sql | 3103 | Find Trending Hashtags II | πΊπΈ π¨π³ | Hard | |
| 3102 | Minimize Manhattan Distances | πΊπΈ π¨π³ | Hard | ||
| 3101 | Count Alternating Subarrays | πΊπΈ π¨π³ | Medium | ||
| 3100 | Water Bottles II | πΊπΈ π¨π³ | Medium | ||
| 3099 | Harshad Number | πΊπΈ π¨π³ | Easy | ||
| 3098 | Find the Sum of Subsequence Powers | πΊπΈ π¨π³ | Hard | ||
| 3097 | Shortest Subarray With OR at Least K II | πΊπΈ π¨π³ | Medium | ||
| 3096 | Minimum Levels to Gain More Points | πΊπΈ π¨π³ | Medium | ||
| 3095 | Shortest Subarray With OR at Least K I | πΊπΈ π¨π³ | Easy | ||
| π | 3094 | Guess the Number Using Bitwise Questions II | πΊπΈ π¨π³ | Medium | |
| 3093 | Longest Common Suffix Queries | πΊπΈ π¨π³ | Hard | ||
| 3092 | Most Frequent IDs | πΊπΈ π¨π³ | Medium | ||
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | πΊπΈ π¨π³ | Medium | ||
| 3090 | Maximum Length Substring With Two Occurrences | πΊπΈ π¨π³ | Easy | ||
| π sql | 3089 | Find Bursty Behavior | πΊπΈ π¨π³ | Medium | |
| π | 3088 | Make String Anti-palindrome | πΊπΈ π¨π³ | Hard | |
| π sql | 3087 | Find Trending Hashtags | πΊπΈ π¨π³ | Medium | |
| 3086 | Minimum Moves to Pick K Ones | πΊπΈ π¨π³ | Hard | ||
| 3085 | Minimum Deletions to Make String K-Special | πΊπΈ π¨π³ | Medium | ||
| 3084 | Count Substrings Starting and Ending with Given Character | πΊπΈ π¨π³ | Medium | ||
| 3083 | Existence of a Substring in a String and Its Reverse | πΊπΈ π¨π³ | Easy | ||
| 3082 | Find the Sum of the Power of All Subsequences | πΊπΈ π¨π³ | Hard | ||
| 3081 | Replace Question Marks in String to Minimize Its Value | πΊπΈ π¨π³ | Medium | ||
| 3080 | Mark Elements on Array by Performing Queries | πΊπΈ π¨π³ | Medium | ||
| 3079 | Find the Sum of Encrypted Integers | πΊπΈ π¨π³ | Easy | ||
| π | 3078 | Match Alphanumerical Pattern in Matrix I | πΊπΈ π¨π³ | Medium | |
| 3077 | Maximum Strength of K Disjoint Subarrays | πΊπΈ π¨π³ | Hard | ||
| 3076 | Shortest Uncommon Substring in an Array | πΊπΈ π¨π³ | Medium | ||
| 3075 | Maximize Happiness of Selected Children | πΊπΈ π¨π³ | Medium | ||
| 3074 | Apple Redistribution into Boxes | πΊπΈ π¨π³ | Easy | ||
| π | 3073 | Maximum Increasing Triplet Value | πΊπΈ π¨π³ | Medium | |
| 3072 | Distribute Elements Into Two Arrays II | πΊπΈ π¨π³ | Hard | ||
| 3071 | Minimum Operations to Write the Letter Y on a Grid | πΊπΈ π¨π³ | Medium | ||
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | πΊπΈ π¨π³ | Medium | ||
| 3069 | Distribute Elements Into Two Arrays I | πΊπΈ π¨π³ | Easy | ||
| 3068 | Find the Maximum Sum of Node Values | πΊπΈ π¨π³ | Hard | ||
| 3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | πΊπΈ π¨π³ | Medium | ||
| 3066 | Minimum Operations to Exceed Threshold Value II | πΊπΈ π¨π³ | Medium | ||
| 3065 | Minimum Operations to Exceed Threshold Value I | πΊπΈ π¨π³ | Easy | ||
| π | 3064 | Guess the Number Using Bitwise Questions I | πΊπΈ π¨π³ | Medium | |
| π | 3063 | Linked List Frequency | πΊπΈ π¨π³ | Easy | |
| π | 3062 | Winner of the Linked List Game | πΊπΈ π¨π³ | Easy | |
| π sql | 3061 | Calculate Trapping Rain Water | πΊπΈ π¨π³ | Hard | |
| π sql | 3060 | User Activities within Time Bounds | πΊπΈ π¨π³ | Hard | |
| π sql | 3059 | Find All Unique Email Domains | πΊπΈ π¨π³ | Easy | |
| π sql | 3058 | Friends With No Mutual Friends | πΊπΈ π¨π³ | Medium | |
| π sql | 3057 | Employees Project Allocation | πΊπΈ π¨π³ | Hard | |
| π sql | 3056 | Snaps Analysis | πΊπΈ π¨π³ | Medium | |
| π sql | 3055 | Top Percentile Fraud | πΊπΈ π¨π³ | Medium | |
| π sql | 3054 | Binary Tree Nodes | πΊπΈ π¨π³ | Medium | |
| π sql | 3053 | Classifying Triangles by Lengths | πΊπΈ π¨π³ | Easy | |
| π sql | 3052 | Maximize Items | πΊπΈ π¨π³ | Hard | |
| π sql | 3051 | Find Candidates for Data Scientist Position | πΊπΈ π¨π³ | Easy | |
| π sql | 3050 | Pizza Toppings Cost Analysis | πΊπΈ π¨π³ | Medium | |
| 3049 | Earliest Second to Mark Indices II | πΊπΈ π¨π³ | Hard | ||
| 3048 | Earliest Second to Mark Indices I | πΊπΈ π¨π³ | Medium | ||
| 3047 | Find the Largest Area of Square Inside Two Rectangles | πΊπΈ π¨π³ | Medium | ||
| 3046 | Split the Array | πΊπΈ π¨π³ | Easy | ||
| 3045 | Count Prefix and Suffix Pairs II | πΊπΈ π¨π³ | Hard | ||
| 3044 | Most Frequent Prime | πΊπΈ π¨π³ | Medium | ||
| 3043 | Find the Length of the Longest Common Prefix | πΊπΈ π¨π³ | Medium | ||
| 3042 | Count Prefix and Suffix Pairs I | πΊπΈ π¨π³ | Easy | ||
| 3041 | Maximize Consecutive Elements in an Array After Modification | πΊπΈ π¨π³ | Hard | ||
| 3040 | Maximum Number of Operations With the Same Score II | πΊπΈ π¨π³ | Medium | ||
| 3039 | Apply Operations to Make String Empty | πΊπΈ π¨π³ | Medium | ||
| 3038 | Maximum Number of Operations With the Same Score I | πΊπΈ π¨π³ | Easy | ||
| π | 3037 | Find Pattern in Infinite Stream II | πΊπΈ π¨π³ | Hard | |
| 3036 | Number of Subarrays That Match a Pattern II | πΊπΈ π¨π³ | Hard | ||
| 3035 | Maximum Palindromes After Operations | πΊπΈ π¨π³ | Medium | ||
| 3034 | Number of Subarrays That Match a Pattern I | πΊπΈ π¨π³ | Medium | ||
| 3033 | Modify the Matrix | πΊπΈ π¨π³ | Easy | ||
| π | 3032 | Count Numbers With Unique Digits II | πΊπΈ π¨π³ | Easy | |
| 3031 | Minimum Time to Revert Word to Initial State II | πΊπΈ π¨π³ | Hard | ||
| 3030 | Find the Grid of Region Average | πΊπΈ π¨π³ | Medium | ||
| 3029 | Minimum Time to Revert Word to Initial State I | πΊπΈ π¨π³ | Medium | ||
| 3028 | Ant on the Boundary | πΊπΈ π¨π³ | Easy | ||
| 3027 | Find the Number of Ways to Place People II | πΊπΈ π¨π³ | Hard | ||
| 3026 | Maximum Good Subarray Sum | πΊπΈ π¨π³ | Medium | ||
| 3025 | Find the Number of Ways to Place People I | πΊπΈ π¨π³ | Medium | ||
| 3024 | Type of Triangle | πΊπΈ π¨π³ | Easy | ||
| π | 3023 | Find Pattern in Infinite Stream I | πΊπΈ π¨π³ | Medium | |
| 3022 | Minimize OR of Remaining Elements Using Operations | πΊπΈ π¨π³ | Hard | ||
| 3021 | Alice and Bob Playing Flower Game | πΊπΈ π¨π³ | Medium | ||
| 3020 | Find the Maximum Number of Elements in Subset | πΊπΈ π¨π³ | Medium | ||
| 3019 | Number of Changing Keys | πΊπΈ π¨π³ | Easy | ||
| π | 3018 | Maximum Number of Removal Queries That Can Be Processed I | πΊπΈ π¨π³ | Hard | |
| 3017 | Count the Number of Houses at a Certain Distance II | πΊπΈ π¨π³ | Hard | ||
| 3016 | Minimum Number of Pushes to Type Word II | πΊπΈ π¨π³ | Medium | ||
| 3015 | Count the Number of Houses at a Certain Distance I | πΊπΈ π¨π³ | Medium | ||
| 3014 | Minimum Number of Pushes to Type Word I | πΊπΈ π¨π³ | Easy | ||
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | πΊπΈ π¨π³ | Hard | ||
| 3012 | Minimize Length of Array Using Operations | πΊπΈ π¨π³ | Medium | ||
| 3011 | Find if Array Can Be Sorted | πΊπΈ π¨π³ | Medium | ||
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | πΊπΈ π¨π³ | Easy | ||
| π | 3009 | Maximum Number of Intersections on the Chart | πΊπΈ π¨π³ | Hard | |
| βοΈ | 3008 | Find Beautiful Indices in the Given Array II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3006 | Find Beautiful Indices in the Given Array I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3005 | Count Elements With Maximum Frequency | πΊπΈ π¨π³ | py | Easy |
| π | 3004 | Maximum Subtree of the Same Color | πΊπΈ π¨π³ | Medium | |
| βοΈ | 3003 | Maximize the Number of Partitions After Operations | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 3002 | Maximum Size of a Set After Removals | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3001 | Minimum Moves to Capture The Queen | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 3000 | Maximum Area of Longest Diagonal Rectangle | πΊπΈ π¨π³ | py | Easy |
| 2999 | Count the Number of Powerful Integers | πΊπΈ π¨π³ | Hard | ||
| 2998 | Minimum Number of Operations to Make X and Y Equal | πΊπΈ π¨π³ | Medium | ||
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | πΊπΈ π¨π³ | Medium | ||
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | πΊπΈ π¨π³ | Easy | ||
| π sql | 2995 | Viewers Turned Streamers | πΊπΈ π¨π³ | Hard | |
| π sql | 2994 | Friday Purchases II | πΊπΈ π¨π³ | Hard | |
| π sql | 2993 | Friday Purchases I | πΊπΈ π¨π³ | Medium | |
| π | 2992 | Number of Self-Divisible Permutations | πΊπΈ π¨π³ | Medium | |
| π sql | 2991 | Top Three Wineries | πΊπΈ π¨π³ | Hard | |
| π sql | 2990 | Loan Types | πΊπΈ π¨π³ | Easy | |
| π sql | 2989 | Class Performance | πΊπΈ π¨π³ | Medium | |
| π sql | 2988 | Manager of the Largest Department | πΊπΈ π¨π³ | Medium | |
| π sql | 2987 | Find Expensive Cities | πΊπΈ π¨π³ | Easy | |
| π sql | 2986 | Find Third Transaction | πΊπΈ π¨π³ | Medium | |
| π sql | 2985 | Calculate Compressed Mean | πΊπΈ π¨π³ | Easy | |
| π sql | 2984 | Find Peak Calling Hours for Each City | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2983 | Palindrome Rearrangement Queries | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2982 | Find Longest Special Substring That Occurs Thrice II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2981 | Find Longest Special Substring That Occurs Thrice I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2980 | Check if Bitwise OR Has Trailing Zeros | πΊπΈ π¨π³ | py | Easy |
| π | 2979 | Most Expensive Item That Can Not Be Bought | πΊπΈ π¨π³ | Medium | |
| π sql | 2978 | Symmetric Coordinates | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2977 | Minimum Cost to Convert String II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2976 | Minimum Cost to Convert String I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2975 | Maximum Square Area by Removing Fences From a Field | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2974 | Minimum Number Game | πΊπΈ π¨π³ | py | Easy |
| 2973 | Find Number of Coins to Place in Tree Nodes | πΊπΈ π¨π³ | Hard | ||
| 2972 | Count the Number of Incremovable Subarrays II | πΊπΈ π¨π³ | Hard | ||
| 2971 | Find Polygon With the Largest Perimeter | πΊπΈ π¨π³ | Medium | ||
| 2970 | Count the Number of Incremovable Subarrays I | πΊπΈ π¨π³ | Easy | ||
| π | 2969 | Minimum Number of Coins for Fruits II | πΊπΈ π¨π³ | Hard | |
| 2968 | Apply Operations to Maximize Frequency Score | πΊπΈ π¨π³ | Hard | ||
| 2967 | Minimum Cost to Make Array Equalindromic | πΊπΈ π¨π³ | Medium | ||
| 2966 | Divide Array Into Arrays With Max Difference | πΊπΈ π¨π³ | Medium | ||
| 2965 | Find Missing and Repeated Values | πΊπΈ π¨π³ | Easy | ||
| π | 2964 | Number of Divisible Triplet Sums | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2963 | Count the Number of Good Partitions | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2962 | Count Subarrays Where Max Element Appears at Least K Times | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2961 | Double Modular Exponentiation | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2960 | Count Tested Devices After Test Operations | πΊπΈ π¨π³ | py | Easy |
| 2959 | Number of Possible Sets of Closing Branches | πΊπΈ π¨π³ | Hard | ||
| 2958 | Length of Longest Subarray With at Most K Frequency | πΊπΈ π¨π³ | Medium | ||
| 2957 | Remove Adjacent Almost-Equal Characters | πΊπΈ π¨π³ | Medium | ||
| 2956 | Find Common Elements Between Two Arrays | πΊπΈ π¨π³ | Easy | ||
| π | 2955 | Number of Same-End Substrings | πΊπΈ π¨π³ | Medium | |
| 2954 | Count the Number of Infection Sequences | πΊπΈ π¨π³ | Hard | ||
| 2953 | Count Complete Substrings | πΊπΈ π¨π³ | Hard | ||
| 2952 | Minimum Number of Coins to be Added | πΊπΈ π¨π³ | Medium | ||
| 2951 | Find the Peaks | πΊπΈ π¨π³ | Easy | ||
| π | 2950 | Number of Divisible Substrings | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2949 | Count Beautiful Substrings II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2948 | Make Lexicographically Smallest Array by Swapping Elements | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2947 | Count Beautiful Substrings I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2946 | Matrix Similarity After Cyclic Shifts | πΊπΈ π¨π³ | py | Easy |
| 2945 | Find Maximum Non-decreasing Array Length | πΊπΈ π¨π³ | Hard | ||
| 2944 | Minimum Number of Coins for Fruits | πΊπΈ π¨π³ | Medium | ||
| 2943 | Maximize Area of Square Hole in Grid | πΊπΈ π¨π³ | Medium | ||
| 2942 | Find Words Containing Character | πΊπΈ π¨π³ | Easy | ||
| π | 2941 | Maximum GCD-Sum of a Subarray | πΊπΈ π¨π³ | Hard | |
| 2940 | Find Building Where Alice and Bob Can Meet | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 2939 | Maximum Xor Product | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2938 | Separate Black and White Balls | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2937 | Make Three Strings Equal | πΊπΈ π¨π³ | py | Easy |
| π | 2936 | Number of Equal Numbers Blocks | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2935 | Maximum Strong Pair XOR II | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2934 | Minimum Operations to Maximize Last Elements in Arrays | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2933 | High-Access Employees | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2932 | Maximum Strong Pair XOR I | πΊπΈ π¨π³ | py | Easy |
| 2931 | Maximum Spending After Buying Items | πΊπΈ π¨π³ | Hard | ||
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | πΊπΈ π¨π³ | Medium | ||
| 2929 | Distribute Candies Among Children II | πΊπΈ π¨π³ | Medium | ||
| 2928 | Distribute Candies Among Children I | πΊπΈ π¨π³ | Easy | ||
| π | 2927 | Distribute Candies Among Children III | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2926 | Maximum Balanced Subsequence Sum | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2925 | Maximum Score After Applying Operations on a Tree | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2924 | Find Champion II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2923 | Find Champion I | πΊπΈ π¨π³ | py | Easy |
| π sql | 2922 | Market Analysis III | πΊπΈ π¨π³ | Medium | |
| π | 2921 | Maximum Profitable Triplets With Increasing Prices II | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2920 | Maximum Points After Collecting Coins From All Nodes | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2919 | Minimum Increment Operations to Make Array Beautiful | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2917 | Find the K-or of an Array | πΊπΈ π¨π³ | py | Easy |
| 2916 | Subarrays Distinct Element Sum of Squares II | πΊπΈ π¨π³ | Hard | ||
| 2915 | Length of the Longest Subsequence That Sums to Target | πΊπΈ π¨π³ | Medium | ||
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | πΊπΈ π¨π³ | Medium | ||
| 2913 | Subarrays Distinct Element Sum of Squares I | πΊπΈ π¨π³ | Easy | ||
| π | 2912 | Number of Ways to Reach Destination in the Grid | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2911 | Minimum Changes to Make K Semi-palindromes | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2910 | Minimum Number of Groups to Create a Valid Assignment | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2909 | Minimum Sum of Mountain Triplets II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2908 | Minimum Sum of Mountain Triplets I | πΊπΈ π¨π³ | py | Easy |
| π | 2907 | Maximum Profitable Triplets With Increasing Prices I | πΊπΈ π¨π³ | Medium | |
| βοΈβ | 2906 | Construct Product Matrix | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2905 | Find Indices With Index and Value Difference II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2904 | Shortest and Lexicographically Smallest Beautiful String | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2903 | Find Indices With Index and Value Difference I | πΊπΈ π¨π³ | py | Easy |
| 2902 | Count of Sub-Multisets With Bounded Sum | πΊπΈ π¨π³ | Hard | ||
| 2901 | Longest Unequal Adjacent Groups Subsequence II | πΊπΈ π¨π³ | Medium | ||
| 2900 | Longest Unequal Adjacent Groups Subsequence I | πΊπΈ π¨π³ | Easy | ||
| 2899 | Last Visited Integers | πΊπΈ π¨π³ | Easy | ||
| π | 2898 | Maximum Linear Stock Score | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2897 | Apply Operations on Array to Maximize Sum of Squares | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2896 | Apply Operations to Make Two Strings Equal | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2895 | Minimum Processing Time | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2894 | Divisible and Non-divisible Sums Difference | πΊπΈ π¨π³ | py | Easy |
| π sql | 2893 | Calculate Orders Within Each Interval | πΊπΈ π¨π³ | Medium | |
| π | 2892 | Minimizing Array After Replacing Pairs With Their Product | πΊπΈ π¨π³ | Medium | |
| 2891 | Method Chaining | πΊπΈ π¨π³ | Easy | ||
| 2890 | Reshape Data: Melt | πΊπΈ π¨π³ | Easy | ||
| 2889 | Reshape Data: Pivot | πΊπΈ π¨π³ | Easy | ||
| 2888 | Reshape Data: Concatenate | πΊπΈ π¨π³ | Easy | ||
| 2887 | Fill Missing Data | πΊπΈ π¨π³ | Easy | ||
| 2886 | Change Data Type | πΊπΈ π¨π³ | Easy | ||
| 2885 | Rename Columns | πΊπΈ π¨π³ | Easy | ||
| 2884 | Modify Columns | πΊπΈ π¨π³ | Easy | ||
| 2883 | Drop Missing Data | πΊπΈ π¨π³ | Easy | ||
| 2882 | Drop Duplicate Rows | πΊπΈ π¨π³ | Easy | ||
| 2881 | Create a New Column | πΊπΈ π¨π³ | Easy | ||
| 2880 | Select Data | πΊπΈ π¨π³ | Easy | ||
| 2879 | Display the First Three Rows | πΊπΈ π¨π³ | Easy | ||
| 2878 | Get the Size of a DataFrame | πΊπΈ π¨π³ | Easy | ||
| 2877 | Create a DataFrame from List | πΊπΈ π¨π³ | Easy | ||
| βοΈ | 2876 | Count Visited Nodes in a Directed Graph | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2875 | Minimum Size Subarray in Infinite Array | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2874 | Maximum Value of an Ordered Triplet II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2873 | Maximum Value of an Ordered Triplet I | πΊπΈ π¨π³ | py | Easy |
| 2872 | Maximum Number of K-Divisible Components | πΊπΈ π¨π³ | Hard | ||
| 2871 | Split Array Into Maximum Number of Subarrays | πΊπΈ π¨π³ | Medium | ||
| 2870 | Minimum Number of Operations to Make Array Empty | πΊπΈ π¨π³ | Medium | ||
| 2869 | Minimum Operations to Collect Elements | πΊπΈ π¨π³ | Easy | ||
| π | 2868 | The Wording Game | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2867 | Count Valid Paths in a Tree | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2866 | Beautiful Towers II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2865 | Beautiful Towers I | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2864 | Maximum Odd Binary Number | πΊπΈ π¨π³ | py | Easy |
| π | 2863 | Maximum Length of Semi-Decreasing Subarrays | πΊπΈ π¨π³ | Medium | |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | πΊπΈ π¨π³ | Hard | ||
| 2861 | Maximum Number of Alloys | πΊπΈ π¨π³ | Medium | ||
| 2860 | Happy Students | πΊπΈ π¨π³ | Medium | ||
| 2859 | Sum of Values at Indices With K Set Bits | πΊπΈ π¨π³ | Easy | ||
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | πΊπΈ π¨π³ | Hard | ||
| 2857 | Count Pairs of Points With Distance k | πΊπΈ π¨π³ | Medium | ||
| 2856 | Minimum Array Length After Pair Removals | πΊπΈ π¨π³ | Medium | ||
| 2855 | Minimum Right Shifts to Sort the Array | πΊπΈ π¨π³ | Easy | ||
| π sql | 2854 | Rolling Average Steps | πΊπΈ π¨π³ | Medium | |
| π sql | 2853 | Highest Salaries Difference | πΊπΈ π¨π³ | Easy | |
| π | 2852 | Sum of Remoteness of All Cells | πΊπΈ π¨π³ | Medium | |
| 2851 | String Transformation | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 2850 | Minimum Moves to Spread Stones Over Grid | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2849 | Determine if a Cell Is Reachable at a Given Time | πΊπΈ π¨π³ | c | Medium |
| βοΈ | 2848 | Points That Intersect With Cars | πΊπΈ π¨π³ | py | Easy |
| π | 2847 | Smallest Number With Given Digit Product | πΊπΈ π¨π³ | Medium | |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | πΊπΈ π¨π³ | Hard | ||
| 2845 | Count of Interesting Subarrays | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 2844 | Minimum Operations to Make a Special Number | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2843 | Count Symmetric Integers | πΊπΈ π¨π³ | py | Easy |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 2841 | Maximum Sum of Almost Unique Subarray | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2840 | Check if Strings Can be Made Equal With Operations II | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2839 | Check if Strings Can be Made Equal With Operations I | πΊπΈ π¨π³ | py | Easy |
| π | 2838 | Maximum Coins Heroes Can Collect | πΊπΈ π¨π³ | Medium | |
| π sql | 2837 | Total Traveled Distance | πΊπΈ π¨π³ | Easy | |
| βοΈβ | 2836 | Maximize Value of Function in a Ball Passing Game | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2835 | Minimum Operations to Form Subsequence With Target Sum | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2834 | Find the Minimum Possible Sum of a Beautiful Array | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2833 | Furthest Point From Origin | πΊπΈ π¨π³ | py | Easy |
| π | 2832 | Maximal Range That Each Element Is Maximum in It | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2831 | Find the Longest Equal Subarray | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2830 | Maximize the Profit as the Salesman | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2829 | Determine the Minimum Sum of a k-avoiding Array | πΊπΈ π¨π³ | java | Medium |
| βοΈ | 2828 | Check if a String Is an Acronym of Words | πΊπΈ π¨π³ | ts | Easy |
| βοΈ | 2827 | Number of Beautiful Integers in the Range | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2826 | Sorting Three Groups | πΊπΈ π¨π³ | java | Medium |
| βοΈ | 2825 | Make String a Subsequence Using Cyclic Increments | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2824 | Count Pairs Whose Sum is Less than Target | πΊπΈ π¨π³ | py | Easy |
| π | 2823 | Deep Object Filter | πΊπΈ π¨π³ | Medium | |
| π | 2822 | Inversion of Object | πΊπΈ π¨π³ | Easy | |
| π | 2821 | Delay the Resolution of Each Promise | πΊπΈ π¨π³ | Medium | |
| π sql | 2820 | Election Results | πΊπΈ π¨π³ | Medium | |
| π | 2819 | Minimum Relative Loss After Buying Chocolates | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2818 | Apply Operations to Maximize Score | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2817 | Minimum Absolute Difference Between Elements With Constraint | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2816 | Double a Number Represented as a Linked List | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2815 | Max Pair Sum in an Array | πΊπΈ π¨π³ | py | Easy |
| π | 2814 | Minimum Time Takes to Reach Destination Without Drowning | πΊπΈ π¨π³ | Hard | |
| 2813 | Maximum Elegance of a K-Length Subsequence | πΊπΈ π¨π³ | Hard | ||
| 2812 | Find the Safest Path in a Grid | πΊπΈ π¨π³ | Medium | ||
| 2811 | Check if it is Possible to Split Array | πΊπΈ π¨π³ | Medium | ||
| 2810 | Faulty Keyboard | πΊπΈ π¨π³ | Easy | ||
| 2809 | Minimum Time to Make Array Sum At Most x | πΊπΈ π¨π³ | Hard | ||
| 2808 | Minimum Seconds to Equalize a Circular Array | πΊπΈ π¨π³ | Medium | ||
| 2807 | Insert Greatest Common Divisors in Linked List | πΊπΈ π¨π³ | Medium | ||
| 2806 | Account Balance After Rounded Purchase | πΊπΈ π¨π³ | Easy | ||
| π | 2805 | Custom Interval | πΊπΈ π¨π³ | Medium | |
| π | 2804 | Array Prototype ForEach | πΊπΈ π¨π³ | Easy | |
| π | 2803 | Factorial Generator | πΊπΈ π¨π³ | Easy | |
| π | 2802 | Find The K-th Lucky Number | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2801 | Count Stepping Numbers in Range | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2800 | Shortest String That Contains Three Strings | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2799 | Count Complete Subarrays in an Array | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2798 | Number of Employees Who Met the Target | πΊπΈ π¨π³ | ts | Easy |
| π | 2797 | Partial Function with Placeholders | πΊπΈ π¨π³ | Easy | |
| π | 2796 | Repeat String | πΊπΈ π¨π³ | Easy | |
| π | 2795 | Parallel Execution of Promises for Individual Results Retrieval | πΊπΈ π¨π³ | Medium | |
| π | 2794 | Create Object from Two Arrays | πΊπΈ π¨π³ | Easy | |
| π sql | 2793 | Status of Flight Tickets | πΊπΈ π¨π³ | Hard | |
| π | 2792 | Count Nodes That Are Great Enough | πΊπΈ π¨π³ | Hard | |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | πΊπΈ π¨π³ | md | Hard | |
| 2790 | Maximum Number of Groups With Increasing Length | πΊπΈ π¨π³ | Hard | ||
| βοΈ | 2789 | Largest Element in an Array after Merge Operations | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2788 | Split Strings by Separator | πΊπΈ π¨π³ | py | Easy |
| 2787 | Ways to Express an Integer as Sum of Powers | πΊπΈ π¨π³ | Medium | ||
| 2786 | Visit Array Positions to Maximize Score | πΊπΈ π¨π³ | Medium | ||
| 2785 | Sort Vowels in a String | πΊπΈ π¨π³ | Medium | ||
| 2784 | Check if Array is Good | πΊπΈ π¨π³ | Easy | ||
| π sql | 2783 | Flight Occupancy and Waitlist Analysis | πΊπΈ π¨π³ | Medium | |
| π | 2782 | Number of Unique Categories | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2781 | Length of the Longest Valid Substring | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2780 | Minimum Index of a Valid Split | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2779 | Maximum Beauty of an Array After Applying Operation | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2778 | Sum of Squares of Special Elements | πΊπΈ π¨π³ | py | Easy |
| π | 2777 | Date Range Generator | πΊπΈ π¨π³ | Medium | |
| π | 2776 | Convert Callback Based Function to Promise Based Function | πΊπΈ π¨π³ | Medium | |
| π | 2775 | Undefined to Null | πΊπΈ π¨π³ | Medium | |
| π | 2774 | Array Upper Bound | πΊπΈ π¨π³ | Easy | |
| π | 2773 | Height of Special Binary Tree | πΊπΈ π¨π³ | Medium | |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | πΊπΈ π¨π³ | Medium | ||
| 2771 | Longest Non-decreasing Subarray From Two Arrays | πΊπΈ π¨π³ | Medium | ||
| 2770 | Maximum Number of Jumps to Reach the Last Index | πΊπΈ π¨π³ | Medium | ||
| 2769 | Find the Maximum Achievable Number | πΊπΈ π¨π³ | Easy | ||
| 2768 | Number of Black Blocks | πΊπΈ π¨π³ | Medium | ||
| 2767 | Partition String Into Minimum Beautiful Substrings | πΊπΈ π¨π³ | Medium | ||
| 2766 | Relocate Marbles | πΊπΈ π¨π³ | Medium | ||
| 2765 | Longest Alternating Subarray | πΊπΈ π¨π³ | Easy | ||
| π | 2764 | Is Array a Preorder of Some βBinary Tree | πΊπΈ π¨π³ | Medium | |
| 2763 | Sum of Imbalance Numbers of All Subarrays | πΊπΈ π¨π³ | Hard | ||
| 2762 | Continuous Subarrays | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 2761 | Prime Pairs With Target Sum | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2760 | Longest Even Odd Subarray With Threshold | πΊπΈ π¨π³ | java | Easy |
| π | 2759 | Convert JSON String to Object | πΊπΈ π¨π³ | Hard | |
| π | 2758 | Next Day | πΊπΈ π¨π³ | Easy | |
| π | 2757 | Generate Circular Array Values | πΊπΈ π¨π³ | Medium | |
| π | 2756 | Query Batching | πΊπΈ π¨π³ | Hard | |
| π | 2755 | Deep Merge of Two Objects | πΊπΈ π¨π³ | Medium | |
| π | 2754 | Bind Function to Context | πΊπΈ π¨π³ | Medium | |
| π | 2753 | Count Houses in a Circular Street II | πΊπΈ π¨π³ | Hard | |
| π sql | 2752 | Customers with Maximum Number of Transactions on Consecutive Days | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2751 | Robot Collisions | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2750 | Ways to Split Array Into Good Subarrays | πΊπΈ π¨π³ | java | Medium |
| βοΈ | 2749 | Minimum Operations to Make the Integer Zero | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2748 | Number of Beautiful Pairs | πΊπΈ π¨π³ | py | Easy |
| 2747 | Count Zero Request Servers | πΊπΈ π¨π³ | Medium | ||
| 2746 | Decremental String Concatenation | πΊπΈ π¨π³ | Medium | ||
| 2745 | Construct the Longest New String | πΊπΈ π¨π³ | Medium | ||
| 2744 | Find Maximum Number of String Pairs | πΊπΈ π¨π³ | Easy | ||
| π | 2743 | Count Substrings Without Repeating Character | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2742 | Painting the Walls | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2741 | Special Permutations | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2740 | Find the Value of the Partition | πΊπΈ π¨π³ | ts | Medium |
| βοΈ | 2739 | Total Distance Traveled | πΊπΈ π¨π³ | java | Easy |
| π sql | 2738 | Count Occurrences in Text | πΊπΈ π¨π³ | Medium | |
| π | 2737 | Find the Closest Marked Node | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2736 | Maximum Sum Queries | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2735 | Collecting Chocolates | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2734 | Lexicographically Smallest String After Substring Operation | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2733 | Neither Minimum nor Maximum | πΊπΈ π¨π³ | py | Easy |
| βοΈ | 2732 | Find a Good Subset of the Matrix | πΊπΈ π¨π³ | py, py | Hard |
| βοΈ | 2731 | Movement of Robots | πΊπΈ π¨π³ | rb | Medium |
| βοΈ | 2730 | Find the Longest Semi-Repetitive Substring | πΊπΈ π¨π³ | java | Medium |
| βοΈ | 2729 | Check if The Number is Fascinating | πΊπΈ π¨π³ | py | Easy |
| π | 2728 | Count Houses in a Circular Street | πΊπΈ π¨π³ | Easy | |
| 2727 | Is Object Empty | πΊπΈ π¨π³ | Easy | ||
| 2726 | Calculator with Method Chaining | πΊπΈ π¨π³ | Easy | ||
| 2725 | Interval Cancellation | πΊπΈ π¨π³ | Easy | ||
| 2724 | Sort By | πΊπΈ π¨π³ | Easy | ||
| 2723 | Add Two Promises | πΊπΈ π¨π³ | Easy | ||
| 2722 | Join Two Arrays by ID | πΊπΈ π¨π³ | Medium | ||
| 2721 | Execute Asynchronous Functions in Parallel | πΊπΈ π¨π³ | Medium | ||
| π sql | 2720 | Popularity Percentage | πΊπΈ π¨π³ | Hard | |
| βοΈ | 2719 | Count of Integers | πΊπΈ π¨π³ | py | Hard |
| βοΈ | 2718 | Sum of Matrix After Queries | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2717 | Semi-Ordered Permutation | πΊπΈ π¨π³ | rb | Easy |
| βοΈ | 2716 | Minimize String Length | πΊπΈ π¨π³ | rb | Easy |
| βοΈ | 2715 | Timeout Cancellation | πΊπΈ π¨π³ | ts | Easy |
| π | 2714 | Find Shortest Path with K Hops | πΊπΈ π¨π³ | Hard | |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | πΊπΈ π¨π³ | Hard | ||
| 2712 | Minimum Cost to Make All Characters Equal | πΊπΈ π¨π³ | Medium | ||
| 2711 | Difference of Number of Distinct Values on Diagonals | πΊπΈ π¨π³ | Medium | ||
| 2710 | Remove Trailing Zeros From a String | πΊπΈ π¨π³ | Easy | ||
| 2709 | Greatest Common Divisor Traversal | πΊπΈ π¨π³ | Hard | ||
| 2708 | Maximum Strength of a Group | πΊπΈ π¨π³ | Medium | ||
| 2707 | Extra Characters in a String | πΊπΈ π¨π³ | Medium | ||
| 2706 | Buy Two Chocolates | πΊπΈ π¨π³ | Easy | ||
| 2705 | Compact Object | πΊπΈ π¨π³ | Medium | ||
| 2704 | To Be Or Not To Be | πΊπΈ π¨π³ | Easy | ||
| 2703 | Return Length of Arguments Passed | πΊπΈ π¨π³ | Easy | ||
| π | 2702 | Minimum Operations to Make Numbers Non-positive | πΊπΈ π¨π³ | Hard | |
| π sql | 2701 | Consecutive Transactions with Increasing Amounts | πΊπΈ π¨π³ | Hard | |
| π | 2700 | Differences Between Two Objects | πΊπΈ π¨π³ | Medium | |
| 2699 | Modify Graph Edge Weights | πΊπΈ π¨π³ | Hard | ||
| 2698 | Find the Punishment Number of an Integer | πΊπΈ π¨π³ | Medium | ||
| 2697 | Lexicographically Smallest Palindrome | πΊπΈ π¨π³ | Easy | ||
| 2696 | Minimum String Length After Removing Substrings | πΊπΈ π¨π³ | Easy | ||
| 2695 | Array Wrapper | πΊπΈ π¨π³ | Easy | ||
| 2694 | Event Emitter | πΊπΈ π¨π³ | Medium | ||
| 2693 | Call Function with Custom Context | πΊπΈ π¨π³ | Medium | ||
| π | 2692 | Make Object Immutable | πΊπΈ π¨π³ | Medium | |
| π | 2691 | Immutability Helper | πΊπΈ π¨π³ | Hard | |
| π | 2690 | Infinite Method Object | πΊπΈ π¨π³ | Easy | |
| π | 2689 | Extract Kth Character From The Rope Tree | πΊπΈ π¨π³ | Easy | |
| π sql | 2688 | Find Active Users | πΊπΈ π¨π³ | Medium | |
| π sql | 2687 | Bikes Last Time Used | πΊπΈ π¨π³ | Easy | |
| π sql | 2686 | Immediate Food Delivery III | πΊπΈ π¨π³ | Medium | |
| βοΈ | 2685 | Count the Number of Complete Components | πΊπΈ π¨π³ | ts | Medium |
| βοΈ | 2684 | Maximum Number of Moves in a Grid | πΊπΈ π¨π³ | ts | Medium |
| βοΈ | 2683 | Neighboring Bitwise XOR | πΊπΈ π¨π³ | ts | Medium |
| βοΈ | 2682 | Find the Losers of the Circular Game | πΊπΈ π¨π³ | php | Easy |
| 2681 | Power of Heroes | πΊπΈ π¨π³ | Hard | ||
| 2680 | Maximum OR | πΊπΈ π¨π³ | Medium | ||
| βοΈ | 2679 | Sum in a Matrix | πΊπΈ π¨π³ | py | Medium |
| βοΈ | 2678 | Number of Senior Citizens | πΊπΈ π¨π³ | c | Easy |