> ## 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.

# Array in Python, Part 4

> All 782 Array LeetCode problems with tested Python solutions. Part 4 of 4: problems 601-782.

Array holds 782 problems (154 Easy, 466 Medium, 162 Hard).
Generate any of them into the current directory with `lcpy gen -n <number>`.

| # | Problem | Difficulty | Solution |
| - | - | - | - |
| 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) |
| 1636 | [Sort Array by Increasing Frequency](https://leetcode-py.wisl.dev/problems/sort-array-by-increasing-frequency) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_array_by_increasing_frequency/solution.py) |
| 1637 | [Widest Vertical Area Between Two Points Containing No Points](https://leetcode-py.wisl.dev/problems/widest-vertical-area-between-two-points-containing-no-points) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/widest_vertical_area_between_two_points_containing_no_points/solution.py) |
| 1639 | [Number of Ways to Form a Target String Given a Dictionary](https://leetcode-py.wisl.dev/problems/number-of-ways-to-form-a-target-string-given-a-dictionary) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ways_to_form_a_target_string_given_a_dictionary/solution.py) |
| 1642 | [Furthest Building You Can Reach](https://leetcode-py.wisl.dev/problems/furthest-building-you-can-reach) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/furthest_building_you_can_reach/solution.py) |
| 1652 | [Defuse the Bomb](https://leetcode-py.wisl.dev/problems/defuse-the-bomb) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/defuse_the_bomb/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) |
| 1662 | [Check If Two String Arrays are Equivalent](https://leetcode-py.wisl.dev/problems/array-strings-are-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/array_strings_are_equal/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) |
| 1675 | [Minimize Deviation in Array](https://leetcode-py.wisl.dev/problems/minimize-deviation-in-array) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_deviation_in_array/solution.py) |
| 1684 | [Count the Number of Consistent Strings](https://leetcode-py.wisl.dev/problems/count-the-number-of-consistent-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_the_number_of_consistent_strings/solution.py) |
| 1685 | [Sum of Absolute Differences in a Sorted Array](https://leetcode-py.wisl.dev/problems/sum-of-absolute-differences-in-a-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_absolute_differences_in_a_sorted_array/solution.py) |
| 1700 | [Number of Students Unable to Eat Lunch](https://leetcode-py.wisl.dev/problems/number-of-students-unable-to-eat-lunch) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_students_unable_to_eat_lunch/solution.py) |
| 1701 | [Average Waiting Time](https://leetcode-py.wisl.dev/problems/average-waiting-time) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/average_waiting_time/solution.py) |
| 1718 | [Construct the Lexicographically Largest Valid Sequence](https://leetcode-py.wisl.dev/problems/construct-the-lexicographically-largest-valid-sequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_the_lexicographically_largest_valid_sequence/solution.py) |
| 1726 | [Tuple with Same Product](https://leetcode-py.wisl.dev/problems/tuple-with-same-product) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/tuple_with_same_product/solution.py) |
| 1727 | [Largest Submatrix With Rearrangements](https://leetcode-py.wisl.dev/problems/largest-submatrix-with-rearrangements) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_submatrix_with_rearrangements/solution.py) |
| 1730 | [Shortest Path to Get Food](https://leetcode-py.wisl.dev/problems/shortest-path-to-get-food) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_path_to_get_food/solution.py) |
| 1749 | [Maximum Absolute Sum of Any Subarray](https://leetcode-py.wisl.dev/problems/maximum-absolute-sum-of-any-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_absolute_sum_of_any_subarray/solution.py) |
| 1752 | [Check if Array Is Sorted and Rotated](https://leetcode-py.wisl.dev/problems/check-if-array-is-sorted-and-rotated) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_array_is_sorted_and_rotated/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) |
| 1762 | [Buildings With an Ocean View](https://leetcode-py.wisl.dev/problems/buildings-with-an-ocean-view) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/buildings_with_an_ocean_view/solution.py) |
| 1769 | [Minimum Number of Operations to Move All Balls to Each Box](https://leetcode-py.wisl.dev/problems/minimum-number-of-operations-to-move-all-balls-to-each-box) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_operations_to_move_all_balls_to_each_box/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) |
| 1799 | [Maximize Score After N Operations](https://leetcode-py.wisl.dev/problems/maximize-score-after-n-operations) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximize_score_after_n_operations/solution.py) |
| 1800 | [Maximum Ascending Subarray Sum](https://leetcode-py.wisl.dev/problems/maximum-ascending-subarray-sum) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_ascending_subarray_sum/solution.py) |
| 1813 | [Sentence Similarity III](https://leetcode-py.wisl.dev/problems/sentence-similarity-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sentence_similarity_iii/solution.py) |
| 1822 | [Sign of the Product of an Array](https://leetcode-py.wisl.dev/problems/sign-of-the-product-of-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sign_of_the_product_of_an_array/solution.py) |
| 1823 | [Find the Winner of the Circular Game](https://leetcode-py.wisl.dev/problems/find-the-winner-of-the-circular-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_winner_of_the_circular_game/solution.py) |
| 1829 | [Maximum XOR for Each Query](https://leetcode-py.wisl.dev/problems/maximum-xor-for-each-query) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_xor_for_each_query/solution.py) |
| 1834 | [Single-Threaded CPU](https://leetcode-py.wisl.dev/problems/single-threaded-cpu) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_threaded_cpu/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) |
| 1846 | [Maximum Element After Decreasing and Rearranging](https://leetcode-py.wisl.dev/problems/maximum-element-after-decreasing-and-rearranging) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_element_after_decreasing_and_rearranging/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) |
| 1856 | [Maximum Subarray Min-Product](https://leetcode-py.wisl.dev/problems/maximum-subarray-min-product) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_subarray_min_product/solution.py) |
| 1861 | [Rotating the Box](https://leetcode-py.wisl.dev/problems/rotating-the-box) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotating_the_box/solution.py) |
| 1863 | [Sum of All Subset XOR Totals](https://leetcode-py.wisl.dev/problems/sum-of-all-subset-xor-totals) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_all_subset_xor_totals/solution.py) |
| 1868 | [Product of Two Run-Length Encoded Arrays](https://leetcode-py.wisl.dev/problems/product-of-two-run-length-encoded-arrays) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/product_of_two_run_length_encoded_arrays/solution.py) |
| 1882 | [Process Tasks Using Servers](https://leetcode-py.wisl.dev/problems/process-tasks-using-servers) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/process_tasks_using_servers/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) |
| 1899 | [Merge Triplets to Form Target Triplet](https://leetcode-py.wisl.dev/problems/merge-triplets-to-form-target-triplet) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_triplets_to_form_target_triplet/solution.py) |
| 1905 | [Count Sub Islands](https://leetcode-py.wisl.dev/problems/count-sub-islands) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_sub_islands/solution.py) |
| 1911 | [Maximum Alternating Subsequence Sum](https://leetcode-py.wisl.dev/problems/maximum-alternating-subsequence-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_alternating_subsequence_sum/solution.py) |
| 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode-py.wisl.dev/problems/maximum-product-difference-between-two-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_product_difference_between_two_pairs/solution.py) |
| 1921 | [Eliminate Maximum Number of Monsters](https://leetcode-py.wisl.dev/problems/eliminate-maximum-number-of-monsters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/eliminate_maximum_number_of_monsters/solution.py) |
| 1929 | [Concatenation of Array](https://leetcode-py.wisl.dev/problems/concatenation-of-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/concatenation_of_array/solution.py) |
| 1937 | [Maximum Number of Points with Cost](https://leetcode-py.wisl.dev/problems/maximum-number-of-points-with-cost) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_points_with_cost/solution.py) |
| 1942 | [The Number of the Smallest Unoccupied Chair](https://leetcode-py.wisl.dev/problems/smallest-unoccupied-chair) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_unoccupied_chair/solution.py) |
| 1944 | [Number of Visible People in a Queue](https://leetcode-py.wisl.dev/problems/number-of-visible-people-in-a-queue) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_visible_people_in_a_queue/solution.py) |
| 1958 | [Check if Move is Legal](https://leetcode-py.wisl.dev/problems/check-if-move-is-legal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_move_is_legal/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) |
| 1968 | [Array With Elements Not Equal to Average of Neighbors](https://leetcode-py.wisl.dev/problems/array-with-elements-not-equal-to-average-of-neighbors) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/array_with_elements_not_equal_to_average_of_neighbors/solution.py) |
| 1975 | [Maximum Matrix Sum](https://leetcode-py.wisl.dev/problems/maximum-matrix-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_matrix_sum/solution.py) |
| 1980 | [Find Unique Binary String](https://leetcode-py.wisl.dev/problems/find-unique-binary-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_unique_binary_string/solution.py) |
| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](https://leetcode-py.wisl.dev/problems/minimum-difference-between-highest-and-lowest-of-k-scores) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_difference_between_highest_and_lowest_of_k_scores/solution.py) |
| 1985 | [Find the Kth Largest Integer in the Array](https://leetcode-py.wisl.dev/problems/kth-largest-number-in-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_largest_number_in_array/solution.py) |
| 1993 | [Operations on Tree](https://leetcode-py.wisl.dev/problems/operations-on-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/operations_on_tree/solution.py) |
| 2001 | [Number of Pairs of Interchangeable Rectangles](https://leetcode-py.wisl.dev/problems/number-of-pairs-of-interchangeable-rectangles) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_pairs_of_interchangeable_rectangles/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) |
| 2013 | [Detect Squares](https://leetcode-py.wisl.dev/problems/detect-squares) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/detect_squares/solution.py) |
| 2017 | [Grid Game](https://leetcode-py.wisl.dev/problems/grid-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/grid_game/solution.py) |
| 2021 | [Brightest Position on Street](https://leetcode-py.wisl.dev/problems/brightest-position-on-street) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/brightest_position_on_street/solution.py) |
| 2022 | [Convert 1D Array Into 2D Array](https://leetcode-py.wisl.dev/problems/convert-1d-array-into-2d-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/convert_1d_array_into_2d_array/solution.py) |
| 2028 | [Find Missing Observations](https://leetcode-py.wisl.dev/problems/find-missing-observations) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_missing_observations/solution.py) |
| 2033 | [Minimum Operations to Make a Uni-Value Grid](https://leetcode-py.wisl.dev/problems/minimum-operations-to-make-a-uni-value-grid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_operations_to_make_a_uni_value_grid/solution.py) |
| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode-py.wisl.dev/problems/minimum-number-of-moves-to-seat-everyone) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_moves_to_seat_everyone/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) |
| 2044 | [Count Number of Maximum Bitwise-OR Subsets](https://leetcode-py.wisl.dev/problems/count-number-of-maximum-bitwise-or-subsets) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_number_of_maximum_bitwise_or_subsets/solution.py) |
| 2050 | [Parallel Courses III](https://leetcode-py.wisl.dev/problems/parallel-courses-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/parallel_courses_iii/solution.py) |
| 2053 | [Kth Distinct String in an Array](https://leetcode-py.wisl.dev/problems/kth-distinct-string-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_distinct_string_in_an_array/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) |
| 2073 | [Time Needed to Buy Tickets](https://leetcode-py.wisl.dev/problems/time-needed-to-buy-tickets) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/time_needed_to_buy_tickets/solution.py) |
| 2101 | [Detonate the Maximum Bombs](https://leetcode-py.wisl.dev/problems/detonate-the-maximum-bombs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/detonate_the_maximum_bombs/solution.py) |
| 2108 | [Find First Palindromic String in the Array](https://leetcode-py.wisl.dev/problems/find-first-palindromic-string-in-the-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_first_palindromic_string_in_the_array/solution.py) |
| 2109 | [Adding Spaces to a String](https://leetcode-py.wisl.dev/problems/adding-spaces-to-a-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/adding_spaces_to_a_string/solution.py) |
| 2115 | [Find All Possible Recipes from Given Supplies](https://leetcode-py.wisl.dev/problems/find-all-possible-recipes-from-given-supplies) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_all_possible_recipes_from_given_supplies/solution.py) |
| 2125 | [Number of Laser Beams in a Bank](https://leetcode-py.wisl.dev/problems/number-of-laser-beams-in-a-bank) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_laser_beams_in_a_bank/solution.py) |
| 2127 | [Maximum Employees to Be Invited to a Meeting](https://leetcode-py.wisl.dev/problems/maximum-employees-to-be-invited-to-a-meeting) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_employees_to_be_invited_to_a_meeting/solution.py) |
| 2134 | [Minimum Swaps to Group All 1's Together II](https://leetcode-py.wisl.dev/problems/minimum-swaps-to-group-all-1s-together-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_swaps_to_group_all_1s_together_ii/solution.py) |
| 2140 | [Solving Questions With Brainpower](https://leetcode-py.wisl.dev/problems/solving-questions-with-brainpower) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/solving_questions_with_brainpower/solution.py) |
| 2145 | [Count the Hidden Sequences](https://leetcode-py.wisl.dev/problems/count-the-hidden-sequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_the_hidden_sequences/solution.py) |
| 2149 | [Rearrange Array Elements by Sign](https://leetcode-py.wisl.dev/problems/rearrange-array-elements-by-sign) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rearrange_array_elements_by_sign/solution.py) |
| 2161 | [Partition Array According to Given Pivot](https://leetcode-py.wisl.dev/problems/partition-array-according-to-given-pivot) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/partition_array_according_to_given_pivot/solution.py) |
| 2185 | [Counting Words With a Given Prefix](https://leetcode-py.wisl.dev/problems/counting-words-with-a-given-prefix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_words_with_a_given_prefix/solution.py) |
| 2191 | [Sort the Jumbled Numbers](https://leetcode-py.wisl.dev/problems/sort-the-jumbled-numbers) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_the_jumbled_numbers/solution.py) |
| 2196 | [Create Binary Tree From Descriptions](https://leetcode-py.wisl.dev/problems/create-binary-tree-from-descriptions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/create_binary_tree_from_descriptions/solution.py) |
| 2206 | [Divide Array Into Equal Pairs](https://leetcode-py.wisl.dev/problems/divide-array-into-equal-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_array_into_equal_pairs/solution.py) |
| 2215 | [Find the Difference of Two Arrays](https://leetcode-py.wisl.dev/problems/find-the-difference-of-two-arrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_difference_of_two_arrays/solution.py) |
| 2218 | [Maximum Value of K Coins From Piles](https://leetcode-py.wisl.dev/problems/maximum-value-of-k-coins-from-piles) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_value_of_k_coins_from_piles/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) |
| 2257 | [Count Unguarded Cells in the Grid](https://leetcode-py.wisl.dev/problems/count-unguarded-cells-in-the-grid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_unguarded_cells_in_the_grid/solution.py) |
| 2270 | [Number of Ways to Split Array](https://leetcode-py.wisl.dev/problems/number-of-ways-to-split-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ways_to_split_array/solution.py) |
| 2275 | [Largest Combination With Bitwise AND Greater Than Zero](https://leetcode-py.wisl.dev/problems/largest-combination-with-bitwise-and-greater-than-zero) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_combination_with_bitwise_and_greater_than_zero/solution.py) |
| 2290 | [Minimum Obstacle Removal to Reach Corner](https://leetcode-py.wisl.dev/problems/minimum-obstacle-removal-to-reach-corner) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_obstacle_removal_to_reach_corner/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) |
| 2306 | [Naming a Company](https://leetcode-py.wisl.dev/problems/naming-a-company) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/naming_a_company/solution.py) |
| 2326 | [Spiral Matrix IV](https://leetcode-py.wisl.dev/problems/spiral-matrix-iv) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix_iv/solution.py) |
| 2348 | [Number of Zero-Filled Subarrays](https://leetcode-py.wisl.dev/problems/number-of-zero-filled-subarrays) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_zero_filled_subarrays/solution.py) |
| 2353 | [Design a Food Rating System](https://leetcode-py.wisl.dev/problems/design-a-food-rating-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_a_food_rating_system/solution.py) |
| 2364 | [Count Number of Bad Pairs](https://leetcode-py.wisl.dev/problems/count-number-of-bad-pairs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_number_of_bad_pairs/solution.py) |
| 2369 | [Check if There is a Valid Partition For The Array](https://leetcode-py.wisl.dev/problems/check-if-there-is-a-valid-partition-for-the-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_there_is_a_valid_partition_for_the_array/solution.py) |
| 2373 | [Largest Local Values in a Matrix](https://leetcode-py.wisl.dev/problems/largest-local-values-in-a-matrix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_local_values_in_a_matrix/solution.py) |
| 2381 | [Shifting Letters II](https://leetcode-py.wisl.dev/problems/shifting-letters-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shifting_letters_ii/solution.py) |
| 2392 | [Build a Matrix With Conditions](https://leetcode-py.wisl.dev/problems/build-a-matrix-with-conditions) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/build_a_matrix_with_conditions/solution.py) |
| 2393 | [Count Strictly Increasing Subarrays](https://leetcode-py.wisl.dev/problems/count-strictly-increasing-subarrays) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_strictly_increasing_subarrays/solution.py) |
| 2401 | [Longest Nice Subarray](https://leetcode-py.wisl.dev/problems/longest-nice-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_nice_subarray/solution.py) |
| 2402 | [Meeting Rooms III](https://leetcode-py.wisl.dev/problems/meeting-rooms-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms_iii/solution.py) |
| 2406 | [Divide Intervals Into Minimum Number of Groups](https://leetcode-py.wisl.dev/problems/divide-intervals-into-minimum-number-of-groups) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_intervals_into_minimum_number_of_groups/solution.py) |
| 2416 | [Sum of Prefix Scores of Strings](https://leetcode-py.wisl.dev/problems/sum-of-prefix-scores-of-strings) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_prefix_scores_of_strings/solution.py) |
| 2418 | [Sort the People](https://leetcode-py.wisl.dev/problems/sort-the-people) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_the_people/solution.py) |
| 2419 | [Longest Subarray With Maximum Bitwise AND](https://leetcode-py.wisl.dev/problems/longest-subarray-with-maximum-bitwise-and) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_subarray_with_maximum_bitwise_and/solution.py) |
| 2421 | [Number of Good Paths](https://leetcode-py.wisl.dev/problems/number-of-good-paths) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_good_paths/solution.py) |
| 2425 | [Bitwise XOR of All Pairings](https://leetcode-py.wisl.dev/problems/bitwise-xor-of-all-pairings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bitwise_xor_of_all_pairings/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) |
| 2460 | [Apply Operations to an Array](https://leetcode-py.wisl.dev/problems/apply-operations-to-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_operations_to_an_array/solution.py) |
| 2461 | [Maximum Sum of Distinct Subarrays With Length K](https://leetcode-py.wisl.dev/problems/maximum-sum-of-distinct-subarrays-with-length-k) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_sum_of_distinct_subarrays_with_length_k/solution.py) |
| 2467 | [Most Profitable Path in a Tree](https://leetcode-py.wisl.dev/problems/most-profitable-path-in-a-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_profitable_path_in_a_tree/solution.py) |
| 2491 | [Divide Players Into Teams of Equal Skill](https://leetcode-py.wisl.dev/problems/divide-players-into-teams-of-equal-skill) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_players_into_teams_of_equal_skill/solution.py) |
| 2503 | [Maximum Number of Points From Grid Queries](https://leetcode-py.wisl.dev/problems/maximum-number-of-points-from-grid-queries) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_points_from_grid_queries/solution.py) |
| 2530 | [Maximal Score After Applying K Operations](https://leetcode-py.wisl.dev/problems/maximal-score-after-applying-k-operations) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximal_score_after_applying_k_operations/solution.py) |
| 2534 | [Time Taken to Cross the Door](https://leetcode-py.wisl.dev/problems/time-taken-to-cross-the-door) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/time_taken_to_cross_the_door/solution.py) |
| 2542 | [Maximum Subsequence Score](https://leetcode-py.wisl.dev/problems/maximum-subsequence-score) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_subsequence_score/solution.py) |
| 2551 | [Put Marbles in Bags](https://leetcode-py.wisl.dev/problems/put-marbles-in-bags) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/put_marbles_in_bags/solution.py) |
| 2558 | [Take Gifts From the Richest Pile](https://leetcode-py.wisl.dev/problems/take-gifts-from-the-richest-pile) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/take_gifts_from_the_richest_pile/solution.py) |
| 2559 | [Count Vowel Strings in Ranges](https://leetcode-py.wisl.dev/problems/count-vowel-strings-in-ranges) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_vowel_strings_in_ranges/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) |
| 2570 | [Merge Two 2D Arrays by Summing Values](https://leetcode-py.wisl.dev/problems/merge-two-2d-arrays-by-summing-values) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_two_2d_arrays_by_summing_values/solution.py) |
| 2577 | [Minimum Time to Visit a Cell In a Grid](https://leetcode-py.wisl.dev/problems/minimum-time-to-visit-a-cell-in-a-grid) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_time_to_visit_a_cell_in_a_grid/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) |
| 2597 | [The Number of Beautiful Subsets](https://leetcode-py.wisl.dev/problems/the-number-of-beautiful-subsets) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/the_number_of_beautiful_subsets/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) |
| 2610 | [Convert an Array Into a 2D Array With Conditions](https://leetcode-py.wisl.dev/problems/convert-an-array-into-a-2d-array-with-conditions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/convert_an_array_into_a_2d_array_with_conditions/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) |
| 2658 | [Maximum Number of Fish in a Grid](https://leetcode-py.wisl.dev/problems/maximum-number-of-fish-in-a-grid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_fish_in_a_grid/solution.py) |
| 2678 | [Number of Senior Citizens](https://leetcode-py.wisl.dev/problems/number-of-senior-citizens) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_senior_citizens/solution.py) |
| 2683 | [Neighboring Bitwise XOR](https://leetcode-py.wisl.dev/problems/neighboring-bitwise-xor) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/neighboring_bitwise_xor/solution.py) |
| 2706 | [Buy Two Chocolates](https://leetcode-py.wisl.dev/problems/buy-two-chocolates) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/buy_two_chocolates/solution.py) |
| 2707 | [Extra Characters in a String](https://leetcode-py.wisl.dev/problems/extra-characters-in-a-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/extra_characters_in_a_string/solution.py) |
| 2709 | [Greatest Common Divisor Traversal](https://leetcode-py.wisl.dev/problems/greatest-common-divisor-traversal) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/greatest_common_divisor_traversal/solution.py) |
| 2742 | [Painting the Walls](https://leetcode-py.wisl.dev/problems/painting-the-walls) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/painting_the_walls/solution.py) |
| 2751 | [Robot Collisions](https://leetcode-py.wisl.dev/problems/robot-collisions) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/robot_collisions/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) |
| 2780 | [Minimum Index of a Valid Split](https://leetcode-py.wisl.dev/problems/minimum-index-of-a-valid-split) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_index_of_a_valid_split/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) |
| 2818 | [Apply Operations to Maximize Score](https://leetcode-py.wisl.dev/problems/apply-operations-to-maximize-score) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_operations_to_maximize_score/solution.py) |
| 2870 | [Minimum Number of Operations to Make Array Empty](https://leetcode-py.wisl.dev/problems/minimum-number-of-operations-to-make-array-empty) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_operations_to_make_array_empty/solution.py) |
| 2924 | [Find Champion II](https://leetcode-py.wisl.dev/problems/find-champion-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_champion_ii/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) |
| 2948 | [Make Lexicographically Smallest Array by Swapping Elements](https://leetcode-py.wisl.dev/problems/make-lexicographically-smallest-array-by-swapping-elements) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/make_lexicographically_smallest_array_by_swapping_elements/solution.py) |
| 2958 | [Length of Longest Subarray With at Most K Frequency](https://leetcode-py.wisl.dev/problems/length-of-longest-subarray-with-at-most-k-frequency) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/length_of_longest_subarray_with_at_most_k_frequency/solution.py) |
| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](https://leetcode-py.wisl.dev/problems/count-subarrays-where-max-element-appears-at-least-k-times) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_subarrays_where_max_element_appears_at_least_k_times/solution.py) |
| 2965 | [Find Missing and Repeated Values](https://leetcode-py.wisl.dev/problems/find-missing-and-repeated-values) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_missing_and_repeated_values/solution.py) |
| 2966 | [Divide Array Into Arrays With Max Difference](https://leetcode-py.wisl.dev/problems/divide-array-into-arrays-with-max-difference) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_array_into_arrays_with_max_difference/solution.py) |
| 2971 | [Find Polygon With the Largest Perimeter](https://leetcode-py.wisl.dev/problems/find-polygon-with-the-largest-perimeter) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_polygon_with_the_largest_perimeter/solution.py) |
| 2976 | [Minimum Cost to Convert String I](https://leetcode-py.wisl.dev/problems/minimum-cost-to-convert-string-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_convert_string_i/solution.py) |
| 3011 | [Find if Array Can Be Sorted](https://leetcode-py.wisl.dev/problems/find-if-array-can-be-sorted) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_if_array_can_be_sorted/solution.py) |
| 3042 | [Count Prefix and Suffix Pairs I](https://leetcode-py.wisl.dev/problems/count-prefix-and-suffix-pairs-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_prefix_and_suffix_pairs_i/solution.py) |
| 3043 | [Find the Length of the Longest Common Prefix](https://leetcode-py.wisl.dev/problems/find-the-length-of-the-longest-common-prefix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_length_of_the_longest_common_prefix/solution.py) |
| 3045 | [Count Prefix and Suffix Pairs II](https://leetcode-py.wisl.dev/problems/count-prefix-and-suffix-pairs-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_prefix_and_suffix_pairs_ii/solution.py) |
| 3068 | [Find the Maximum Sum of Node Values](https://leetcode-py.wisl.dev/problems/find-the-maximum-sum-of-node-values) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_maximum_sum_of_node_values/solution.py) |
| 3097 | [Shortest Subarray With OR at Least K II](https://leetcode-py.wisl.dev/problems/shortest-subarray-with-or-at-least-k-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_subarray_with_or_at_least_k_ii/solution.py) |
| 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode-py.wisl.dev/problems/longest-monotonic-subarray) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_monotonic_subarray/solution.py) |
| 3108 | [Minimum Cost Walk in Weighted Graph](https://leetcode-py.wisl.dev/problems/minimum-cost-walk-in-weighted-graph) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_walk_in_weighted_graph/solution.py) |
| 3151 | [Special Array I](https://leetcode-py.wisl.dev/problems/special-array-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/special_array_i/solution.py) |
| 3169 | [Count Days Without Meetings](https://leetcode-py.wisl.dev/problems/count-days-without-meetings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_days_without_meetings/solution.py) |
| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode-py.wisl.dev/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_operations_to_make_binary_array_elements_equal_to_one_i/solution.py) |
| 3199 | [Count Triplets with Even XOR Set Bits I](https://leetcode-py.wisl.dev/problems/count-triplets-with-even-xor-set-bits-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_triplets_with_even_xor_set_bits_i/solution.py) |
| 3208 | [Alternating Groups II](https://leetcode-py.wisl.dev/problems/alternating-groups-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/alternating_groups_ii/solution.py) |
| 3217 | [Delete Nodes From Linked List Present in Array](https://leetcode-py.wisl.dev/problems/delete-nodes-from-linked-list-present-in-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_nodes_from_linked_list_present_in_array/solution.py) |
| 3243 | [Shortest Distance After Road Addition Queries I](https://leetcode-py.wisl.dev/problems/shortest-distance-after-queries-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_distance_after_queries_i/solution.py) |
| 3254 | [Find the Power of K-Size Subarrays I](https://leetcode-py.wisl.dev/problems/find-the-power-of-k-size-subarrays-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_power_of_k_size_subarrays_i/solution.py) |
| 3264 | [Final Array State After K Multiplication Operations I](https://leetcode-py.wisl.dev/problems/final-array-state-after-k-multiplication-operations-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/final_array_state_after_k_multiplication_operations_i/solution.py) |
| 3394 | [Check if Grid can be Cut into Sections](https://leetcode-py.wisl.dev/problems/check-if-grid-can-be-cut-into-sections) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_grid_can_be_cut_into_sections/solution.py) |
| 3434 | [Maximum Frequency After Subarray Operation](https://leetcode-py.wisl.dev/problems/maximum-frequency-after-subarray-operation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_frequency_after_subarray_operation/solution.py) |
| 3481 | [Apply Substitutions](https://leetcode-py.wisl.dev/problems/apply-substitutions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_substitutions/solution.py) |
| 3572 | [Maximize Y-Sum by Picking a Triplet of Distinct X-Values](https://leetcode-py.wisl.dev/problems/maximize-ysum-by-picking-a-triplet-of-distinct-xvalues) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximize_ysum_by_picking_a_triplet_of_distinct_xvalues/solution.py) |
| 3711 | [Maximum Transactions Without Negative Balance](https://leetcode-py.wisl.dev/problems/maximum-transactions-without-negative-balance) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_transactions_without_negative_balance/solution.py) |

Pages: [1](https://leetcode-py.wisl.dev/catalog/topics/array), [2](https://leetcode-py.wisl.dev/catalog/topics/array-2), [3](https://leetcode-py.wisl.dev/catalog/topics/array-3), 4


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