| 1871 | Jump Game VII | Medium | solution.py |
| 1882 | Process Tasks Using Servers | Medium | solution.py |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | solution.py |
| 1891 | Cutting Ribbons | Medium | solution.py |
| 1897 | Redistribute Characters to Make All Strings Equal | Easy | solution.py |
| 1898 | Maximum Number of Removable Characters | Medium | solution.py |
| 1899 | Merge Triplets to Form Target Triplet | Medium | solution.py |
| 1903 | Largest Odd Number in String | Easy | solution.py |
| 1905 | Count Sub Islands | Medium | solution.py |
| 1911 | Maximum Alternating Subsequence Sum | Medium | solution.py |
| 1913 | Maximum Product Difference Between Two Pairs | Easy | solution.py |
| 1921 | Eliminate Maximum Number of Monsters | Medium | solution.py |
| 1929 | Concatenation of Array | Easy | solution.py |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium | solution.py |
| 1937 | Maximum Number of Points with Cost | Medium | solution.py |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | solution.py |
| 1944 | Number of Visible People in a Queue | Hard | solution.py |
| 1958 | Check if Move is Legal | Medium | solution.py |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | solution.py |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | solution.py |
| 1966 | Binary Searchable Numbers in an Unsorted Array | Medium | solution.py |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | solution.py |
| 1975 | Maximum Matrix Sum | Medium | solution.py |
| 1976 | Number of Ways to Arrive at Destination | Medium | solution.py |
| 1980 | Find Unique Binary String | Medium | solution.py |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | solution.py |
| 1985 | Find the Kth Largest Integer in the Array | Medium | solution.py |
| 1993 | Operations on Tree | Medium | solution.py |
| 2001 | Number of Pairs of Interchangeable Rectangles | Medium | solution.py |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | Medium | solution.py |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | solution.py |
| 2013 | Detect Squares | Medium | solution.py |
| 2017 | Grid Game | Medium | solution.py |
| 2021 | Brightest Position on Street | Medium | solution.py |
| 2022 | Convert 1D Array Into 2D Array | Easy | solution.py |
| 2028 | Find Missing Observations | Medium | solution.py |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | solution.py |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | solution.py |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | solution.py |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | solution.py |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | solution.py |
| 2045 | Second Minimum Time to Reach Destination | Hard | solution.py |
| 2050 | Parallel Courses III | Hard | solution.py |
| 2053 | Kth Distinct String in an Array | Easy | solution.py |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | solution.py |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | solution.py |
| 2070 | Most Beautiful Item for Each Query | Medium | solution.py |
| 2073 | Time Needed to Buy Tickets | Easy | solution.py |
| 2092 | Find All People With Secret | Hard | solution.py |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | solution.py |
| 2101 | Detonate the Maximum Bombs | Medium | solution.py |
| 2108 | Find First Palindromic String in the Array | Easy | solution.py |
| 2109 | Adding Spaces to a String | Medium | solution.py |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | solution.py |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | solution.py |
| 2125 | Number of Laser Beams in a Bank | Medium | solution.py |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | solution.py |
| 2130 | Maximum Twin Sum of a Linked List | Medium | solution.py |
| 2134 | Minimum Swaps to Group All 1’s Together II | Medium | solution.py |
| 2140 | Solving Questions With Brainpower | Medium | solution.py |
| 2147 | Number of Ways to Divide a Long Corridor | Hard | solution.py |
| 2149 | Rearrange Array Elements by Sign | Medium | solution.py |
| 2161 | Partition Array According to Given Pivot | Medium | solution.py |
| 2181 | Merge Nodes in Between Zeros | Medium | solution.py |
| 2182 | Construct String With Repeat Limit | Medium | solution.py |
| 2185 | Counting Words With a Given Prefix | Easy | solution.py |
| 2191 | Sort the Jumbled Numbers | Medium | solution.py |
| 2196 | Create Binary Tree From Descriptions | Medium | solution.py |
| 2206 | Divide Array Into Equal Pairs | Easy | solution.py |
| 2215 | Find the Difference of Two Arrays | Easy | solution.py |
| 2218 | Maximum Value of K Coins From Piles | Hard | solution.py |
| 2220 | Minimum Bit Flips to Convert Number | Easy | solution.py |
| 2226 | Maximum Candies Allocated to K Children | Medium | solution.py |
| 2251 | Number of Flowers in Full Bloom | Hard | solution.py |
| 2257 | Count Unguarded Cells in the Grid | Medium | solution.py |
| 2264 | Largest 3-Same-Digit Number in String | Easy | solution.py |
| 2270 | Number of Ways to Split Array | Medium | solution.py |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | solution.py |
| 2285 | Maximum Total Importance of Roads | Medium | solution.py |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard | solution.py |
| 2300 | Successful Pairs of Spells and Potions | Medium | solution.py |
| 2306 | Naming a Company | Hard | solution.py |
| 2326 | Spiral Matrix IV | Medium | solution.py |
| 2331 | Evaluate Boolean Binary Tree | Easy | solution.py |
| 2348 | Number of Zero-Filled Subarrays | Medium | solution.py |
| 2353 | Design a Food Rating System | Medium | solution.py |
| 2359 | Find Closest Node to Given Two Nodes | Medium | solution.py |
| 2364 | Count Number of Bad Pairs | Medium | solution.py |
| 2369 | Check if There is a Valid Partition For The Array | Medium | solution.py |
| 2370 | Longest Ideal Subsequence | Medium | solution.py |
| 2373 | Largest Local Values in a Matrix | Easy | solution.py |
| 2375 | Construct Smallest Number From DI String | Medium | solution.py |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | Easy | solution.py |
| 2381 | Shifting Letters II | Medium | solution.py |
| 2390 | Removing Stars From a String | Medium | solution.py |
| 2392 | Build a Matrix With Conditions | Hard | solution.py |
| 2393 | Count Strictly Increasing Subarrays | Medium | solution.py |
| 2401 | Longest Nice Subarray | Medium | solution.py |
| 2402 | Meeting Rooms III | Hard | solution.py |
| 2405 | Optimal Partition of String | Medium | solution.py |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium | solution.py |
| 2415 | Reverse Odd Levels of Binary Tree | Medium | solution.py |
| 2416 | Sum of Prefix Scores of Strings | Hard | solution.py |
| 2418 | Sort the People | Easy | solution.py |
| 2419 | Longest Subarray With Maximum Bitwise AND | Medium | solution.py |
| 2421 | Number of Good Paths | Hard | solution.py |
| 2425 | Bitwise XOR of All Pairings | Medium | solution.py |
| 2429 | Minimize XOR | Medium | solution.py |
| 2439 | Minimize Maximum of Array | Medium | solution.py |
| 2460 | Apply Operations to an Array | Easy | solution.py |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | solution.py |
| 2466 | Count Ways To Build Good Strings | Medium | solution.py |
| 2467 | Most Profitable Path in a Tree | Medium | solution.py |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium | solution.py |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | solution.py |
| 2483 | Minimum Penalty for a Shop | Medium | solution.py |
| 2486 | Append Characters to String to Make Subsequence | Medium | solution.py |
| 2487 | Remove Nodes From Linked List | Medium | solution.py |
| 2490 | Circular Sentence | Easy | solution.py |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | solution.py |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | solution.py |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard | solution.py |
| 2503 | Maximum Number of Points From Grid Queries | Hard | solution.py |
| 2516 | Take K of Each Character From Left and Right | Medium | solution.py |
| 2523 | Closest Prime Numbers in Range | Medium | solution.py |
| 2530 | Maximal Score After Applying K Operations | Medium | solution.py |
| 2534 | Time Taken to Cross the Door | Hard | solution.py |
| 2542 | Maximum Subsequence Score | Medium | solution.py |
| 2551 | Put Marbles in Bags | Hard | solution.py |
| 2558 | Take Gifts From the Richest Pile | Easy | solution.py |
| 2559 | Count Vowel Strings in Ranges | Medium | solution.py |
| 2560 | House Robber IV | Medium | solution.py |
| 2563 | Count the Number of Fair Pairs | Medium | solution.py |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | solution.py |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard | solution.py |
| 2579 | Count Total Number of Colored Cells | Medium | solution.py |
| 2583 | Kth Largest Sum in a Binary Tree | Medium | solution.py |
| 2594 | Minimum Time to Repair Cars | Medium | solution.py |
| 2597 | The Number of Beautiful Subsets | Medium | solution.py |
| 2601 | Prime Subtraction Operation | Medium | solution.py |
| 2610 | Convert an Array Into a 2D Array With Conditions | Medium | solution.py |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | solution.py |
| 2641 | Cousins in Binary Tree II | Medium | solution.py |
| 2658 | Maximum Number of Fish in a Grid | Medium | solution.py |
| 2678 | Number of Senior Citizens | Easy | solution.py |
| 2683 | Neighboring Bitwise XOR | Medium | solution.py |
| 2685 | Count the Number of Complete Components | Medium | solution.py |
| 2696 | Minimum String Length After Removing Substrings | Easy | solution.py |
| 2698 | Find the Punishment Number of an Integer | Medium | solution.py |
| 2706 | Buy Two Chocolates | Easy | solution.py |
| 2707 | Extra Characters in a String | Medium | solution.py |
| 2709 | Greatest Common Divisor Traversal | Hard | solution.py |
| 2742 | Painting the Walls | Hard | solution.py |
| 2751 | Robot Collisions | Hard | solution.py |
| 2779 | Maximum Beauty of an Array After Applying Operation | Medium | solution.py |
| 2780 | Minimum Index of a Valid Split | Medium | solution.py |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium | solution.py |
| 2812 | Find the Safest Path in a Grid | Medium | solution.py |
| 2818 | Apply Operations to Maximize Score | Hard | solution.py |
| 2864 | Maximum Odd Binary Number | Easy | solution.py |
| 2870 | Minimum Number of Operations to Make Array Empty | Medium | solution.py |
| 2872 | Maximum Number of K-Divisible Components | Hard | solution.py |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium | solution.py |
| 2924 | Find Champion II | Medium | solution.py |
| 2929 | Distribute Candies Among Children II | Medium | solution.py |
| 2938 | Separate Black and White Balls | Medium | solution.py |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | solution.py |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | solution.py |
| 2958 | Length of Longest Subarray With at Most K Frequency | Medium | solution.py |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | solution.py |
| 2965 | Find Missing and Repeated Values | Easy | solution.py |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | solution.py |
| 2971 | Find Polygon With the Largest Perimeter | Medium | solution.py |
| 2976 | Minimum Cost to Convert String I | Medium | solution.py |
| 3011 | Find if Array Can Be Sorted | Medium | solution.py |
| 3016 | Minimum Number of Pushes to Type Word II | Medium | solution.py |
| 3042 | Count Prefix and Suffix Pairs I | Easy | solution.py |
| 3043 | Find the Length of the Longest Common Prefix | Medium | solution.py |
| 3045 | Count Prefix and Suffix Pairs II | Hard | solution.py |
| 3068 | Find the Maximum Sum of Node Values | Hard | solution.py |
| 3097 | Shortest Subarray With OR at Least K II | Medium | solution.py |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | solution.py |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | solution.py |
| 3110 | Score of a String | Easy | solution.py |
| 3133 | Minimum Array End | Medium | solution.py |
| 3151 | Special Array I | Easy | solution.py |
| 3169 | Count Days Without Meetings | Medium | solution.py |
| 3174 | Clear Digits | Easy | solution.py |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | solution.py |
| 3199 | Count Triplets with Even XOR Set Bits I | Easy | solution.py |
| 3203 | Find Minimum Diameter After Merging Two Trees | Hard | solution.py |
| 3208 | Alternating Groups II | Medium | solution.py |
| 3217 | Delete Nodes From Linked List Present in Array | Medium | solution.py |
| 3223 | Minimum Length of String After Operations | Medium | solution.py |
| 3243 | Shortest Distance After Road Addition Queries I | Medium | solution.py |
| 3254 | Find the Power of K-Size Subarrays I | Medium | solution.py |
| 3264 | Final Array State After K Multiplication Operations I | Easy | solution.py |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium | solution.py |
| 3394 | Check if Grid can be Cut into Sections | Medium | solution.py |
| 3434 | Maximum Frequency After Subarray Operation | Medium | solution.py |