| 3003 |
Maximize the Number of Partitions After Operations |
Python |
Hard |
| 3005 |
Count Elements with Maximum Frequency |
Python |
Easy |
| 3006 |
Find Beautiful Indices in the Given Array I |
Python |
Medium |
| 3010 |
Divide an Array Into Subarrays With Minimum Cost I |
Python |
Easy |
| 3011 |
Find if Array Can Be Sorted |
Python |
Medium |
| 3013 |
Divide an Array Into Subarrays With Minimum Cost II |
Python |
Hard |
| 3016 |
Minimum Number of Pushes to Type Word II |
Python |
Medium |
| 3020 |
Find the Maximum Number of Elements in Subset |
Python |
Medium |
| 3021 |
Alice and Bob Playing Flower Game |
Python |
Medium |
| 3024 |
Type of Triangle |
Python |
Easy |
| 3025 |
Find the Number of Ways to Place People I |
Python |
Medium |
| 3026 |
Maximum Good Subarray Sum |
Python |
Medium |
| 3027 |
Find the Number of Ways to Place People II |
Python |
Hard |
| 3034 |
Number of Subarrays That Match a Pattern I |
Python |
Medium |
| 3039 |
Apply Operations to Make String Empty |
Python |
Medium |
| 3042 |
Count Prefix and Suffix Pairs I |
Python |
Easy |
| 3043 |
Find the Length of the Longest Common Prefix |
Python |
Medium |
| 3047 |
Find the Largest Area of Square Inside Two Rectangles |
Python |
Medium |
| 3062 |
Winner of the Linked List Game |
Python |
Easy |
| 3063 |
Linked List Frequency |
Python |
Medium |
| 3066 |
Minimum Operations to Exceed Threshold Value II |
Python |
Medium |
| 3068 |
Find the Maximum Sum of Node Values |
Python |
Hard |
| 3070 |
Count Submatrices With Top Left Element and Sum Less Than K |
Python |
Medium |
| 3074 |
Apple Redistribution Into Boxes |
Python |
Easy |
| 3075 |
Maximize Happiness of Selected Children |
Python |
Medium |
| 3084 |
Count Substrings Starting and Ending With Given Character |
Python |
Medium |
| 3091 |
Apply Operations to Make Sum of Array Greater Than or Equal to K |
Python |
Medium |
| 3095 |
Shortest Subarray with OR at Least K I |
Python |
Easy |
| 3096 |
Minimum Levels to Gain More Points |
Python |
Medium |
| 3097 |
Shortest Subarray with OR at Least K II |
Python |
Medium |
| 3100 |
Water Bottles II |
Python |
Medium |
| 3101 |
Count Alternating Subarrays |
Python |
Medium |
| 3105 |
Longest Strictly Increasing or Strictly Decreasing Subarray |
Python |
Easy |
| 3106 |
Lexicographically Smallest String After Operations With Constraint |
Python |
Medium |
| 3108 |
Minimum Cost Walk in Weighted Graph |
Python |
Hard |
| 3110 |
Score of a String |
Python |
Easy |
| 3111 |
Minimum Rectangles to Cover Points |
Python |
Medium |
| 3115 |
Maximum Prime Difference |
Python |
Medium |
| 3128 |
Count Right Triangles |
Python |
Medium |
| 3133 |
Minimum Array End |
Python |
Medium |
| 3136 |
Valid Word |
Python |
Easy |
| 3137 |
Minimum Number of Operations to Make Word K-Periodic |
Python |
Medium |
| 3147 |
Taking Maximum Energy from the Mystic Dungeon |
Python |
Medium |
| 3151 |
Special Array I |
Python |
Easy |
| 3152 |
Special Array II |
Python |
Medium |
| 3155 |
Maximum Number of Upgradable Servers |
Python |
Medium |
| 3159 |
Find Occurrences of an Element in an Array |
Python |
Medium |
| 3160 |
Find the Number of Distinct Colors Among the Balls |
Python |
Medium |
| 3163 |
String Compression III |
Python |
Medium |
| 3169 |
Count Days Without Meetings |
Python |
Medium |
| 3170 |
Lexicographically Minimum String After Removing Stars |
Python |
Medium |
| 3174 |
Clear Digits |
Python |
Easy |
| 3175 |
Find the First Player to Win K Games in a Row |
Python |
Medium |
| 3176 |
Find the Maximum Length of a Good Subsequence I |
Python |
Medium |
| 3177 |
Find the Maximum Length of a Good Subsequence II |
Python |
Medium |
| 3179 |
Find the N-th Value After K Seconds |
Python |
Medium |
| 3186 |
Maximum Total Damage with Spell Casting |
Python |
Medium |
| 3189 |
Minimum Moves to Get a Peaceful Board |
Python |
Medium |
| 3190 |
Minimum Operations to Make All Elements Divisible by Three |
Python |
Easy |
| 3191 |
Minimum Operations to Make Binary Array Elements Equal to One I |
Python |
Medium |
| 3192 |
Minimum Operations to Make Binary Array Elements Equal to One II |
Python |
Medium |
| 3195 |
Find the Minimum Area to Cover All Ones I |
Python |
Medium |
| 3197 |
Find the Minimum Area to Cover All Ones II |
Python |
Hard |
| 3201 |
Find the Maximum Length of Valid Subsequence I |
Python |
Medium |
| 3202 |
Find the Maximum Length of Valid Subsequence II |
Python |
Medium |
| 3203 |
Find Minimum Diameter After Merging Two Trees |
Python |
Hard |
| 3208 |
Alternating Groups II |
Python |
Medium |
| 3211 |
Generate Binary Strings Without Adjacent Zeros |
Python |
Medium |
| 3217 |
Delete Nodes From Linked List Present In Array |
Python |
Medium |
| 3223 |
Minimum Length of String After Operations |
Python |
Medium |
| 3227 |
Vowels Game in a String |
Python |
Medium |
| 3233 |
Find the Count of Numbers Which Are Not Special |
Python |
Medium |
| 3234 |
Count the Number of Substrings with Dominant Ones |
Python |
Medium |
| 3239 |
Minimum Number of Flips to Make Binary Grid Palindromic I |
Python |
Medium |
| 3243 |
Shortest Distance After Road Addition Queries I |
Python |
Medium |
| 3249 |
Count the Number of Good Nodes |
Python |
Medium |
| 3259 |
Maximum Energy Boost from Two Drinks |
Python |
Medium |
| 3264 |
Final Array State After K Multiplication Operations I |
Python |
Easy |
| 3271 |
Hash Divided String |
Python |
Medium |
| 3272 |
Find the Count of Good Integers |
Python |
Hard |
| 3275 |
K-th Nearest Obstacle Queries |
Python |
Medium |
| 3280 |
Convert Date to Binary |
Python |
Easy |
| 3281 |
Maximize Score of Numbers in Ranges |
Python |
Medium |
| 3282 |
Reach End of Array with Max Score |
Python |
Medium |
| 3285 |
Find Indices of Stable Mountains |
Python |
Easy |
| 3286 |
Find a Safe Walk Through a Grid |
Python |
Medium |
| 3289 |
The Two Sneaky Numbers of Digitville |
Python |
Easy |
| 3290 |
Maximum Multiplication Score |
Python |
Medium |
| 3295 |
Report Spam Message |
Python |
Medium |
| 3296 |
Minimum Number of Seconds to Make Mountain Height Zero |
Python |
Medium |
| 3300 |
Minimum Element After Replacement With Digit Sum |
Python |
Easy |
| 3301 |
Maximize the Total Height of Unique Towers |
Python |
Medium |
| 3304 |
Find the K-th Character in String Game I |
Python |
Easy |
| 3305 |
Count of Substrings Containing Every Vowel and K Consonants I |
Python |
Medium |
| 3306 |
Count of Substrings Containing Every Vowel and K Consonants II |
Python |
Medium |
| 3307 |
Find the K-th Character in String Game II |
Python |
Medium |
| 3309 |
Maximum Possible Number by Binary Concatenation |
Python |
Medium |
| 3310 |
Remove Methods from Project |
Python |
Medium |
| 3314 |
Construct the Minimum Bitwise Array I |
Python |
Easy |
| 3315 |
Construct the Minimum Bitwise Array II |
Python |
Medium |
| 3318 |
Find X Sum of All K Long Subarrays I |
Python |
Easy |
| 3319 |
K-th Largest Perfect Subtree Size in Binary Tree |
Python |
Medium |
| 3321 |
Find X-Sum of All K-Long Subarrays II |
Python |
Hard |
| 3324 |
Find the Sequence of Strings Appeared on the Screen |
Python |
Medium |
| 3325 |
Count Substrings with K Frequency Characters I |
Python |
Medium |
| 3328 |
Maximum Number of Operations to Move Ones to the End |
Python |
Medium |
| 3330 |
Find the Original Typed String I |
Python |
Easy |
| 3331 |
Find Subtree Sizes After Changes |
Python |
Medium |
| 3334 |
Find the Maximum Factor Score of Array |
Python |
Medium |
| 3335 |
Total Characters in String After Transformations I |
Python |
Medium |
| 3337 |
Total Characters in String After Transformations II |
Python |
Hard |
| 3340 |
Check Balanced String |
Python |
Easy |
| 3341 |
Find Minimum Time to Reach Last Room I |
Python |
Medium |
| 3342 |
Find Minimum Time to Reach Last Room II |
Python |
Medium |
| 3343 |
Count Number of Balanced Permutations |
Python |
Hard |
| 3345 |
Smallest Divisible Digit Product I |
Python |
Easy |
| 3346 |
Maximum Frequency of an Element After Performing Operations I |
Python |
Medium |
| 3347 |
Maximum Frequency of an Element After Performing Operations II |
Python |
Hard |
| 3349 |
Adjacent Increasing Subarrays Detection I |
Python |
Easy |
| 3350 |
Adjacent Increasing Subarrays Detection II |
Python |
Medium |
| 3354 |
Make Array Elements Equal to Zero |
Python |
Easy |
| 3355 |
Zero Array Transformation I |
Python |
Medium |
| 3356 |
Zero Array Transformation II |
Python |
Medium |
| 3360 |
Stone Removal Game |
Python |
Easy |
| 3361 |
Shift Distance Between Two Strings |
Python |
Medium |
| 3362 |
Zero Array Transformation III |
Python |
Medium |
| 3363 |
Find the Maximum Number of Fruits Collected |
Python |
Hard |
| 3364 |
Minimum Positive Sum Subarray |
Python |
Easy |
| 3365 |
Rearrange K Substrings to Form Target String |
Python |
Medium |
| 3370 |
Smallest Number with All Set Bits |
Python |
Easy |
| 3371 |
Identify the Largest Outlier in an Array |
Python |
Medium |
| 3372 |
Maximize the Number of Target Nodes After Connecting Trees I |
Python |
Medium |
| 3373 |
Maximize the Number of Target Nodes After Connecting Trees II |
Python |
Hard |
| 3375 |
Minimum Operations to Make Array Values Equal to K |
Python |
Easy |
| 3379 |
Transformed Array |
Python |
Easy |
| 3380 |
Maximum Area Rectangle With Point Constraints I |
Python |
Medium |
| 3381 |
Maximum Subarray Sum with Length Divisible by K |
Python |
Medium |
| 3386 |
Button With Longest Push Time |
Python |
Easy |
| 3387 |
Maximize Amount After Two Days of Conversions |
Python |
Medium |
| 3392 |
Count Subarrays of Length Three with a Condition |
Python |
Easy |
| 3393 |
Count Paths with the Given XOR Value |
Python |
Medium |
| 3394 |
Check if Grid Can Be Cut into Sections |
Python |
Medium |
| 3396 |
Minimum Number of Operations to Make Elements in Array Distinct |
Python |
Easy |
| 3397 |
Maximum Number of Distinct Elements After Operations |
Python |
Medium |
| 3402 |
Minimum Operations to Make Columns Strictly Increasing |
Python |
Easy |
| 3403 |
Find the Lexicographically Largest String from the Box I |
Python |
Medium |
| 3405 |
Count the Number of Arrays with K Matching Adjacent Elements |
Python |
Medium |
| 3407 |
Substring Matching Pattern |
Python |
Easy |
| 3408 |
Design Task Manager |
Python |
Medium |
| 3411 |
Maximum Subarray with Equal Products |
Python |
Easy |
| 3412 |
Find Mirror Score of a String |
Python |
Medium |
| 3417 |
Zigzag Grid Traversal With Skip |
Python |
Easy |
| 3418 |
Maximum Amount of Money Robot Can Earn |
Python |
Medium |
| 3423 |
Maximum Difference Between Adjacent Elements in a Circular Array |
Python |
Easy |
| 3424 |
Minimum Cost to Make Arrays Identical |
Python |
Medium |
| 3427 |
Sum of Variable Length Subarrays |
Python |
Easy |
| 3428 |
Maximum and Minimum Sums of At Most Size K Subsequences |
Python |
Medium |
| 3432 |
Count Partitions With Even Sum Difference |
Python |
Easy |
| 3433 |
Count Mentions Per User |
Python |
Medium |
| 3434 |
Maximum Frequency After Subarray Operation |
Python |
Medium |
| 3438 |
Find Valid Pair of Adjacent Digits in String |
Python |
Easy |
| 3439 |
Reschedule Meetings for Maximum Free Time I |
Python |
Medium |
| 3440 |
Reschedule Meetings for Maximum Free Time II |
Python |
Medium |
| 3442 |
Maximum Difference Between Even and Odd Frequency I |
Python |
Easy |
| 3443 |
Maximum Manhattan Distance After K Changes |
Python |
Medium |
| 3445 |
Maximum Difference Between Even and Odd Frequency II |
Python |
Hard |
| 3446 |
Sort Matrix by Diagonals |
Python |
Medium |
| 3447 |
Assign Elements to Groups With Constraints |
Python |
Medium |
| 3452 |
Sum of Good Numbers |
Python |
Easy |
| 3453 |
Separate Squares I |
Python |
Medium |
| 3454 |
Separate Squares II |
Python |
Hard |
| 3456 |
Find Special Substring of Length K |
Python |
Easy |
| 3457 |
Eat Pizzas |
Python |
Medium |
| 3459 |
Length of Longest V-Shaped Diagonal Segment |
Python |
Hard |
| 3461 |
Check if Digits Are Equal in String After Operations I |
Python |
Easy |
| 3462 |
Maximum Sum With At Most K Elements |
Python |
Medium |
| 3467 |
Transform Array by Parity |
Python |
Easy |
| 3468 |
Find the Number of Copy Arrays |
Python |
Medium |
| 3471 |
Find the Largest Almost Missing Integer |
Python |
Easy |
| 3473 |
Sum of K Subarrays With Length at Least M |
Python |
Medium |
| 3477 |
Fruits Into Baskets II |
Python |
Easy |
| 3478 |
Choose K Elements With Maximum Sum |
Python |
Medium |
| 3479 |
Fruits Into Baskets III |
Python |
Medium |
| 3480 |
Maximize Subarrays After Removing One Conflicting Pair |
Python |
Hard |
| 3483 |
Unique 3-Digit Even Numbers |
Python |
Easy |
| 3484 |
Design Spreadsheet |
Python |
Medium |
| 3487 |
Maximum Unique Subarray Sum After Deletion |
Python |
Easy |
| 3488 |
Closest Equal Element Queries |
Python |
Medium |
| 3489 |
Zero Array Transformation IV |
Python |
Medium |
| 3492 |
Maximum Containers on a Ship |
Python |
Easy |
| 3493 |
Properties Graph |
Python |
Medium |
| 3494 |
Find the Minimum Amount of Time to Brew Potions |
Python |
Medium |
| 3495 |
Minimum Operations to Make Array Elements Zero |
Python |
Hard |
| 3498 |
Reverse Degree of a String |
Python |
Easy |
| 3499 |
Maximize Active Section With Trade I |
Python |
Medium |
| 3502 |
Minimum Cost to Reach Every Position |
Python |
Easy |
| 3503 |
Longest Palindrome After Substring Concatenation I |
Python |
Medium |
| 3507 |
Minimum Pair Removal to Sort Array I |
Python |
Easy |
| 3508 |
Implement Router |
Python |
Medium |
| 3510 |
Minimum Pair Removal to Sort Array II |
Python |
Hard |
| 3512 |
Minimum Operations to Make Array Sum Divisible by K |
Python |
Easy |
| 3513 |
Number of Unique XOR Triplets I |
Python |
Medium |
| 3514 |
Number of Unique XOR Triplets II |
Python |
Medium |
| 3516 |
Find Closest Person |
Python |
Easy |
| 3517 |
Smallest Palindromic Rearrangement I |
Python |
Medium |
| 3519 |
Count Numbers With Non-Decreasing Digits |
Python |
Hard |
| 3522 |
Calculate Score After Performing Instructions |
Python |
Medium |
| 3523 |
Make Array Non-Decreasing |
Python |
Medium |
| 3524 |
Find X Value of Array I |
Python |
Medium |
| 3527 |
Find the Most Common Response |
Python |
Medium |
| 3528 |
Unit Conversion I |
Python |
Medium |
| 3531 |
Count Covered Buildings |
Python |
Medium |
| 3532 |
Path Existence Queries in a Graph I |
Python |
Medium |
| 3536 |
Maximum Product of Two Digits |
Python |
Easy |
| 3537 |
Fill a Special Grid |
Python |
Medium |
| 3539 |
Find Sum of Array Product of Magical Sequences |
Python |
Hard |
| 3541 |
Find Most Frequent Vowel and Consonant |
Python |
Easy |
| 3542 |
Minimum Operations to Convert All Elements to Zero |
Python |
Medium |
| 3545 |
Minimum Deletions for At Most K Distinct Characters |
Python |
Easy |
| 3546 |
Equal Sum Grid Partition I |
Python |
Medium |
| 3550 |
Minimum Swaps to Sort by Digit Sum |
Python |
Easy |
| 3551 |
Smallest Index With Digit Sum Equal to Index |
Python |
Medium |
| 3556 |
Sum of Largest Prime Substrings |
Python |
Medium |
| 3558 |
Number of Ways to Assign Edge Weights I |
Python |
Medium |
| 3560 |
Find Minimum Log Transportation Cost |
Python |
Easy |
| 3561 |
Resulting String After Adjacent Removals |
Python |
Medium |
| 3562 |
Maximum Profit from Trading Stocks with Discounts |
Python |
Hard |
| 3566 |
Partition Array into Two Equal Product Subsets |
Python |
Medium |
| 3567 |
Minimum Moves to Clean the Classroom |
Python |
Medium |
| 3568 |
Maximize Count of Distinct Primes After Split |
Python |
Medium |
| 3569 |
Minimum Absolute Difference in Sliding Submatrix |
Python |
Hard |
| 3576 |
Transform Array to All Equal Elements |
Python |
Medium |
| 3577 |
Count the Number of Computer Unlocking Permutations |
Python |
Medium |
| 3578 |
Count Partitions With Max-Min Difference At Most K |
Python |
Medium |
| 3582 |
Generate Tag for Video Caption |
Python |
Easy |
| 3583 |
Count Special Triplets |
Python |
Medium |
| 3584 |
Maximum Product of First and Last Elements of a Subsequence |
Python |
Medium |
| 3587 |
Minimum Adjacent Swaps to Alternate Parity |
Python |
Medium |
| 3588 |
Find Maximum Area of a Triangle |
Python |
Medium |
| 3591 |
Check if Any Element Has Prime Frequency |
Python |
Easy |
| 3592 |
Inverse Coin Change |
Python |
Medium |
| 3593 |
Minimum Increments to Equalize Leaf Paths |
Python |
Medium |
| 3597 |
Partition String |
Python |
Medium |
| 3599 |
Partition Array to Minimize XOR |
Python |
Medium |
| 3602 |
Hexadecimal and Hexatrigesimal Conversion |
Python |
Easy |
| 3603 |
Minimum Cost Path With Alternating Directions II |
Python |
Medium |
| 3604 |
Minimum Time to Reach Destination in Directed Graph |
Python |
Medium |
| 3606 |
Coupon Code Validator |
Python |
Easy |
| 3607 |
Power Grid Maintenance |
Python |
Medium |
| 3608 |
Minimum Time for K-Connected Components |
Python |
Medium |
| 3612 |
Process String With Special Operations I |
Python |
Medium |
| 3613 |
Minimize Maximum Component Cost |
[Python](./Python/3613-minimize-maximum -component-cost.py) |
Medium |
| 3614 |
Process String With Special Operations II |
Python |
Hard |
| 3622 |
Check Divisibility by Digit Sum and Product |
Python |
Easy |
| 3623 |
Count Number of Trapezoids I |
Python |
Medium |
| 3624 |
Number of Integers With Popcount Depth Equal to K II |
Python |
Hard |
| 3625 |
Count Number of Trapezoids II |
Python |
Hard |
| 3627 |
Maximum Median Sum of Subsequences of Size 3 |
Python |
Medium |
| 3628 |
Maximum Number of Subsequences After One Inserting |
Python |
Medium |
| 3633 |
Earliest Finish Time for Land and Water Rides I |
Python |
Easy |
| 3634 |
Minimum Removals to Balance Array |
Python |
Medium |
| 3635 |
Earliest Finish Time for Land and Water Rides II |
Python |
Medium |
| 3637 |
Trionic Array I |
Python |
[Easy](./Readme/3637-trionic-array-i .md) |
| 3638 |
Maximum Balanced Shipments |
Python |
Medium |
| 3640 |
Trionic Array II |
Python |
Hard |
| 3643 |
Flip Square Submatrix Vertically |
Python |
Easy |
| 3644 |
Maximum K to Sort a Permutation |
Python |
Medium |
| 3646 |
Next Special Palindrome Number |
Python |
Hard |
| 3648 |
Minimum Sensors to Cover Grid |
Python |
Medium |
| 3649 |
Number of Perfect Pairs |
Python |
Medium |
| 3650 |
Minimum Cost Path With Edge Reversals |
Python |
Medium |
| 3651 |
Minimum Cost Path With Teleportations |
Python |
Hard |
| 3652 |
Best Time to Buy and Sell Stock Using Strategy |
Python |
[Medium](./Readme/3652-best-time-to-buy-and -sell-stock-using-strategy.md) |
| 3653 |
XOR After Range Multiplication Queries I |
Python |
Medium |
| 3654 |
Minimum Sum After Divisible Sum Deletions |
Python |
Medium |
| 3658 |
GCD of Odd and Even Sums |
Python |
Easy |
| 3659 |
Partition Array into K Distinct Groups |
Python |
Medium |
| 3663 |
Find the Least Frequent Digit |
Python |
Easy |
| 3665 |
Twisted Mirror Path Count |
Python |
Medium |
| 3668 |
Restore Finishing Order |
Python |
Easy |
| 3669 |
Balanced K-Factor Decomposition |
Python |
Medium |
| 3674 |
Minimum Operations to Equalize Array |
Python |
Easy |
| 3675 |
Minimum Operations to Transform String |
Python |
Medium |
| 3676 |
Count Bowl Subarrays |
Python |
Medium |
| 3678 |
Smallest Absent Positive Greater Than Average |
Python |
Easy |
| 3679 |
Minimum Discards to Balance Inventory |
Python |
Medium |
| 3681 |
Maximum XOR of Subsequences |
Python |
Hard |
| 3688 |
Bitwise OR of Even Numbers in an Array |
Python |
Easy |
| 3689 |
Maximum Total Subarray Value I |
Python |
Medium |
| 3690 |
Split and Merge Array Transformation |
Python |
Medium |
| 3692 |
Majority Frequency Characters |
Python |
Easy |
| 3693 |
Climbing Stairs II |
Python |
Medium |
| 3694 |
Distinct Points Reachable After Substring Removal |
Python |
Medium |
| 3697 |
Compute Decimal Representation |
Python |
Easy |
| 3698 |
Split Array With Minimum Difference |
Python |
Medium |
| 3701 |
Compute Alternating Sum |
Python |
Easy |
| 3702 |
Longest Subsequence With Non-Zero Bitwise XOR |
Python |
Medium |
| 3703 |
Remove K-Balanced Substrings |
Python |
Medium |
| 3707 |
Equal Score Substrings |
Python |
Easy |
| 3708 |
Longest Fibonacci Subarray |
Python |
Medium |
| 3709 |
Design Exam Scores Tracker |
Python |
Medium |
| 3712 |
Sum of Elements With Frequency Divisible by K |
Python |
Easy |
| 3713 |
Longest Balanced Substring I |
Python |
Medium |
| 3715 |
Sum of Perfect Square Ancestors |
Python |
Hard |
| 3718 |
Smallest Missing Multiple of K |
Python |
Easy |
| 3719 |
Longest Balanced Subarray I |
Python |
Medium |
| 3720 |
Lexicographically Smallest Permutation Greater Than Target |
Python |
Medium |
| 3721 |
Longest Balanced Subarray II |
Python |
Hard |
| 3731 |
Find Missing Elements |
Python |
Easy |
| 3732 |
Maximum Product of Three Elements After One Replacement |
Python |
Medium |
| 3733 |
Minimum Time to Complete All Deliveries |
Python |
Medium |
| 3740 |
Minimum Distance Between Three Equal Elements I |
Python |
Easy |
| 3741 |
Minimum Distance Between Three Equal Elements II |
Python |
Medium |
| 3742 |
Maximum Path Score in a Grid |
Python |
Medium |
| 3745 |
Maximize Expression of Three Elements |
Python |
Easy |
| 3746 |
Minimum String Length After Balanced Removals |
Python |
Medium |
| 3747 |
Count Distinct Integers After Removing Zeros |
Python |
Medium |
| 3750 |
Minimum Number of Flips to Reverse Binary String |
Python |
Easy |
| 3751 |
Total Waviness of Numbers in Range I |
Python |
Medium |
| 3752 |
Lexicographically Smallest Negated Permutation That Sums to Target |
Python |
Medium |
| 3765 |
Complete Prime Number |
Python |
Medium |
| 3766 |
Minimum Operations to Make Binary Palindrome |
Python |
Medium |
| 3767 |
Maximize Points After Choosing K Tasks |
Python |
Medium |
| 3769 |
Sort Integers by Binary Reflection |
Python |
Easy |
| 3770 |
Largest Prime from Consecutive Prime Sum |
Python |
Medium |
| 3771 |
Total Score of Dungeon Runs |
Python |
Medium |
| 3774 |
Absolute Difference Between Maximum and Minimum K Elements |
Python |
Easy |
| 3775 |
Reverse Words With Same Vowel Count |
Python |
Medium |
| 3776 |
Minimum Moves to Balance Circular Array |
Python |
Medium |
| 3779 |
Minimum Number of Operations to Have Distinct Elements |
Python |
Medium |
| 3780 |
Maximum Sum of Three Numbers Divisible by Three |
Python |
Medium |
| 3781 |
Maximum Score After Binary Swaps |
Python |
Medium |
| 3783 |
Mirror Distance of an Integer |
Python |
Easy |
| 3784 |
Minimum Deletion Cost to Make All Characters Equal |
Python |
Medium |
| 3785 |
Minimum Swaps to Avoid Forbidden Values |
Python |
Hard |