> ## 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 with Tests

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

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 |
| - | - | - | - |
| 1 | [Two Sum](https://leetcode-py.wisl.dev/problems/two-sum) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum/solution.py) |
| 4 | [Median of Two Sorted Arrays](https://leetcode-py.wisl.dev/problems/median-of-two-sorted-arrays) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/median_of_two_sorted_arrays/solution.py) |
| 11 | [Container With Most Water](https://leetcode-py.wisl.dev/problems/container-with-most-water) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/container_with_most_water/solution.py) |
| 14 | [Longest Common Prefix](https://leetcode-py.wisl.dev/problems/longest-common-prefix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_common_prefix/solution.py) |
| 15 | [3Sum](https://leetcode-py.wisl.dev/problems/three-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum/solution.py) |
| 16 | [3Sum Closest](https://leetcode-py.wisl.dev/problems/three-sum-closest) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum_closest/solution.py) |
| 18 | [4Sum](https://leetcode-py.wisl.dev/problems/four-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/four_sum/solution.py) |
| 26 | [Remove Duplicates From Sorted Array](https://leetcode-py.wisl.dev/problems/remove-duplicates-from-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_duplicates_from_sorted_array/solution.py) |
| 27 | [Remove Element](https://leetcode-py.wisl.dev/problems/remove-element) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_element/solution.py) |
| 31 | [Next Permutation](https://leetcode-py.wisl.dev/problems/next-permutation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/next_permutation/solution.py) |
| 33 | [Search in Rotated Sorted Array](https://leetcode-py.wisl.dev/problems/search-in-rotated-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array/solution.py) |
| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode-py.wisl.dev/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_first_and_last_position_of_element_in_sorted_array/solution.py) |
| 35 | [Search Insert Position](https://leetcode-py.wisl.dev/problems/search-insert-position) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_insert_position/solution.py) |
| 36 | [Valid Sudoku](https://leetcode-py.wisl.dev/problems/valid-sudoku) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_sudoku/solution.py) |
| 37 | [Sudoku Solver](https://leetcode-py.wisl.dev/problems/sudoku-solver) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sudoku_solver/solution.py) |
| 39 | [Combination Sum](https://leetcode-py.wisl.dev/problems/combination-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum/solution.py) |
| 40 | [Combination Sum II](https://leetcode-py.wisl.dev/problems/combination-sum-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum_ii/solution.py) |
| 41 | [First Missing Positive](https://leetcode-py.wisl.dev/problems/first-missing-positive) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/first_missing_positive/solution.py) |
| 42 | [Trapping Rain Water](https://leetcode-py.wisl.dev/problems/trapping-rain-water) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/trapping_rain_water/solution.py) |
| 45 | [Jump Game II](https://leetcode-py.wisl.dev/problems/jump-game-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/jump_game_ii/solution.py) |
| 46 | [Permutations](https://leetcode-py.wisl.dev/problems/permutations) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/permutations/solution.py) |
| 47 | [Permutations II](https://leetcode-py.wisl.dev/problems/permutations-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/permutations_ii/solution.py) |
| 48 | [Rotate Image](https://leetcode-py.wisl.dev/problems/rotate-image) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotate_image/solution.py) |
| 49 | [Group Anagrams](https://leetcode-py.wisl.dev/problems/group-anagrams) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/group_anagrams/solution.py) |
| 51 | [N-Queens](https://leetcode-py.wisl.dev/problems/n-queens) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/n_queens/solution.py) |
| 53 | [Maximum Subarray](https://leetcode-py.wisl.dev/problems/maximum-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_subarray/solution.py) |
| 54 | [Spiral Matrix](https://leetcode-py.wisl.dev/problems/spiral-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix/solution.py) |
| 55 | [Jump Game](https://leetcode-py.wisl.dev/problems/jump-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/jump_game/solution.py) |
| 56 | [Merge Intervals](https://leetcode-py.wisl.dev/problems/merge-intervals) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_intervals/solution.py) |
| 57 | [Insert Interval](https://leetcode-py.wisl.dev/problems/insert-interval) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/insert_interval/solution.py) |
| 59 | [Spiral Matrix II](https://leetcode-py.wisl.dev/problems/spiral-matrix-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix_ii/solution.py) |
| 63 | [Unique Paths II](https://leetcode-py.wisl.dev/problems/unique-paths-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_paths_ii/solution.py) |
| 64 | [Minimum Path Sum](https://leetcode-py.wisl.dev/problems/minimum-path-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_path_sum/solution.py) |
| 66 | [Plus One](https://leetcode-py.wisl.dev/problems/plus-one) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/plus_one/solution.py) |
| 68 | [Text Justification](https://leetcode-py.wisl.dev/problems/text-justification) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/text_justification/solution.py) |
| 73 | [Set Matrix Zeroes](https://leetcode-py.wisl.dev/problems/set-matrix-zeroes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/set_matrix_zeroes/solution.py) |
| 74 | [Search a 2D Matrix](https://leetcode-py.wisl.dev/problems/search-a-2d-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_a_2d_matrix/solution.py) |
| 75 | [Sort Colors](https://leetcode-py.wisl.dev/problems/sort-colors) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_colors/solution.py) |
| 78 | [Subsets](https://leetcode-py.wisl.dev/problems/subsets) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subsets/solution.py) |
| 79 | [Word Search](https://leetcode-py.wisl.dev/problems/word-search) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search/solution.py) |
| 80 | [Remove Duplicates from Sorted Array II](https://leetcode-py.wisl.dev/problems/remove-duplicates-from-sorted-array-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_duplicates_from_sorted_array_ii/solution.py) |
| 81 | [Search in Rotated Sorted Array II](https://leetcode-py.wisl.dev/problems/search-in-rotated-sorted-array-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array_ii/solution.py) |
| 84 | [Largest Rectangle in Histogram](https://leetcode-py.wisl.dev/problems/largest-rectangle-in-histogram) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_rectangle_in_histogram/solution.py) |
| 85 | [Maximal Rectangle](https://leetcode-py.wisl.dev/problems/maximal-rectangle) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximal_rectangle/solution.py) |
| 88 | [Merge Sorted Array](https://leetcode-py.wisl.dev/problems/merge-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_sorted_array/solution.py) |
| 90 | [Subsets II](https://leetcode-py.wisl.dev/problems/subsets-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subsets_ii/solution.py) |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode-py.wisl.dev/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py) |
| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode-py.wisl.dev/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal/solution.py) |
| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode-py.wisl.dev/problems/convert-sorted-array-to-binary-search-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/convert_sorted_array_to_binary_search_tree/solution.py) |
| 118 | [Pascal's Triangle](https://leetcode-py.wisl.dev/problems/pascals-triangle) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pascals_triangle/solution.py) |
| 119 | [Pascal's Triangle II](https://leetcode-py.wisl.dev/problems/pascals-triangle-ii) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pascals_triangle_ii/solution.py) |
| 120 | [Triangle](https://leetcode-py.wisl.dev/problems/triangle) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/triangle/solution.py) |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode-py.wisl.dev/problems/best-time-to-buy-and-sell-stock) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock/solution.py) |
| 122 | [Best Time to Buy and Sell Stock II](https://leetcode-py.wisl.dev/problems/best-time-to-buy-and-sell-stock-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock_ii/solution.py) |
| 123 | [Best Time to Buy and Sell Stock III](https://leetcode-py.wisl.dev/problems/best-time-to-buy-and-sell-stock-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock_iii/solution.py) |
| 128 | [Longest Consecutive Sequence](https://leetcode-py.wisl.dev/problems/longest-consecutive-sequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_consecutive_sequence/solution.py) |
| 130 | [Surrounded Regions](https://leetcode-py.wisl.dev/problems/surrounded-regions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/surrounded_regions/solution.py) |
| 134 | [Gas Station](https://leetcode-py.wisl.dev/problems/gas-station) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/gas_station/solution.py) |
| 135 | [Candy](https://leetcode-py.wisl.dev/problems/candy) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/candy/solution.py) |
| 136 | [Single Number](https://leetcode-py.wisl.dev/problems/single-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_number/solution.py) |
| 137 | [Single Number II](https://leetcode-py.wisl.dev/problems/single-number-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_number_ii/solution.py) |
| 139 | [Word Break](https://leetcode-py.wisl.dev/problems/word-break) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_break/solution.py) |
| 140 | [Word Break II](https://leetcode-py.wisl.dev/problems/word-break-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_break_ii/solution.py) |
| 149 | [Max Points on a Line](https://leetcode-py.wisl.dev/problems/max-points-on-a-line) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/max_points_on_a_line/solution.py) |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode-py.wisl.dev/problems/evaluate-reverse-polish-notation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/evaluate_reverse_polish_notation/solution.py) |
| 152 | [Maximum Product Subarray](https://leetcode-py.wisl.dev/problems/maximum-product-subarray) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_product_subarray/solution.py) |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode-py.wisl.dev/problems/find-minimum-in-rotated-sorted-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array/solution.py) |
| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode-py.wisl.dev/problems/find-minimum-in-rotated-sorted-array-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array_ii/solution.py) |
| 157 | [Read N Characters Given Read4](https://leetcode-py.wisl.dev/problems/read-n-characters-given-read4) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/read_n_characters_given_read4/solution.py) |
| 158 | [Read N Characters Given read4 II - Call Multiple Times](https://leetcode-py.wisl.dev/problems/read-n-characters-given-read4-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/read_n_characters_given_read4_ii/solution.py) |
| 162 | [Find Peak Element](https://leetcode-py.wisl.dev/problems/find-peak-element) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_peak_element/solution.py) |
| 163 | [Missing Ranges](https://leetcode-py.wisl.dev/problems/missing-ranges) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_ranges/solution.py) |
| 164 | [Maximum Gap](https://leetcode-py.wisl.dev/problems/maximum-gap) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_gap/solution.py) |
| 167 | [Two Sum II - Input Array Is Sorted](https://leetcode-py.wisl.dev/problems/two-sum-ii-input-array-is-sorted) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_ii_input_array_is_sorted/solution.py) |
| 169 | [Majority Element](https://leetcode-py.wisl.dev/problems/majority-element) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/majority_element/solution.py) |
| 170 | [Two Sum III - Data structure design](https://leetcode-py.wisl.dev/problems/two-sum-iii-data-structure-design) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_iii_data_structure_design/solution.py) |
| 174 | [Dungeon Game](https://leetcode-py.wisl.dev/problems/dungeon-game) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/dungeon_game/solution.py) |
| 179 | [Largest Number](https://leetcode-py.wisl.dev/problems/largest-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_number/solution.py) |
| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode-py.wisl.dev/problems/best-time-to-buy-and-sell-stock-iv) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock_iv/solution.py) |
| 189 | [Rotate Array](https://leetcode-py.wisl.dev/problems/rotate-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotate_array/solution.py) |
| 198 | [House Robber](https://leetcode-py.wisl.dev/problems/house-robber) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber/solution.py) |
| 200 | [Number of Islands](https://leetcode-py.wisl.dev/problems/number-of-islands) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_islands/solution.py) |
| 204 | [Count Primes](https://leetcode-py.wisl.dev/problems/count-primes) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_primes/solution.py) |
| 209 | [Minimum Size Subarray Sum](https://leetcode-py.wisl.dev/problems/minimum-size-subarray-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_size_subarray_sum/solution.py) |
| 212 | [Word Search II](https://leetcode-py.wisl.dev/problems/word-search-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search_ii/solution.py) |
| 213 | [House Robber II](https://leetcode-py.wisl.dev/problems/house-robber-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber_ii/solution.py) |
| 215 | [Kth Largest Element in an Array](https://leetcode-py.wisl.dev/problems/kth-largest-element-in-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_largest_element_in_an_array/solution.py) |
| 216 | [Combination Sum III](https://leetcode-py.wisl.dev/problems/combination-sum-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum_iii/solution.py) |
| 217 | [Contains Duplicate](https://leetcode-py.wisl.dev/problems/contains-duplicate) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contains_duplicate/solution.py) |
| 218 | [The Skyline Problem](https://leetcode-py.wisl.dev/problems/the-skyline-problem) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/the_skyline_problem/solution.py) |
| 219 | [Contains Duplicate II](https://leetcode-py.wisl.dev/problems/contains-duplicate-ii) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contains_duplicate_ii/solution.py) |
| 220 | [Contains Duplicate III](https://leetcode-py.wisl.dev/problems/contains-duplicate-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contains_duplicate_iii/solution.py) |
| 221 | [Maximal Square](https://leetcode-py.wisl.dev/problems/maximal-square) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximal_square/solution.py) |
| 228 | [Summary Ranges](https://leetcode-py.wisl.dev/problems/summary-ranges) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/summary_ranges/solution.py) |
| 229 | [Majority Element II](https://leetcode-py.wisl.dev/problems/majority-element-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/majority_element_ii/solution.py) |
| 238 | [Product of Array Except Self](https://leetcode-py.wisl.dev/problems/product-of-array-except-self) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/product_of_array_except_self/solution.py) |
| 239 | [Sliding Window Maximum](https://leetcode-py.wisl.dev/problems/sliding-window-maximum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sliding_window_maximum/solution.py) |
| 240 | [Search a 2D Matrix II](https://leetcode-py.wisl.dev/problems/search-a-2d-matrix-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_a_2d_matrix_ii/solution.py) |
| 243 | [Shortest Word Distance](https://leetcode-py.wisl.dev/problems/shortest-word-distance) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_word_distance/solution.py) |
| 244 | [Shortest Word Distance II](https://leetcode-py.wisl.dev/problems/shortest-word-distance-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_word_distance_ii/solution.py) |
| 245 | [Shortest Word Distance III](https://leetcode-py.wisl.dev/problems/shortest-word-distance-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_word_distance_iii/solution.py) |
| 247 | [Strobogrammatic Number II](https://leetcode-py.wisl.dev/problems/strobogrammatic-number-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/strobogrammatic_number_ii/solution.py) |
| 248 | [Strobogrammatic Number III](https://leetcode-py.wisl.dev/problems/strobogrammatic-number-iii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/strobogrammatic_number_iii/solution.py) |
| 249 | [Group Shifted Strings](https://leetcode-py.wisl.dev/problems/group-shifted-strings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/group_shifted_strings/solution.py) |
| 251 | [Flatten 2D Vector](https://leetcode-py.wisl.dev/problems/flatten-2d-vector) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/flatten_2d_vector/solution.py) |
| 252 | [Meeting Rooms](https://leetcode-py.wisl.dev/problems/meeting-rooms) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms/solution.py) |
| 253 | [Meeting Rooms II](https://leetcode-py.wisl.dev/problems/meeting-rooms-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms_ii/solution.py) |
| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode-py.wisl.dev/problems/verify-preorder-sequence-in-binary-search-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/verify_preorder_sequence_in_binary_search_tree/solution.py) |
| 256 | [Paint House](https://leetcode-py.wisl.dev/problems/paint-house) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/paint_house/solution.py) |
| 259 | [3Sum Smaller](https://leetcode-py.wisl.dev/problems/three-sum-smaller) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum_smaller/solution.py) |
| 260 | [Single Number III](https://leetcode-py.wisl.dev/problems/single-number-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_number_iii/solution.py) |
| 265 | [Paint House II](https://leetcode-py.wisl.dev/problems/paint-house-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/paint_house_ii/solution.py) |
| 268 | [Missing Number](https://leetcode-py.wisl.dev/problems/missing-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_number/solution.py) |
| 269 | [Alien Dictionary](https://leetcode-py.wisl.dev/problems/alien-dictionary) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/alien_dictionary/solution.py) |
| 271 | [Encode and Decode Strings](https://leetcode-py.wisl.dev/problems/encode-and-decode-strings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/encode_and_decode_strings/solution.py) |
| 274 | [H-Index](https://leetcode-py.wisl.dev/problems/h-index) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/h_index/solution.py) |
| 275 | [H-Index II](https://leetcode-py.wisl.dev/problems/h-index-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/h_index_ii/solution.py) |
| 280 | [Wiggle Sort](https://leetcode-py.wisl.dev/problems/wiggle-sort) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/wiggle_sort/solution.py) |
| 281 | [Zigzag Iterator](https://leetcode-py.wisl.dev/problems/zigzag-iterator) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/zigzag_iterator/solution.py) |
| 283 | [Move Zeroes](https://leetcode-py.wisl.dev/problems/move-zeroes) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/move_zeroes/solution.py) |
| 284 | [Peeking Iterator](https://leetcode-py.wisl.dev/problems/peeking-iterator) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/peeking_iterator/solution.py) |
| 286 | [Walls And Gates](https://leetcode-py.wisl.dev/problems/walls-and-gates) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/walls_and_gates/solution.py) |
| 287 | [Find the Duplicate Number](https://leetcode-py.wisl.dev/problems/find-the-duplicate-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_duplicate_number/solution.py) |
| 288 | [Unique Word Abbreviation](https://leetcode-py.wisl.dev/problems/unique-word-abbreviation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_word_abbreviation/solution.py) |
| 289 | [Game of Life](https://leetcode-py.wisl.dev/problems/game-of-life) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/game_of_life/solution.py) |
| 296 | [Best Meeting Point](https://leetcode-py.wisl.dev/problems/best-meeting-point) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_meeting_point/solution.py) |
| 300 | [Longest Increasing Subsequence](https://leetcode-py.wisl.dev/problems/longest-increasing-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_increasing_subsequence/solution.py) |
| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode-py.wisl.dev/problems/smallest-rectangle-enclosing-black-pixels) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/smallest_rectangle_enclosing_black_pixels/solution.py) |
| 303 | [Range Sum Query - Immutable](https://leetcode-py.wisl.dev/problems/range-sum-query-immutable) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_query_immutable/solution.py) |
| 304 | [Range Sum Query 2D - Immutable](https://leetcode-py.wisl.dev/problems/range-sum-query-2d-immutable) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_query_2d_immutable/solution.py) |
| 305 | [Number of Islands II](https://leetcode-py.wisl.dev/problems/number-of-islands-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_islands_ii/solution.py) |
| 307 | [Range Sum Query - Mutable](https://leetcode-py.wisl.dev/problems/range-sum-query-mutable) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_query_mutable/solution.py) |
| 308 | [Range Sum Query 2D - Mutable](https://leetcode-py.wisl.dev/problems/range-sum-query-2d-mutable) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_query_2d_mutable/solution.py) |
| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode-py.wisl.dev/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock_with_cooldown/solution.py) |
| 311 | [Sparse Matrix Multiplication](https://leetcode-py.wisl.dev/problems/sparse-matrix-multiplication) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sparse_matrix_multiplication/solution.py) |
| 312 | [Burst Balloons](https://leetcode-py.wisl.dev/problems/burst-balloons) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/burst_balloons/solution.py) |
| 313 | [Super Ugly Number](https://leetcode-py.wisl.dev/problems/super-ugly-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/super_ugly_number/solution.py) |
| 315 | [Count of Smaller Numbers After Self](https://leetcode-py.wisl.dev/problems/count-smaller-numbers-after-self) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_smaller_numbers_after_self/solution.py) |
| 317 | [Shortest Distance from All Buildings](https://leetcode-py.wisl.dev/problems/shortest-distance-from-all-buildings) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_distance_from_all_buildings/solution.py) |
| 318 | [Maximum Product of Word Lengths](https://leetcode-py.wisl.dev/problems/maximum-product-of-word-lengths) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_product_of_word_lengths/solution.py) |
| 321 | [Create Maximum Number](https://leetcode-py.wisl.dev/problems/create-maximum-number) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/create_maximum_number/solution.py) |
| 322 | [Coin Change](https://leetcode-py.wisl.dev/problems/coin-change) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/coin_change/solution.py) |
| 324 | [Wiggle Sort II](https://leetcode-py.wisl.dev/problems/wiggle-sort-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/wiggle_sort_ii/solution.py) |
| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode-py.wisl.dev/problems/maximum-size-subarray-sum-equals-k) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_size_subarray_sum_equals_k/solution.py) |
| 327 | [Count of Range Sum](https://leetcode-py.wisl.dev/problems/count-of-range-sum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_of_range_sum/solution.py) |
| 329 | [Longest Increasing Path in a Matrix](https://leetcode-py.wisl.dev/problems/longest-increasing-path-in-a-matrix) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_increasing_path_in_a_matrix/solution.py) |
| 330 | [Patching Array](https://leetcode-py.wisl.dev/problems/patching-array) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/patching_array/solution.py) |
| 332 | [Reconstruct Itinerary](https://leetcode-py.wisl.dev/problems/reconstruct-itinerary) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reconstruct_itinerary/solution.py) |
| 334 | [Increasing Triplet Subsequence](https://leetcode-py.wisl.dev/problems/increasing-triplet-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/increasing_triplet_subsequence/solution.py) |
| 335 | [Self Crossing](https://leetcode-py.wisl.dev/problems/self-crossing) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/self_crossing/solution.py) |
| 336 | [Palindrome Pairs](https://leetcode-py.wisl.dev/problems/palindrome-pairs) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindrome_pairs/solution.py) |
| 346 | [Moving Average from Data Stream](https://leetcode-py.wisl.dev/problems/moving-average-from-data-stream) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/moving_average_from_data_stream/solution.py) |
| 347 | [Top K Frequent Elements](https://leetcode-py.wisl.dev/problems/top-k-frequent-elements) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/top_k_frequent_elements/solution.py) |
| 348 | [Design Tic-Tac-Toe](https://leetcode-py.wisl.dev/problems/design-tic-tac-toe) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_tic_tac_toe/solution.py) |
| 349 | [Intersection of Two Arrays](https://leetcode-py.wisl.dev/problems/intersection-of-two-arrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/intersection_of_two_arrays/solution.py) |
| 350 | [Intersection of Two Arrays II](https://leetcode-py.wisl.dev/problems/intersection-of-two-arrays-ii) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/intersection_of_two_arrays_ii/solution.py) |
| 353 | [Design Snake Game](https://leetcode-py.wisl.dev/problems/design-snake-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_snake_game/solution.py) |
| 354 | [Russian Doll Envelopes](https://leetcode-py.wisl.dev/problems/russian-doll-envelopes) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/russian_doll_envelopes/solution.py) |
| 356 | [Line Reflection](https://leetcode-py.wisl.dev/problems/line-reflection) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/line_reflection/solution.py) |
| 360 | [Sort Transformed Array](https://leetcode-py.wisl.dev/problems/sort-transformed-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_transformed_array/solution.py) |
| 361 | [Bomb Enemy](https://leetcode-py.wisl.dev/problems/bomb-enemy) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bomb_enemy/solution.py) |
| 362 | [Design Hit Counter](https://leetcode-py.wisl.dev/problems/design-hit-counter) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_hit_counter/solution.py) |
| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode-py.wisl.dev/problems/max-sum-of-rectangle-no-larger-than-k) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/max_sum_of_rectangle_no_larger_than_k/solution.py) |
| 368 | [Largest Divisible Subset](https://leetcode-py.wisl.dev/problems/largest-divisible-subset) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_divisible_subset/solution.py) |
| 370 | [Range Addition](https://leetcode-py.wisl.dev/problems/range-addition) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_addition/solution.py) |
| 373 | [Find K Pairs with Smallest Sums](https://leetcode-py.wisl.dev/problems/find-k-pairs-with-smallest-sums) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_k_pairs_with_smallest_sums/solution.py) |
| 376 | [Wiggle Subsequence](https://leetcode-py.wisl.dev/problems/wiggle-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/wiggle_subsequence/solution.py) |
| 377 | [Combination Sum IV](https://leetcode-py.wisl.dev/problems/combination-sum-iv) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum_iv/solution.py) |
| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode-py.wisl.dev/problems/kth-smallest-element-in-a-sorted-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_element_in_a_sorted_matrix/solution.py) |
| 379 | [Design Phone Directory](https://leetcode-py.wisl.dev/problems/design-phone-directory) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_phone_directory/solution.py) |
| 380 | [Insert Delete GetRandom O(1)](https://leetcode-py.wisl.dev/problems/insert-delete-getrandom-o1) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/insert_delete_getrandom_o1/solution.py) |
| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode-py.wisl.dev/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/insert_delete_getrandom_o1_duplicates_allowed/solution.py) |
| 384 | [Shuffle an Array](https://leetcode-py.wisl.dev/problems/shuffle-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shuffle_an_array/solution.py) |
| 391 | [Perfect Rectangle](https://leetcode-py.wisl.dev/problems/perfect-rectangle) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/perfect_rectangle/solution.py) |
| 393 | [UTF-8 Validation](https://leetcode-py.wisl.dev/problems/utf-8-validation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/utf_8_validation/solution.py) |
| 396 | [Rotate Function](https://leetcode-py.wisl.dev/problems/rotate-function) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotate_function/solution.py) |
| 399 | [Evaluate Division](https://leetcode-py.wisl.dev/problems/evaluate-division) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/evaluate_division/solution.py) |
| 403 | [Frog Jump](https://leetcode-py.wisl.dev/problems/frog-jump) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/frog_jump/solution.py) |
| 406 | [Queue Reconstruction by Height](https://leetcode-py.wisl.dev/problems/queue-reconstruction-by-height) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/queue_reconstruction_by_height/solution.py) |
| 407 | [Trapping Rain Water II](https://leetcode-py.wisl.dev/problems/trapping-rain-water-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/trapping_rain_water_ii/solution.py) |
| 410 | [Split Array Largest Sum](https://leetcode-py.wisl.dev/problems/split-array-largest-sum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/split_array_largest_sum/solution.py) |
| 411 | [Minimum Unique Word Abbreviation](https://leetcode-py.wisl.dev/problems/minimum-unique-word-abbreviation) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_unique_word_abbreviation/solution.py) |
| 413 | [Arithmetic Slices](https://leetcode-py.wisl.dev/problems/arithmetic-slices) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/arithmetic_slices/solution.py) |
| 414 | [Third Maximum Number](https://leetcode-py.wisl.dev/problems/third-maximum-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/third_maximum_number/solution.py) |
| 416 | [Partition Equal Subset Sum](https://leetcode-py.wisl.dev/problems/partition-equal-subset-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/partition_equal_subset_sum/solution.py) |
| 417 | [Pacific Atlantic Water Flow](https://leetcode-py.wisl.dev/problems/pacific-atlantic-water-flow) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pacific_atlantic_water_flow/solution.py) |
| 418 | [Sentence Screen Fitting](https://leetcode-py.wisl.dev/problems/sentence-screen-fitting) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sentence_screen_fitting/solution.py) |
| 419 | [Battleships in a Board](https://leetcode-py.wisl.dev/problems/battleships-in-a-board) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/battleships_in_a_board/solution.py) |
| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode-py.wisl.dev/problems/maximum-xor-of-two-numbers-in-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_xor_of_two_numbers_in_an_array/solution.py) |
| 422 | [Valid Word Square](https://leetcode-py.wisl.dev/problems/valid-word-square) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_word_square/solution.py) |
| 425 | [Word Squares](https://leetcode-py.wisl.dev/problems/word-squares) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_squares/solution.py) |
| 427 | [Construct Quad Tree](https://leetcode-py.wisl.dev/problems/construct-quad-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_quad_tree/solution.py) |
| 435 | [Non-overlapping Intervals](https://leetcode-py.wisl.dev/problems/non-overlapping-intervals) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/non_overlapping_intervals/solution.py) |
| 436 | [Find Right Interval](https://leetcode-py.wisl.dev/problems/find-right-interval) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_right_interval/solution.py) |
| 442 | [Find All Duplicates in an Array](https://leetcode-py.wisl.dev/problems/find-all-duplicates-in-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_all_duplicates_in_an_array/solution.py) |
| 444 | [Sequence Reconstruction](https://leetcode-py.wisl.dev/problems/sequence-reconstruction) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sequence_reconstruction/solution.py) |
| 446 | [Arithmetic Slices II - Subsequence](https://leetcode-py.wisl.dev/problems/arithmetic-slices-ii-subsequence) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/arithmetic_slices_ii_subsequence/solution.py) |
| 447 | [Number of Boomerangs](https://leetcode-py.wisl.dev/problems/number-of-boomerangs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_boomerangs/solution.py) |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode-py.wisl.dev/problems/find-all-numbers-disappeared-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_all_numbers_disappeared_in_an_array/solution.py) |
| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode-py.wisl.dev/problems/minimum-number-of-arrows-to-burst-balloons) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_arrows_to_burst_balloons/solution.py) |

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


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