> ## Documentation Index
> Fetch the complete documentation index at: https://leetcode-py.wisl.dev/llms.txt
> Use this file to discover all available pages before exploring further.

> ## Agent Instructions
> leetcode-py is a Python LeetCode practice environment generator with one CLI: lcpy. It is not a service or platform.
> Each problem is a directory under leetcode/ with README.md, solution.py, test_solution.py, helpers.py, and playground.ipynb. lcpy gen creates them from JSON templates bundled with the package.
> Examples are backed by tests; copy them verbatim.

# Binary Search in Python with Tests

> All 122 Binary Search LeetCode problems with tested Python solutions.

Binary Search holds 122 problems (16 Easy, 72 Medium, 34 Hard).
Generate any of them into the current directory with `lcpy gen -n <number>`.

| # | Problem | Difficulty | Solution |
| - | - | - | - |
| 4 | [Median of Two Sorted Arrays](https://leetcode-py.wisl.dev/problems/median-of-two-sorted-arrays) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/median_of_two_sorted_arrays/solution.py) |
| 33 | [Search in Rotated Sorted Array](https://leetcode-py.wisl.dev/problems/search-in-rotated-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array/solution.py) |
| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode-py.wisl.dev/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_first_and_last_position_of_element_in_sorted_array/solution.py) |
| 35 | [Search Insert Position](https://leetcode-py.wisl.dev/problems/search-insert-position) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_insert_position/solution.py) |
| 69 | [Sqrt(x)](https://leetcode-py.wisl.dev/problems/sqrtx) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sqrtx/solution.py) |
| 74 | [Search a 2D Matrix](https://leetcode-py.wisl.dev/problems/search-a-2d-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_a_2d_matrix/solution.py) |
| 81 | [Search in Rotated Sorted Array II](https://leetcode-py.wisl.dev/problems/search-in-rotated-sorted-array-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array_ii/solution.py) |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode-py.wisl.dev/problems/find-minimum-in-rotated-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array/solution.py) |
| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode-py.wisl.dev/problems/find-minimum-in-rotated-sorted-array-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array_ii/solution.py) |
| 162 | [Find Peak Element](https://leetcode-py.wisl.dev/problems/find-peak-element) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_peak_element/solution.py) |
| 167 | [Two Sum II - Input Array Is Sorted](https://leetcode-py.wisl.dev/problems/two-sum-ii-input-array-is-sorted) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_ii_input_array_is_sorted/solution.py) |
| 209 | [Minimum Size Subarray Sum](https://leetcode-py.wisl.dev/problems/minimum-size-subarray-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_size_subarray_sum/solution.py) |
| 222 | [Count Complete Tree Nodes](https://leetcode-py.wisl.dev/problems/count-complete-tree-nodes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_complete_tree_nodes/solution.py) |
| 240 | [Search a 2D Matrix II](https://leetcode-py.wisl.dev/problems/search-a-2d-matrix-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_a_2d_matrix_ii/solution.py) |
| 259 | [3Sum Smaller](https://leetcode-py.wisl.dev/problems/three-sum-smaller) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum_smaller/solution.py) |
| 268 | [Missing Number](https://leetcode-py.wisl.dev/problems/missing-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_number/solution.py) |
| 270 | [Closest Binary Search Tree Value](https://leetcode-py.wisl.dev/problems/closest-bst-value) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/closest_bst_value/solution.py) |
| 275 | [H-Index II](https://leetcode-py.wisl.dev/problems/h-index-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/h_index_ii/solution.py) |
| 278 | [First Bad Version](https://leetcode-py.wisl.dev/problems/first-bad-version) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/first_bad_version/solution.py) |
| 287 | [Find the Duplicate Number](https://leetcode-py.wisl.dev/problems/find-the-duplicate-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_duplicate_number/solution.py) |
| 300 | [Longest Increasing Subsequence](https://leetcode-py.wisl.dev/problems/longest-increasing-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_increasing_subsequence/solution.py) |
| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode-py.wisl.dev/problems/smallest-rectangle-enclosing-black-pixels) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_rectangle_enclosing_black_pixels/solution.py) |
| 315 | [Count of Smaller Numbers After Self](https://leetcode-py.wisl.dev/problems/count-smaller-numbers-after-self) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_smaller_numbers_after_self/solution.py) |
| 327 | [Count of Range Sum](https://leetcode-py.wisl.dev/problems/count-of-range-sum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_of_range_sum/solution.py) |
| 349 | [Intersection of Two Arrays](https://leetcode-py.wisl.dev/problems/intersection-of-two-arrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/intersection_of_two_arrays/solution.py) |
| 350 | [Intersection of Two Arrays II](https://leetcode-py.wisl.dev/problems/intersection-of-two-arrays-ii) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/intersection_of_two_arrays_ii/solution.py) |
| 352 | [Data Stream as Disjoint Intervals](https://leetcode-py.wisl.dev/problems/data-stream-as-disjoint-intervals) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/data_stream_as_disjoint_intervals/solution.py) |
| 354 | [Russian Doll Envelopes](https://leetcode-py.wisl.dev/problems/russian-doll-envelopes) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/russian_doll_envelopes/solution.py) |
| 362 | [Design Hit Counter](https://leetcode-py.wisl.dev/problems/design-hit-counter) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_hit_counter/solution.py) |
| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode-py.wisl.dev/problems/max-sum-of-rectangle-no-larger-than-k) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/max_sum_of_rectangle_no_larger_than_k/solution.py) |
| 367 | [Valid Perfect Square](https://leetcode-py.wisl.dev/problems/valid-perfect-square) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_perfect_square/solution.py) |
| 374 | [Guess Number Higher or Lower](https://leetcode-py.wisl.dev/problems/guess-number-higher-or-lower) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/guess_number_higher_or_lower/solution.py) |
| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode-py.wisl.dev/problems/kth-smallest-element-in-a-sorted-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_element_in_a_sorted_matrix/solution.py) |
| 400 | [Nth Digit](https://leetcode-py.wisl.dev/problems/nth-digit) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/nth_digit/solution.py) |
| 410 | [Split Array Largest Sum](https://leetcode-py.wisl.dev/problems/split-array-largest-sum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/split_array_largest_sum/solution.py) |
| 436 | [Find Right Interval](https://leetcode-py.wisl.dev/problems/find-right-interval) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_right_interval/solution.py) |
| 441 | [Arranging Coins](https://leetcode-py.wisl.dev/problems/arranging-coins) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/arranging_coins/solution.py) |
| 456 | [132 Pattern](https://leetcode-py.wisl.dev/problems/pattern-132) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pattern_132/solution.py) |
| 475 | [Heaters](https://leetcode-py.wisl.dev/problems/heaters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/heaters/solution.py) |
| 483 | [Smallest Good Base](https://leetcode-py.wisl.dev/problems/smallest-good-base) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_good_base/solution.py) |
| 493 | [Reverse Pairs](https://leetcode-py.wisl.dev/problems/reverse-pairs) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_pairs/solution.py) |
| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode-py.wisl.dev/problems/random-point-in-non-overlapping-rectangles) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_point_in_non_overlapping_rectangles/solution.py) |
| 528 | [Random Pick with Weight](https://leetcode-py.wisl.dev/problems/random-pick-with-weight) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_pick_with_weight/solution.py) |
| 532 | [K-diff Pairs in an Array](https://leetcode-py.wisl.dev/problems/k-diff-pairs-in-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/k_diff_pairs_in_an_array/solution.py) |
| 540 | [Single Element in a Sorted Array](https://leetcode-py.wisl.dev/problems/single-element-in-a-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_element_in_a_sorted_array/solution.py) |
| 611 | [Valid Triangle Number](https://leetcode-py.wisl.dev/problems/valid-triangle-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_triangle_number/solution.py) |
| 633 | [Sum of Square Numbers](https://leetcode-py.wisl.dev/problems/sum-of-square-numbers) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_square_numbers/solution.py) |
| 644 | [Maximum Average Subarray II](https://leetcode-py.wisl.dev/problems/maximum-average-subarray-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_average_subarray_ii/solution.py) |
| 658 | [Find K Closest Elements](https://leetcode-py.wisl.dev/problems/find-k-closest-elements) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_k_closest_elements/solution.py) |
| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode-py.wisl.dev/problems/kth-smallest-number-in-multiplication-table) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_number_in_multiplication_table/solution.py) |
| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode-py.wisl.dev/problems/search-in-a-sorted-array-of-unknown-size) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_a_sorted_array_of_unknown_size/solution.py) |
| 704 | [Binary Search](https://leetcode-py.wisl.dev/problems/binary-search) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_search/solution.py) |
| 710 | [Random Pick with Blacklist](https://leetcode-py.wisl.dev/problems/random-pick-with-blacklist) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_pick_with_blacklist/solution.py) |
| 718 | [Maximum Length of Repeated Subarray](https://leetcode-py.wisl.dev/problems/maximum-length-of-repeated-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_length_of_repeated_subarray/solution.py) |
| 719 | [Find K-th Smallest Pair Distance](https://leetcode-py.wisl.dev/problems/find-k-th-smallest-pair-distance) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_k_th_smallest_pair_distance/solution.py) |
| 729 | [My Calendar I](https://leetcode-py.wisl.dev/problems/my-calendar-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/my_calendar_i/solution.py) |
| 731 | [My Calendar II](https://leetcode-py.wisl.dev/problems/my-calendar-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/my_calendar_ii/solution.py) |
| 732 | [My Calendar III](https://leetcode-py.wisl.dev/problems/my-calendar-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/my_calendar_iii/solution.py) |
| 744 | [Find Smallest Letter Greater Than Target](https://leetcode-py.wisl.dev/problems/find-smallest-letter-greater-than-target) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_smallest_letter_greater_than_target/solution.py) |
| 754 | [Reach a Number](https://leetcode-py.wisl.dev/problems/reach-a-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reach_a_number/solution.py) |
| 774 | [Minimize Max Distance to Gas Station](https://leetcode-py.wisl.dev/problems/minimize-max-distance-to-gas-station) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_max_distance_to_gas_station/solution.py) |
| 778 | [Swim in Rising Water](https://leetcode-py.wisl.dev/problems/swim-in-rising-water) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/swim_in_rising_water/solution.py) |
| 786 | [K-th Smallest Prime Fraction](https://leetcode-py.wisl.dev/problems/k-th-smallest-prime-fraction) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/k_th_smallest_prime_fraction/solution.py) |
| 792 | [Number of Matching Subsequences](https://leetcode-py.wisl.dev/problems/number-of-matching-subsequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_matching_subsequences/solution.py) |
| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode-py.wisl.dev/problems/preimage-size-of-factorial-zeroes-function) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/preimage_size_of_factorial_zeroes_function/solution.py) |
| 825 | [Friends Of Appropriate Ages](https://leetcode-py.wisl.dev/problems/friends-of-appropriate-ages) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/friends_of_appropriate_ages/solution.py) |
| 826 | [Most Profit Assigning Work](https://leetcode-py.wisl.dev/problems/most-profit-assigning-work) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_profit_assigning_work/solution.py) |
| 852 | [Peak Index in a Mountain Array](https://leetcode-py.wisl.dev/problems/peak-index-in-a-mountain-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/peak_index_in_a_mountain_array/solution.py) |
| 862 | [Shortest Subarray with Sum at Least K](https://leetcode-py.wisl.dev/problems/shortest-subarray-with-sum-at-least-k) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_subarray_with_sum_at_least_k/solution.py) |
| 875 | [Koko Eating Bananas](https://leetcode-py.wisl.dev/problems/koko-eating-bananas) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/koko_eating_bananas/solution.py) |
| 878 | [Nth Magical Number](https://leetcode-py.wisl.dev/problems/nth-magical-number) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/nth_magical_number/solution.py) |
| 887 | [Super Egg Drop](https://leetcode-py.wisl.dev/problems/super-egg-drop) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/super_egg_drop/solution.py) |
| 888 | [Fair Candy Swap](https://leetcode-py.wisl.dev/problems/fair-candy-swap) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/fair_candy_swap/solution.py) |
| 902 | [Numbers At Most N Given Digit Set](https://leetcode-py.wisl.dev/problems/numbers-at-most-n-given-digit-set) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/numbers_at_most_n_given_digit_set/solution.py) |
| 911 | [Online Election](https://leetcode-py.wisl.dev/problems/online-election) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/online_election/solution.py) |
| 981 | [Time Based Key-Value Store](https://leetcode-py.wisl.dev/problems/time-based-key-value-store) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/time_based_key_value_store/solution.py) |
| 1004 | [Max Consecutive Ones III](https://leetcode-py.wisl.dev/problems/max-consecutive-ones-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/max_consecutive_ones_iii/solution.py) |
| 1011 | [Capacity To Ship Packages Within D Days](https://leetcode-py.wisl.dev/problems/capacity-to-ship-packages-within-d-days) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/capacity_to_ship_packages_within_d_days/solution.py) |
| 1060 | [Missing Element in Sorted Array](https://leetcode-py.wisl.dev/problems/missing-element-in-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_element_in_sorted_array/solution.py) |
| 1095 | [Find in Mountain Array](https://leetcode-py.wisl.dev/problems/find-in-mountain-array) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_in_mountain_array/solution.py) |
| 1099 | [Two Sum Less Than K](https://leetcode-py.wisl.dev/problems/two-sum-less-than-k) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_less_than_k/solution.py) |
| 1102 | [Path With Maximum Minimum Value](https://leetcode-py.wisl.dev/problems/path-with-maximum-minimum-value) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/path_with_maximum_minimum_value/solution.py) |
| 1150 | [Check If a Number Is Majority Element in a Sorted Array](https://leetcode-py.wisl.dev/problems/check-if-a-number-is-majority-element-in-a-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_a_number_is_majority_element_in_a_sorted_array/solution.py) |
| 1198 | [Find Smallest Common Element in All Rows](https://leetcode-py.wisl.dev/problems/find-smallest-common-element-in-all-rows) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_smallest_common_element_in_all_rows/solution.py) |
| 1208 | [Get Equal Substrings Within Budget](https://leetcode-py.wisl.dev/problems/get-equal-substrings-within-budget) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/get_equal_substrings_within_budget/solution.py) |
| 1214 | [Two Sum BSTs](https://leetcode-py.wisl.dev/problems/two-sum-bsts) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_bsts/solution.py) |
| 1231 | [Divide Chocolate](https://leetcode-py.wisl.dev/problems/divide-chocolate) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_chocolate/solution.py) |
| 1235 | [Maximum Profit in Job Scheduling](https://leetcode-py.wisl.dev/problems/maximum-profit-in-job-scheduling) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_profit_in_job_scheduling/solution.py) |
| 1268 | [Search Suggestions System](https://leetcode-py.wisl.dev/problems/search-suggestions-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_suggestions_system/solution.py) |
| 1428 | [Leftmost Column with at Least a One](https://leetcode-py.wisl.dev/problems/leftmost-column-with-one) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/leftmost_column_with_one/solution.py) |
| 1498 | [Number of Subsequences That Satisfy the Given Sum Condition](https://leetcode-py.wisl.dev/problems/number-of-subsequences-that-satisfy-the-given-sum-condition) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_subsequences_that_satisfy_the_given_sum_condition/solution.py) |
| 1508 | [Range Sum of Sorted Subarray Sums](https://leetcode-py.wisl.dev/problems/range-sum-of-sorted-subarray-sums) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_of_sorted_subarray_sums/solution.py) |
| 1533 | [Find the Index of the Large Integer](https://leetcode-py.wisl.dev/problems/find-the-index-of-the-large-integer) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_index_of_the_large_integer/solution.py) |
| 1574 | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode-py.wisl.dev/problems/shortest-subarray-to-be-removed-to-make-array-sorted) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_subarray_to_be_removed_to_make_array_sorted/solution.py) |
| 1608 | [Special Array With X Elements Greater Than or Equal X](https://leetcode-py.wisl.dev/problems/special-array-with-x-elements-greater-than-or-equal-x) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/special_array_with_x_elements_greater_than_or_equal_x/solution.py) |
| 1631 | [Path With Minimum Effort](https://leetcode-py.wisl.dev/problems/path-with-minimum-effort) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/path_with_minimum_effort/solution.py) |
| 1658 | [Minimum Operations to Reduce X to Zero](https://leetcode-py.wisl.dev/problems/minimum-operations-to-reduce-x-to-zero) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_operations_to_reduce_x_to_zero/solution.py) |
| 1671 | [Minimum Number of Removals to Make Mountain Array](https://leetcode-py.wisl.dev/problems/minimum-number-of-removals-to-make-mountain-array) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_removals_to_make_mountain_array/solution.py) |
| 1760 | [Minimum Limit of Balls in a Bag](https://leetcode-py.wisl.dev/problems/minimum-limit-of-balls-in-a-bag) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_limit_of_balls_in_a_bag/solution.py) |
| 1793 | [Maximum Score of a Good Subarray](https://leetcode-py.wisl.dev/problems/maximum-score-of-a-good-subarray) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_score_of_a_good_subarray/solution.py) |
| 1838 | [Frequency of the Most Frequent Element](https://leetcode-py.wisl.dev/problems/frequency-of-the-most-frequent-element) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/frequency_of_the_most_frequent_element/solution.py) |
| 1851 | [Minimum Interval to Include Each Query](https://leetcode-py.wisl.dev/problems/minimum-interval-to-include-each-query) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_interval_to_include_each_query/solution.py) |
| 1891 | [Cutting Ribbons](https://leetcode-py.wisl.dev/problems/cutting-ribbons) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/cutting_ribbons/solution.py) |
| 1898 | [Maximum Number of Removable Characters](https://leetcode-py.wisl.dev/problems/maximum-number-of-removable-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_removable_characters/solution.py) |
| 1964 | [Find the Longest Valid Obstacle Course at Each Position](https://leetcode-py.wisl.dev/problems/find-the-longest-valid-obstacle-course-at-each-position) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_longest_valid_obstacle_course_at_each_position/solution.py) |
| 1966 | [Binary Searchable Numbers in an Unsorted Array](https://leetcode-py.wisl.dev/problems/binary-searchable-numbers-in-an-unsorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_searchable_numbers_in_an_unsorted_array/solution.py) |
| 2009 | [Minimum Number of Operations to Make Array Continuous](https://leetcode-py.wisl.dev/problems/minimum-number-of-operations-to-make-array-continuous) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_operations_to_make_array_continuous/solution.py) |
| 2040 | [Kth Smallest Product of Two Sorted Arrays](https://leetcode-py.wisl.dev/problems/kth-smallest-product-of-two-sorted-arrays) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_product_of_two_sorted_arrays/solution.py) |
| 2064 | [Minimized Maximum of Products Distributed to Any Store](https://leetcode-py.wisl.dev/problems/minimized-maximum-of-products-distributed-to-any-store) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimized_maximum_of_products_distributed_to_any_store/solution.py) |
| 2070 | [Most Beautiful Item for Each Query](https://leetcode-py.wisl.dev/problems/most-beautiful-item-for-each-query) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_beautiful_item_for_each_query/solution.py) |
| 2226 | [Maximum Candies Allocated to K Children](https://leetcode-py.wisl.dev/problems/maximum-candies-allocated-to-k-children) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_candies_allocated_to_k_children/solution.py) |
| 2251 | [Number of Flowers in Full Bloom](https://leetcode-py.wisl.dev/problems/number-of-flowers-in-full-bloom) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_flowers_in_full_bloom/solution.py) |
| 2300 | [Successful Pairs of Spells and Potions](https://leetcode-py.wisl.dev/problems/successful-pairs-of-spells-and-potions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/successful_pairs_of_spells_and_potions/solution.py) |
| 2439 | [Minimize Maximum of Array](https://leetcode-py.wisl.dev/problems/minimize-maximum-of-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_maximum_of_array/solution.py) |
| 2560 | [House Robber IV](https://leetcode-py.wisl.dev/problems/house-robber-iv) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber_iv/solution.py) |
| 2563 | [Count the Number of Fair Pairs](https://leetcode-py.wisl.dev/problems/count-the-number-of-fair-pairs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_the_number_of_fair_pairs/solution.py) |
| 2594 | [Minimum Time to Repair Cars](https://leetcode-py.wisl.dev/problems/minimum-time-to-repair-cars) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_time_to_repair_cars/solution.py) |
| 2601 | [Prime Subtraction Operation](https://leetcode-py.wisl.dev/problems/prime-subtraction-operation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/prime_subtraction_operation/solution.py) |
| 2616 | [Minimize the Maximum Difference of Pairs](https://leetcode-py.wisl.dev/problems/minimize-the-maximum-difference-of-pairs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_the_maximum_difference_of_pairs/solution.py) |
| 2779 | [Maximum Beauty of an Array After Applying Operation](https://leetcode-py.wisl.dev/problems/maximum-beauty-of-an-array-after-applying-operation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_beauty_of_an_array_after_applying_operation/solution.py) |
| 2812 | [Find the Safest Path in a Grid](https://leetcode-py.wisl.dev/problems/find-the-safest-path-in-a-grid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_safest_path_in_a_grid/solution.py) |
| 2940 | [Find Building Where Alice and Bob Can Meet](https://leetcode-py.wisl.dev/problems/find-building-where-alice-and-bob-can-meet) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_building_where_alice_and_bob_can_meet/solution.py) |


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.