| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | solution.py |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | solution.py |
| 1358 | Number of Substrings Containing All Three Characters | Medium | solution.py |
| 1361 | Validate Binary Tree Nodes | Medium | solution.py |
| 1367 | Linked List in Binary Tree | Medium | solution.py |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Medium | solution.py |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium | solution.py |
| 1376 | Time Needed to Inform All Employees | Medium | solution.py |
| 1395 | Count Number of Teams | Medium | solution.py |
| 1396 | Design Underground System | Medium | solution.py |
| 1400 | Construct K Palindrome Strings | Medium | solution.py |
| 1405 | Longest Happy String | Medium | solution.py |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | Medium | solution.py |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | solution.py |
| 1428 | Leftmost Column with at Least a One | Medium | solution.py |
| 1429 | First Unique Number | Medium | solution.py |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | solution.py |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Medium | solution.py |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | solution.py |
| 1448 | Count Good Nodes in Binary Tree | Medium | solution.py |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | solution.py |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | solution.py |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | solution.py |
| 1462 | Course Schedule IV | Medium | solution.py |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | solution.py |
| 1472 | Design Browser History | Medium | solution.py |
| 1481 | Least Number of Unique Integers after K Removals | Medium | solution.py |
| 1490 | Clone N-ary Tree | Medium | solution.py |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | solution.py |
| 1506 | Find Root of N-Ary Tree | Medium | solution.py |
| 1508 | Range Sum of Sorted Subarray Sums | Medium | solution.py |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | solution.py |
| 1514 | Path with Maximum Probability | Medium | solution.py |
| 1522 | Diameter of N-Ary Tree | Medium | solution.py |
| 1524 | Number of Sub-arrays With Odd Sum | Medium | solution.py |
| 1530 | Number of Good Leaf Nodes Pairs | Medium | solution.py |
| 1533 | Find the Index of the Large Integer | Medium | solution.py |
| 1538 | Guess the Majority in a Hidden Array | Medium | solution.py |
| 1545 | Find Kth Bit in Nth Binary String | Medium | solution.py |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | solution.py |
| 1564 | Put Boxes Into the Warehouse I | Medium | solution.py |
| 1570 | Dot Product of Two Sparse Vectors | Medium | solution.py |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | solution.py |
| 1578 | Minimum Time to Make Rope Colorful | Medium | solution.py |
| 1584 | Min Cost to Connect All Points | Medium | solution.py |
| 1590 | Make Sum Divisible by P | Medium | solution.py |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium | solution.py |
| 1605 | Find Valid Matrix Given Row and Column Sums | Medium | solution.py |
| 1609 | Even Odd Tree | Medium | solution.py |
| 1626 | Best Team With No Conflicts | Medium | solution.py |
| 1631 | Path With Minimum Effort | Medium | solution.py |
| 1642 | Furthest Building You Can Reach | Medium | solution.py |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | solution.py |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | solution.py |
| 1653 | Minimum Deletions to Make String Balanced | Medium | solution.py |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | solution.py |
| 1669 | Merge In Between Linked Lists | Medium | solution.py |
| 1685 | Sum of Absolute Differences in a Sorted Array | Medium | solution.py |
| 1701 | Average Waiting Time | Medium | solution.py |
| 1717 | Maximum Score From Removing Substrings | Medium | solution.py |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Medium | solution.py |
| 1721 | Swapping Nodes in a Linked List | Medium | solution.py |
| 1726 | Tuple with Same Product | Medium | solution.py |
| 1727 | Largest Submatrix With Rearrangements | Medium | solution.py |
| 1730 | Shortest Path to Get Food | Medium | solution.py |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium | solution.py |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium | solution.py |
| 1760 | Minimum Limit of Balls in a Bag | Medium | solution.py |
| 1762 | Buildings With an Ocean View | Medium | solution.py |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | solution.py |
| 1780 | Check if Number is a Sum of Powers of Three | Medium | solution.py |
| 1813 | Sentence Similarity III | Medium | solution.py |
| 1823 | Find the Winner of the Circular Game | Medium | solution.py |
| 1829 | Maximum XOR for Each Query | Medium | solution.py |
| 1834 | Single-Threaded CPU | Medium | solution.py |
| 1836 | Remove Duplicates From an Unsorted Linked List | Medium | solution.py |
| 1838 | Frequency of the Most Frequent Element | Medium | solution.py |
| 1845 | Seat Reservation Manager | Medium | solution.py |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium | solution.py |
| 1849 | Splitting a String Into Descending Consecutive Values | Medium | solution.py |
| 1856 | Maximum Subarray Min-Product | Medium | solution.py |
| 1861 | Rotating the Box | Medium | solution.py |
| 1868 | Product of Two Run-Length Encoded Arrays | Medium | solution.py |
| 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 |
| 1898 | Maximum Number of Removable Characters | Medium | solution.py |
| 1899 | Merge Triplets to Form Target Triplet | Medium | solution.py |
| 1905 | Count Sub Islands | Medium | solution.py |
| 1911 | Maximum Alternating Subsequence Sum | Medium | solution.py |
| 1921 | Eliminate Maximum Number of Monsters | Medium | 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 |
| 1958 | Check if Move is Legal | Medium | solution.py |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | 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 |
| 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 |
| 2013 | Detect Squares | Medium | solution.py |
| 2017 | Grid Game | Medium | solution.py |
| 2021 | Brightest Position on Street | Medium | solution.py |
| 2028 | Find Missing Observations | Medium | solution.py |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | solution.py |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | solution.py |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | 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 |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | solution.py |
| 2101 | Detonate the Maximum Bombs | Medium | 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 |
| 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 |
| 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 |
| 2191 | Sort the Jumbled Numbers | Medium | solution.py |
| 2196 | Create Binary Tree From Descriptions | Medium | solution.py |
| 2226 | Maximum Candies Allocated to K Children | Medium | solution.py |
| 2257 | Count Unguarded Cells in the Grid | Medium | 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 |
| 2300 | Successful Pairs of Spells and Potions | Medium | solution.py |
| 2326 | Spiral Matrix IV | Medium | 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 |
| 2375 | Construct Smallest Number From DI String | Medium | solution.py |
| 2381 | Shifting Letters II | Medium | solution.py |
| 2390 | Removing Stars From a String | Medium | solution.py |
| 2393 | Count Strictly Increasing Subarrays | Medium | solution.py |
| 2401 | Longest Nice Subarray | Medium | 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 |
| 2419 | Longest Subarray With Maximum Bitwise AND | Medium | 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 |
| 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 |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | solution.py |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | 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 |
| 2542 | Maximum Subsequence Score | Medium | 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 |
| 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 |
| 2683 | Neighboring Bitwise XOR | Medium | solution.py |
| 2685 | Count the Number of Complete Components | Medium | solution.py |
| 2698 | Find the Punishment Number of an Integer | Medium | solution.py |
| 2707 | Extra Characters in a String | Medium | 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 |
| 2870 | Minimum Number of Operations to Make Array Empty | Medium | 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 |
| 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 |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | solution.py |
| 2971 | Find Polygon With the Largest Perimeter | Medium | solution.py |