Skip to content

kaiwensun/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Kaiwen's LeetCode solutions [FORK NOT PERMITTED]

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

About

My LeetCode solutions

Topics

Resources

Stars

Watchers

Forks