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

# All LeetCode Problems in Python, Part 5

> Every LeetCode problem in the catalog with difficulty, collections, and tested Python solutions. Part 5 of 8: problems 801-1000.

Every problem shipped in this repository: 1405 problems (309 Easy, 820 Medium, 276 Hard).

| # | Problem | Difficulty | Solution |
| - | - | - | - |
| 851 | [Loud and Rich](https://leetcode-py.wisl.dev/problems/loud-and-rich) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/loud_and_rich/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) |
| 853 | [Car Fleet](https://leetcode-py.wisl.dev/problems/car-fleet) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/car_fleet/solution.py) |
| 854 | [K-Similar Strings](https://leetcode-py.wisl.dev/problems/k-similarity) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/k_similarity/solution.py) |
| 855 | [Exam Room](https://leetcode-py.wisl.dev/problems/exam-room) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/exam_room/solution.py) |
| 856 | [Score of Parentheses](https://leetcode-py.wisl.dev/problems/score-of-parentheses) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/score_of_parentheses/solution.py) |
| 857 | [Minimum Cost to Hire K Workers](https://leetcode-py.wisl.dev/problems/minimum-cost-to-hire-k-workers) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_hire_k_workers/solution.py) |
| 858 | [Mirror Reflection](https://leetcode-py.wisl.dev/problems/mirror-reflection) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/mirror_reflection/solution.py) |
| 859 | [Buddy Strings](https://leetcode-py.wisl.dev/problems/buddy-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/buddy_strings/solution.py) |
| 860 | [Lemonade Change](https://leetcode-py.wisl.dev/problems/lemonade-change) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lemonade_change/solution.py) |
| 861 | [Score After Flipping Matrix](https://leetcode-py.wisl.dev/problems/score-after-flipping-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/score_after_flipping_matrix/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) |
| 863 | [All Nodes Distance K in Binary Tree](https://leetcode-py.wisl.dev/problems/all-nodes-distance-k-in-binary-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/all_nodes_distance_k_in_binary_tree/solution.py) |
| 864 | [Shortest Path to Get All Keys](https://leetcode-py.wisl.dev/problems/shortest-path-to-get-all-keys) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_path_to_get_all_keys/solution.py) |
| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode-py.wisl.dev/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_subtree_with_all_the_deepest_nodes/solution.py) |
| 866 | [Prime Palindrome](https://leetcode-py.wisl.dev/problems/prime-palindrome) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/prime_palindrome/solution.py) |
| 867 | [Transpose Matrix](https://leetcode-py.wisl.dev/problems/transpose-matrix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/transpose_matrix/solution.py) |
| 868 | [Binary Gap](https://leetcode-py.wisl.dev/problems/binary-gap) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_gap/solution.py) |
| 869 | [Reordered Power of 2](https://leetcode-py.wisl.dev/problems/reordered-power-of-2) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reordered_power_of_2/solution.py) |
| 870 | [Advantage Shuffle](https://leetcode-py.wisl.dev/problems/advantage-shuffle) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/advantage_shuffle/solution.py) |
| 871 | [Minimum Number of Refueling Stops](https://leetcode-py.wisl.dev/problems/minimum-number-of-refueling-stops) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_refueling_stops/solution.py) |
| 872 | [Leaf-Similar Trees](https://leetcode-py.wisl.dev/problems/leaf-similar-trees) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/leaf_similar_trees/solution.py) |
| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode-py.wisl.dev/problems/length-of-longest-fibonacci-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/length_of_longest_fibonacci_subsequence/solution.py) |
| 874 | [Walking Robot Simulation](https://leetcode-py.wisl.dev/problems/walking-robot-simulation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/walking_robot_simulation/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) |
| 876 | [Middle of the Linked List](https://leetcode-py.wisl.dev/problems/middle-of-the-linked-list) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/middle_of_the_linked_list/solution.py) |
| 877 | [Stone Game](https://leetcode-py.wisl.dev/problems/stone-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/stone_game/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) |
| 879 | [Profitable Schemes](https://leetcode-py.wisl.dev/problems/profitable-schemes) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/profitable_schemes/solution.py) |
| 880 | [Decoded String at Index](https://leetcode-py.wisl.dev/problems/decoded-string-at-index) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/decoded_string_at_index/solution.py) |
| 881 | [Boats to Save People](https://leetcode-py.wisl.dev/problems/boats-to-save-people) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/boats_to_save_people/solution.py) |
| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode-py.wisl.dev/problems/reachable-nodes-in-subdivided-graph) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reachable_nodes_in_subdivided_graph/solution.py) |
| 883 | [Projection Area of 3D Shapes](https://leetcode-py.wisl.dev/problems/projection-area-of-3d-shapes) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/projection_area_of_3d_shapes/solution.py) |
| 884 | [Uncommon Words from Two Sentences](https://leetcode-py.wisl.dev/problems/uncommon-words-from-two-sentences) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/uncommon_words_from_two_sentences/solution.py) |
| 885 | [Spiral Matrix III](https://leetcode-py.wisl.dev/problems/spiral-matrix-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix_iii/solution.py) |
| 886 | [Possible Bipartition](https://leetcode-py.wisl.dev/problems/possible-bipartition) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/possible_bipartition/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) |
| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode-py.wisl.dev/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_binary_tree_from_preorder_and_postorder_traversal/solution.py) |
| 890 | [Find and Replace Pattern](https://leetcode-py.wisl.dev/problems/find-and-replace-pattern) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_and_replace_pattern/solution.py) |
| 891 | [Sum of Subsequence Widths](https://leetcode-py.wisl.dev/problems/sum-of-subseq-widths) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_subseq_widths/solution.py) |
| 892 | [Surface Area of 3D Shapes](https://leetcode-py.wisl.dev/problems/surface-area-of-3d-shapes) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/surface_area_of_3d_shapes/solution.py) |
| 893 | [Groups of Special-Equivalent Strings](https://leetcode-py.wisl.dev/problems/groups-of-special-equivalent-strings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/groups_of_special_equivalent_strings/solution.py) |
| 894 | [All Possible Full Binary Trees](https://leetcode-py.wisl.dev/problems/all-possible-full-binary-trees) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/all_possible_full_binary_trees/solution.py) |
| 895 | [Maximum Frequency Stack](https://leetcode-py.wisl.dev/problems/maximum-frequency-stack) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_frequency_stack/solution.py) |
| 896 | [Monotonic Array](https://leetcode-py.wisl.dev/problems/monotonic-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/monotonic_array/solution.py) |
| 897 | [Increasing Order Search Tree](https://leetcode-py.wisl.dev/problems/increasing-order-search-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/increasing_order_search_tree/solution.py) |
| 898 | [Bitwise ORs of Subarrays](https://leetcode-py.wisl.dev/problems/bitwise-ors-of-subarrays) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bitwise_ors_of_subarrays/solution.py) |
| 899 | [Orderly Queue](https://leetcode-py.wisl.dev/problems/orderly-queue) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/orderly_queue/solution.py) |
| 900 | [RLE Iterator](https://leetcode-py.wisl.dev/problems/rle-iterator) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rle_iterator/solution.py) |
| 901 | [Online Stock Span](https://leetcode-py.wisl.dev/problems/online-stock-span) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/online_stock_span/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) |
| 903 | [Valid Permutations for DI Sequence](https://leetcode-py.wisl.dev/problems/valid-permutations-for-di-sequence) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_permutations_for_di_sequence/solution.py) |
| 904 | [Fruit Into Baskets](https://leetcode-py.wisl.dev/problems/fruit-into-basket) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/fruit_into_basket/solution.py) |
| 905 | [Sort Array By Parity](https://leetcode-py.wisl.dev/problems/sort-array-by-parity) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_array_by_parity/solution.py) |
| 906 | [Super Palindromes](https://leetcode-py.wisl.dev/problems/super-palindromes) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/super_palindromes/solution.py) |
| 907 | [Sum of Subarray Minimums](https://leetcode-py.wisl.dev/problems/sum-of-subarray-minimums) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_subarray_minimums/solution.py) |
| 908 | [Smallest Range I](https://leetcode-py.wisl.dev/problems/smallest-range-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_range_i/solution.py) |
| 909 | [Snakes and Ladders](https://leetcode-py.wisl.dev/problems/snakes-and-ladders) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/snakes_and_ladders/solution.py) |
| 910 | [Smallest Range II](https://leetcode-py.wisl.dev/problems/smallest-range-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_range_ii/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) |
| 912 | [Sort an Array](https://leetcode-py.wisl.dev/problems/sort-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_an_array/solution.py) |
| 913 | [Cat and Mouse](https://leetcode-py.wisl.dev/problems/cat-and-mouse) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/cat_and_mouse/solution.py) |
| 914 | [X of a Kind in a Deck of Cards](https://leetcode-py.wisl.dev/problems/x-of-a-kind-in-a-deck-of-cards) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/x_of_a_kind_in_a_deck_of_cards/solution.py) |
| 915 | [Partition Array into Disjoint Intervals](https://leetcode-py.wisl.dev/problems/partition-array-into-disjoint-intervals) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/partition_array_into_disjoint_intervals/solution.py) |
| 916 | [Word Subsets](https://leetcode-py.wisl.dev/problems/word-subsets) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_subsets/solution.py) |
| 917 | [Reverse Only Letters](https://leetcode-py.wisl.dev/problems/reverse-only-letters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_only_letters/solution.py) |
| 918 | [Maximum Sum Circular Subarray](https://leetcode-py.wisl.dev/problems/maximum-sum-circular-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_sum_circular_subarray/solution.py) |
| 919 | [Complete Binary Tree Inserter](https://leetcode-py.wisl.dev/problems/complete-binary-tree-inserter) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/complete_binary_tree_inserter/solution.py) |
| 920 | [Number of Music Playlists](https://leetcode-py.wisl.dev/problems/number-of-music-playlists) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_music_playlists/solution.py) |
| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode-py.wisl.dev/problems/minimum-add-to-make-parentheses-valid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_add_to_make_parentheses_valid/solution.py) |
| 922 | [Sort Array By Parity II](https://leetcode-py.wisl.dev/problems/sort-array-by-parity-ii) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_array_by_parity_ii/solution.py) |
| 923 | [3Sum With Multiplicity](https://leetcode-py.wisl.dev/problems/three-sum-multiplicity) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum_multiplicity/solution.py) |
| 924 | [Minimize Malware Spread](https://leetcode-py.wisl.dev/problems/minimize-malware-spread) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_malware_spread/solution.py) |
| 925 | [Long Pressed Name](https://leetcode-py.wisl.dev/problems/long-pressed-name) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/long_pressed_name/solution.py) |
| 926 | [Flip String to Monotone Increasing](https://leetcode-py.wisl.dev/problems/flip-string-to-monotone-increasing) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/flip_string_to_monotone_increasing/solution.py) |
| 927 | [Three Equal Parts](https://leetcode-py.wisl.dev/problems/three-equal-parts) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_equal_parts/solution.py) |
| 928 | [Minimize Malware Spread II](https://leetcode-py.wisl.dev/problems/minimize-malware-spread-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_malware_spread_ii/solution.py) |
| 929 | [Unique Email Addresses](https://leetcode-py.wisl.dev/problems/unique-email-addresses) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_email_addresses/solution.py) |
| 930 | [Binary Subarrays With Sum](https://leetcode-py.wisl.dev/problems/binary-subarrays-with-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_subarrays_with_sum/solution.py) |
| 931 | [Minimum Falling Path Sum](https://leetcode-py.wisl.dev/problems/minimum-falling-path-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_falling_path_sum/solution.py) |
| 932 | [Beautiful Array](https://leetcode-py.wisl.dev/problems/beautiful-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/beautiful_array/solution.py) |
| 933 | [Number of Recent Calls](https://leetcode-py.wisl.dev/problems/number-of-recent-calls) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_recent_calls/solution.py) |
| 934 | [Shortest Bridge](https://leetcode-py.wisl.dev/problems/shortest-bridge) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_bridge/solution.py) |
| 935 | [Knight Dialer](https://leetcode-py.wisl.dev/problems/knight-dialer) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/knight_dialer/solution.py) |
| 936 | [Stamping The Sequence](https://leetcode-py.wisl.dev/problems/stamping-the-sequence) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/stamping_the_sequence/solution.py) |
| 937 | [Reorder Data in Log Files](https://leetcode-py.wisl.dev/problems/reorder-log-files) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reorder_log_files/solution.py) |
| 938 | [Range Sum of BST](https://leetcode-py.wisl.dev/problems/range-sum-of-bst) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_of_bst/solution.py) |
| 939 | [Minimum Area Rectangle](https://leetcode-py.wisl.dev/problems/minimum-area-rectangle) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_area_rectangle/solution.py) |
| 940 | [Distinct Subsequences II](https://leetcode-py.wisl.dev/problems/distinct-subsequences-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/distinct_subsequences_ii/solution.py) |
| 941 | [Valid Mountain Array](https://leetcode-py.wisl.dev/problems/valid-mountain-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_mountain_array/solution.py) |
| 942 | [DI String Match](https://leetcode-py.wisl.dev/problems/di-string-match) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/di_string_match/solution.py) |
| 943 | [Find the Shortest Superstring](https://leetcode-py.wisl.dev/problems/find-the-shortest-superstring) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_shortest_superstring/solution.py) |
| 944 | [Delete Columns to Make Sorted](https://leetcode-py.wisl.dev/problems/delete-columns-to-make-sorted) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_columns_to_make_sorted/solution.py) |
| 945 | [Minimum Increment to Make Array Unique](https://leetcode-py.wisl.dev/problems/minimum-increment-to-make-array-unique) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_increment_to_make_array_unique/solution.py) |
| 946 | [Validate Stack Sequences](https://leetcode-py.wisl.dev/problems/validate-stack-sequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/validate_stack_sequences/solution.py) |
| 947 | [Most Stones Removed with Same Row or Column](https://leetcode-py.wisl.dev/problems/most-stones-removed-with-same-row-or-column) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_stones_removed_with_same_row_or_column/solution.py) |
| 948 | [Bag of Tokens](https://leetcode-py.wisl.dev/problems/bag-of-tokens) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bag_of_tokens/solution.py) |
| 949 | [Largest Time for Given Digits](https://leetcode-py.wisl.dev/problems/largest-time-for-given-digits) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_time_for_given_digits/solution.py) |
| 950 | [Reveal Cards In Increasing Order](https://leetcode-py.wisl.dev/problems/reveal-cards-in-increasing-order) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reveal_cards_in_increasing_order/solution.py) |
| 951 | [Flip Equivalent Binary Trees](https://leetcode-py.wisl.dev/problems/flip-equivalent-binary-trees) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/flip_equivalent_binary_trees/solution.py) |
| 952 | [Largest Component Size by Common Factor](https://leetcode-py.wisl.dev/problems/largest-component-size-by-common-factor) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_component_size_by_common_factor/solution.py) |
| 953 | [Verifying an Alien Dictionary](https://leetcode-py.wisl.dev/problems/verifying-an-alien-dictionary) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/verifying_an_alien_dictionary/solution.py) |
| 954 | [Array of Doubled Pairs](https://leetcode-py.wisl.dev/problems/array-of-doubled-pairs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/array_of_doubled_pairs/solution.py) |
| 955 | [Delete Columns to Make Sorted II](https://leetcode-py.wisl.dev/problems/delete-columns-to-make-sorted-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_columns_to_make_sorted_ii/solution.py) |
| 956 | [Tallest Billboard](https://leetcode-py.wisl.dev/problems/tallest-billboard) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/tallest_billboard/solution.py) |
| 957 | [Prison Cells After N Days](https://leetcode-py.wisl.dev/problems/prison-cells-after-n-days) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/prison_cells_after_n_days/solution.py) |
| 958 | [Check Completeness of a Binary Tree](https://leetcode-py.wisl.dev/problems/check-completeness-of-a-binary-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_completeness_of_a_binary_tree/solution.py) |
| 959 | [Regions Cut By Slashes](https://leetcode-py.wisl.dev/problems/regions-cut-by-slashes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/regions_cut_by_slashes/solution.py) |
| 960 | [Delete Columns to Make Sorted III](https://leetcode-py.wisl.dev/problems/delete-columns-to-make-sorted-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_columns_to_make_sorted_iii/solution.py) |
| 961 | [N-Repeated Element in Size 2N Array](https://leetcode-py.wisl.dev/problems/n-repeated-element-in-size-2n-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/n_repeated_element_in_size_2n_array/solution.py) |
| 962 | [Maximum Width Ramp](https://leetcode-py.wisl.dev/problems/maximum-width-ramp) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_width_ramp/solution.py) |
| 963 | [Minimum Area Rectangle II](https://leetcode-py.wisl.dev/problems/minimum-area-rectangle-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_area_rectangle_ii/solution.py) |
| 964 | [Least Operators to Express Number](https://leetcode-py.wisl.dev/problems/least-operators-to-express-number) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/least_operators_to_express_number/solution.py) |
| 965 | [Univalued Binary Tree](https://leetcode-py.wisl.dev/problems/univalued-binary-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/univalued_binary_tree/solution.py) |
| 966 | [Vowel Spellchecker](https://leetcode-py.wisl.dev/problems/vowel-spellchecker) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/vowel_spellchecker/solution.py) |
| 967 | [Numbers With Same Consecutive Differences](https://leetcode-py.wisl.dev/problems/numbers-with-same-consecutive-differences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/numbers_with_same_consecutive_differences/solution.py) |
| 968 | [Binary Tree Cameras](https://leetcode-py.wisl.dev/problems/binary-tree-cameras) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_cameras/solution.py) |
| 969 | [Pancake Sorting](https://leetcode-py.wisl.dev/problems/pancake-sorting) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pancake_sorting/solution.py) |
| 970 | [Powerful Integers](https://leetcode-py.wisl.dev/problems/powerful-integers) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/powerful_integers/solution.py) |
| 971 | [Flip Binary Tree To Match Preorder Traversal](https://leetcode-py.wisl.dev/problems/flip-binary-tree-to-match-preorder-traversal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/flip_binary_tree_to_match_preorder_traversal/solution.py) |
| 972 | [Equal Rational Numbers](https://leetcode-py.wisl.dev/problems/equal-rational-numbers) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/equal_rational_numbers/solution.py) |
| 973 | [K Closest Points to Origin](https://leetcode-py.wisl.dev/problems/k-closest-points-to-origin) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/k_closest_points_to_origin/solution.py) |
| 974 | [Subarray Sums Divisible by K](https://leetcode-py.wisl.dev/problems/subarray-sums-divisible-by-k) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subarray_sums_divisible_by_k/solution.py) |
| 975 | [Odd Even Jump](https://leetcode-py.wisl.dev/problems/odd-even-jumps) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/odd_even_jumps/solution.py) |
| 976 | [Largest Perimeter Triangle](https://leetcode-py.wisl.dev/problems/largest-perimeter-triangle) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_perimeter_triangle/solution.py) |
| 977 | [Squares of a Sorted Array](https://leetcode-py.wisl.dev/problems/squares-of-a-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/squares_of_a_sorted_array/solution.py) |
| 978 | [Longest Turbulent Subarray](https://leetcode-py.wisl.dev/problems/longest-turbulent-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_turbulent_subarray/solution.py) |
| 979 | [Distribute Coins in Binary Tree](https://leetcode-py.wisl.dev/problems/distribute-coins-in-binary-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/distribute_coins_in_binary_tree/solution.py) |
| 980 | [Unique Paths III](https://leetcode-py.wisl.dev/problems/unique-paths-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_paths_iii/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) |
| 982 | [Triples with Bitwise AND Equal To Zero](https://leetcode-py.wisl.dev/problems/triples-with-bitwise-and-equal-to-zero) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/triples_with_bitwise_and_equal_to_zero/solution.py) |
| 983 | [Minimum Cost For Tickets](https://leetcode-py.wisl.dev/problems/minimum-cost-for-tickets) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_for_tickets/solution.py) |
| 984 | [String Without AAA or BBB](https://leetcode-py.wisl.dev/problems/string-without-aaa-or-bbb) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/string_without_aaa_or_bbb/solution.py) |
| 985 | [Sum of Even Numbers After Queries](https://leetcode-py.wisl.dev/problems/sum-even-after-queries) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_even_after_queries/solution.py) |
| 986 | [Interval List Intersections](https://leetcode-py.wisl.dev/problems/interval-list-intersections) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/interval_list_intersections/solution.py) |
| 987 | [Vertical Order Traversal of a Binary Tree](https://leetcode-py.wisl.dev/problems/vertical-order-traversal-of-a-binary-tree) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/vertical_order_traversal_of_a_binary_tree/solution.py) |
| 988 | [Smallest String Starting From Leaf](https://leetcode-py.wisl.dev/problems/smallest-string-starting-from-leaf) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_string_starting_from_leaf/solution.py) |
| 989 | [Add to Array-Form of Integer](https://leetcode-py.wisl.dev/problems/add-to-array-form-of-integer) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/add_to_array_form_of_integer/solution.py) |
| 990 | [Satisfiability of Equality Equations](https://leetcode-py.wisl.dev/problems/satisfiability-of-equality-equations) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/satisfiability_of_equality_equations/solution.py) |
| 991 | [Broken Calculator](https://leetcode-py.wisl.dev/problems/broken-calculator) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/broken_calculator/solution.py) |
| 992 | [Subarrays with K Different Integers](https://leetcode-py.wisl.dev/problems/subarrays-with-k-different-integers) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subarrays_with_k_different_integers/solution.py) |
| 993 | [Cousins in Binary Tree](https://leetcode-py.wisl.dev/problems/cousins-in-binary-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/cousins_in_binary_tree/solution.py) |
| 994 | [Rotting Oranges](https://leetcode-py.wisl.dev/problems/rotting-oranges) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotting_oranges/solution.py) |
| 995 | [Minimum Number of K Consecutive Bit Flips](https://leetcode-py.wisl.dev/problems/minimum-number-of-k-consecutive-bit-flips) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_k_consecutive_bit_flips/solution.py) |
| 996 | [Number of Squareful Arrays](https://leetcode-py.wisl.dev/problems/number-of-squareful-arrays) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_squareful_arrays/solution.py) |
| 997 | [Find the Town Judge](https://leetcode-py.wisl.dev/problems/find-the-town-judge) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_town_judge/solution.py) |
| 998 | [Maximum Binary Tree II](https://leetcode-py.wisl.dev/problems/maximum-binary-tree-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_binary_tree_ii/solution.py) |
| 999 | [Available Captures for Rook](https://leetcode-py.wisl.dev/problems/available-captures-for-rook) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/available_captures_for_rook/solution.py) |
| 1000 | [Minimum Cost to Merge Stones](https://leetcode-py.wisl.dev/problems/minimum-cost-to-merge-stones) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_merge_stones/solution.py) |
| 1001 | [Grid Illumination](https://leetcode-py.wisl.dev/problems/grid-illumination) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/grid_illumination/solution.py) |
| 1002 | [Find Common Characters](https://leetcode-py.wisl.dev/problems/find-common-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_common_characters/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) |
| 1014 | [Best Sightseeing Pair](https://leetcode-py.wisl.dev/problems/best-sightseeing-pair) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_sightseeing_pair/solution.py) |
| 1020 | [Number of Enclaves](https://leetcode-py.wisl.dev/problems/number-of-enclaves) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_enclaves/solution.py) |
| 1028 | [Recover a Tree From Preorder Traversal](https://leetcode-py.wisl.dev/problems/recover-a-tree-from-preorder-traversal) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/recover_a_tree_from_preorder_traversal/solution.py) |
| 1029 | [Two City Scheduling](https://leetcode-py.wisl.dev/problems/two-city-scheduling) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_city_scheduling/solution.py) |
| 1035 | [Uncrossed Lines](https://leetcode-py.wisl.dev/problems/uncrossed-lines) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/uncrossed_lines/solution.py) |
| 1041 | [Robot Bounded In Circle](https://leetcode-py.wisl.dev/problems/robot-bounded-in-circle) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/robot_bounded_in_circle/solution.py) |
| 1043 | [Partition Array for Maximum Sum](https://leetcode-py.wisl.dev/problems/partition-array-for-maximum-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/partition_array_for_maximum_sum/solution.py) |
| 1046 | [Last Stone Weight](https://leetcode-py.wisl.dev/problems/last-stone-weight) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/last_stone_weight/solution.py) |
| 1048 | [Longest String Chain](https://leetcode-py.wisl.dev/problems/longest-string-chain) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_string_chain/solution.py) |
| 1049 | [Last Stone Weight II](https://leetcode-py.wisl.dev/problems/last-stone-weight-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/last_stone_weight_ii/solution.py) |
| 1051 | [Height Checker](https://leetcode-py.wisl.dev/problems/height-checker) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/height_checker/solution.py) |
| 1052 | [Grumpy Bookstore Owner](https://leetcode-py.wisl.dev/problems/grumpy-bookstore-owner) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/grumpy_bookstore_owner/solution.py) |
| 1055 | [Shortest Way to Form String](https://leetcode-py.wisl.dev/problems/shortest-way-to-form-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_way_to_form_string/solution.py) |
| 1056 | [Confusing Number](https://leetcode-py.wisl.dev/problems/confusing-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/confusing_number/solution.py) |
| 1057 | [Campus Bikes](https://leetcode-py.wisl.dev/problems/campus-bikes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/campus_bikes/solution.py) |
| 1058 | [Minimize Rounding Error to Meet Target](https://leetcode-py.wisl.dev/problems/minimize-rounding-error-to-meet-target) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_rounding_error_to_meet_target/solution.py) |
| 1059 | [All Paths from Source Lead to Destination](https://leetcode-py.wisl.dev/problems/all-paths-from-source-lead-to-destination) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/all_paths_from_source_lead_to_destination/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) |
| 1071 | [Greatest Common Divisor of Strings](https://leetcode-py.wisl.dev/problems/gcd-of-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/gcd_of_strings/solution.py) |
| 1072 | [Flip Columns For Maximum Number of Equal Rows](https://leetcode-py.wisl.dev/problems/flip-columns-for-maximum-number-of-equal-rows) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/flip_columns_for_maximum_number_of_equal_rows/solution.py) |
| 1074 | [Number of Submatrices That Sum to Target](https://leetcode-py.wisl.dev/problems/number-of-submatrices-that-sum-to-target) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_submatrices_that_sum_to_target/solution.py) |
| 1079 | [Letter Tile Possibilities](https://leetcode-py.wisl.dev/problems/letter-tile-possibilities) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/letter_tile_possibilities/solution.py) |
| 1086 | [High Five](https://leetcode-py.wisl.dev/problems/high-five) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/high_five/solution.py) |
| 1087 | [Brace Expansion](https://leetcode-py.wisl.dev/problems/brace-expansion) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/brace_expansion/solution.py) |
| 1088 | [Confusing Number II](https://leetcode-py.wisl.dev/problems/confusing-number-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/confusing_number_ii/solution.py) |
| 1091 | [Shortest Path in Binary Matrix](https://leetcode-py.wisl.dev/problems/shortest-path-in-binary-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_path_in_binary_matrix/solution.py) |
| 1092 | [Shortest Common Supersequence](https://leetcode-py.wisl.dev/problems/shortest-common-supersequence) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_common_supersequence/solution.py) |
| 1094 | [Car Pooling](https://leetcode-py.wisl.dev/problems/car-pooling) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/car_pooling/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) |
| 1100 | [Find K-Length Substrings With No Repeated Characters](https://leetcode-py.wisl.dev/problems/find-k-length-substrings-with-no-repeated-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_k_length_substrings_with_no_repeated_characters/solution.py) |
| 1101 | [The Earliest Moment When Everyone Become Friends](https://leetcode-py.wisl.dev/problems/the-earliest-moment-when-everyone-become-friends) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/the_earliest_moment_when_everyone_become_friends/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) |
| 1105 | [Filling Bookcase Shelves](https://leetcode-py.wisl.dev/problems/filling-bookcase-shelves) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/filling_bookcase_shelves/solution.py) |
| 1106 | [Parsing A Boolean Expression](https://leetcode-py.wisl.dev/problems/parsing-a-boolean-expression) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/parsing_a_boolean_expression/solution.py) |
| 1110 | [Delete Nodes And Return Forest](https://leetcode-py.wisl.dev/problems/delete-nodes-and-return-forest) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_nodes_and_return_forest/solution.py) |
| 1120 | [Maximum Average Subtree](https://leetcode-py.wisl.dev/problems/maximum-average-subtree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_average_subtree/solution.py) |
| 1121 | [Divide Array Into Increasing Sequences](https://leetcode-py.wisl.dev/problems/divide-array-into-increasing-sequences) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_array_into_increasing_sequences/solution.py) |
| 1122 | [Relative Sort Array](https://leetcode-py.wisl.dev/problems/relative-sort-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/relative_sort_array/solution.py) |
| 1129 | [Shortest Path with Alternating Colors](https://leetcode-py.wisl.dev/problems/shortest-path-with-alternating-colors) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_path_with_alternating_colors/solution.py) |
| 1133 | [Largest Unique Number](https://leetcode-py.wisl.dev/problems/largest-unique-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_unique_number/solution.py) |
| 1134 | [Armstrong Number](https://leetcode-py.wisl.dev/problems/armstrong-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/armstrong_number/solution.py) |
| 1135 | [Connecting Cities With Minimum Cost](https://leetcode-py.wisl.dev/problems/connecting-cities-with-minimum-cost) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/connecting_cities_with_minimum_cost/solution.py) |
| 1136 | [Parallel Courses](https://leetcode-py.wisl.dev/problems/parallel-courses) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/parallel_courses/solution.py) |
| 1137 | [N-th Tribonacci Number](https://leetcode-py.wisl.dev/problems/n-th-tribonacci-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/n_th_tribonacci_number/solution.py) |
| 1140 | [Stone Game II](https://leetcode-py.wisl.dev/problems/stone-game-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/stone_game_ii/solution.py) |

Pages: [1](https://leetcode-py.wisl.dev/catalog/all.md), [2](https://leetcode-py.wisl.dev/catalog/all-2), [3](https://leetcode-py.wisl.dev/catalog/all-3), [4](https://leetcode-py.wisl.dev/catalog/all-4), 5, [6](https://leetcode-py.wisl.dev/catalog/all-6), [7](https://leetcode-py.wisl.dev/catalog/all-7), [8](https://leetcode-py.wisl.dev/catalog/all-8)


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