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

# Hash Table in Python, Part 2

> All 300 Hash Table LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-300.

Hash Table holds 300 problems (72 Easy, 181 Medium, 47 Hard).
Generate any of them into the current directory with `lcpy gen -n <number>`.

| # | Problem | Difficulty | Solution |
| - | - | - | - |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 1152 | [Analyze User Website Visit Pattern](https://leetcode-py.wisl.dev/problems/analyze-user-website-visit-pattern) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/analyze_user_website_visit_pattern/solution.py) |
| 1160 | [Find Words That Can Be Formed by Characters](https://leetcode-py.wisl.dev/problems/find-words-that-can-be-formed-by-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_words_that_can_be_formed_by_characters/solution.py) |
| 1165 | [Single-Row Keyboard](https://leetcode-py.wisl.dev/problems/single-row-keyboard) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_row_keyboard/solution.py) |
| 1166 | [Design File System](https://leetcode-py.wisl.dev/problems/design-file-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_file_system/solution.py) |
| 1189 | [Maximum Number of Balloons](https://leetcode-py.wisl.dev/problems/maximum-number-of-balloons) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_balloons/solution.py) |
| 1198 | [Find Smallest Common Element in All Rows](https://leetcode-py.wisl.dev/problems/find-smallest-common-element-in-all-rows) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_smallest_common_element_in_all_rows/solution.py) |
| 1244 | [Design A Leaderboard](https://leetcode-py.wisl.dev/problems/design-a-leaderboard) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_a_leaderboard/solution.py) |
| 1248 | [Count Number of Nice Subarrays](https://leetcode-py.wisl.dev/problems/count-number-of-nice-subarrays) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_number_of_nice_subarrays/solution.py) |
| 1255 | [Maximum Score Words Formed by Letters](https://leetcode-py.wisl.dev/problems/maximum-score-words-formed-by-letters) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_score_words_formed_by_letters/solution.py) |
| 1258 | [Synonymous Sentences](https://leetcode-py.wisl.dev/problems/synonymous-sentences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/synonymous_sentences/solution.py) |
| 1358 | [Number of Substrings Containing All Three Characters](https://leetcode-py.wisl.dev/problems/number-of-substrings-containing-all-three-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_substrings_containing_all_three_characters/solution.py) |
| 1394 | [Find Lucky Integer in an Array](https://leetcode-py.wisl.dev/problems/find-lucky-integer-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_lucky_integer_in_an_array/solution.py) |
| 1396 | [Design Underground System](https://leetcode-py.wisl.dev/problems/design-underground-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_underground_system/solution.py) |
| 1400 | [Construct K Palindrome Strings](https://leetcode-py.wisl.dev/problems/construct-k-palindrome-strings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_k_palindrome_strings/solution.py) |
| 1426 | [Counting Elements](https://leetcode-py.wisl.dev/problems/counting-elements) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_elements/solution.py) |
| 1429 | [First Unique Number](https://leetcode-py.wisl.dev/problems/first-unique-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/first_unique_number/solution.py) |
| 1436 | [Destination City](https://leetcode-py.wisl.dev/problems/destination-city) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/destination_city/solution.py) |
| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode-py.wisl.dev/problems/count-triplets-that-can-form-two-arrays-of-equal-xor) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_triplets_that_can_form_two_arrays_of_equal_xor/solution.py) |
| 1443 | [Minimum Time to Collect All Apples in a Tree](https://leetcode-py.wisl.dev/problems/minimum-time-to-collect-all-apples-in-a-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_time_to_collect_all_apples_in_a_tree/solution.py) |
| 1460 | [Make Two Arrays Equal by Reversing Subarrays](https://leetcode-py.wisl.dev/problems/make-two-arrays-equal-by-reversing-subarrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/make_two_arrays_equal_by_reversing_subarrays/solution.py) |
| 1461 | [Check If a String Contains All Binary Codes of Size K](https://leetcode-py.wisl.dev/problems/check-if-a-string-contains-all-binary-codes-of-size-k) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_a_string_contains_all_binary_codes_of_size_k/solution.py) |
| 1481 | [Least Number of Unique Integers after K Removals](https://leetcode-py.wisl.dev/problems/least-number-of-unique-integers-after-k-removals) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/least_number_of_unique_integers_after_k_removals/solution.py) |
| 1490 | [Clone N-ary Tree](https://leetcode-py.wisl.dev/problems/clone-n-ary-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/clone_n_ary_tree/solution.py) |
| 1496 | [Path Crossing](https://leetcode-py.wisl.dev/problems/path-crossing) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/path_crossing/solution.py) |
| 1506 | [Find Root of N-Ary Tree](https://leetcode-py.wisl.dev/problems/find-root-of-n-ary-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_root_of_n_ary_tree/solution.py) |
| 1512 | [Number of Good Pairs](https://leetcode-py.wisl.dev/problems/number-of-good-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_good_pairs/solution.py) |
| 1570 | [Dot Product of Two Sparse Vectors](https://leetcode-py.wisl.dev/problems/dot-product-of-two-sparse-vectors) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/dot_product_of_two_sparse_vectors/solution.py) |
| 1590 | [Make Sum Divisible by P](https://leetcode-py.wisl.dev/problems/make-sum-divisible-by-p) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/make_sum_divisible_by_p/solution.py) |
| 1593 | [Split a String Into the Max Number of Unique Substrings](https://leetcode-py.wisl.dev/problems/split-a-string-into-the-max-number-of-unique-substrings) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/split_a_string_into_the_max_number_of_unique_substrings/solution.py) |
| 1624 | [Largest Substring Between Two Equal Characters](https://leetcode-py.wisl.dev/problems/largest-substring-between-two-equal-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_substring_between_two_equal_characters/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) |
| 1647 | [Minimum Deletions to Make Character Frequencies Unique](https://leetcode-py.wisl.dev/problems/minimum-deletions-to-make-character-frequencies-unique) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_deletions_to_make_character_frequencies_unique/solution.py) |
| 1650 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode-py.wisl.dev/problems/lowest-common-ancestor-of-a-binary-tree-iii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lowest_common_ancestor_of_a_binary_tree_iii/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) |
| 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) |
| 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) |
| 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode-py.wisl.dev/problems/check-if-one-string-swap-can-make-strings-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_one_string_swap_can_make_strings_equal/solution.py) |
| 1836 | [Remove Duplicates From an Unsorted Linked List](https://leetcode-py.wisl.dev/problems/remove-duplicates-from-an-unsorted-linked-list) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_duplicates_from_an_unsorted_linked_list/solution.py) |
| 1857 | [Largest Color Value in a Directed Graph](https://leetcode-py.wisl.dev/problems/largest-color-value-in-a-directed-graph) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_color_value_in_a_directed_graph/solution.py) |
| 1897 | [Redistribute Characters to Make All Strings Equal](https://leetcode-py.wisl.dev/problems/redistribute-characters-to-make-all-strings-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/redistribute_characters_to_make_all_strings_equal/solution.py) |
| 1930 | [Unique Length-3 Palindromic Subsequences](https://leetcode-py.wisl.dev/problems/unique-length-3-palindromic-subsequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_length_3_palindromic_subsequences/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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 2182 | [Construct String With Repeat Limit](https://leetcode-py.wisl.dev/problems/construct-string-with-repeat-limit) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_string_with_repeat_limit/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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 2370 | [Longest Ideal Subsequence](https://leetcode-py.wisl.dev/problems/longest-ideal-subsequence) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_ideal_subsequence/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) |
| 2405 | [Optimal Partition of String](https://leetcode-py.wisl.dev/problems/optimal-partition-of-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/optimal_partition_of_string/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) |
| 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) |
| 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) |
| 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) |
| 2516 | [Take K of Each Character From Left and Right](https://leetcode-py.wisl.dev/problems/take-k-of-each-character-from-left-and-right) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/take_k_of_each_character_from_left_and_right/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) |
| 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) |
| 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) |
| 2641 | [Cousins in Binary Tree II](https://leetcode-py.wisl.dev/problems/cousins-in-binary-tree-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/cousins_in_binary_tree_ii/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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 3016 | [Minimum Number of Pushes to Type Word II](https://leetcode-py.wisl.dev/problems/minimum-number-of-pushes-to-type-word-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_pushes_to_type_word_ii/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) |
| 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) |
| 3223 | [Minimum Length of String After Operations](https://leetcode-py.wisl.dev/problems/minimum-length-of-string-after-operations) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_length_of_string_after_operations/solution.py) |
| 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](https://leetcode-py.wisl.dev/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_of_substrings_containing_every_vowel_and_k_consonants_ii/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) |
| 3442 | [Maximum Difference Between Even and Odd Frequency I](https://leetcode-py.wisl.dev/problems/maximum-difference-between-even-and-odd-frequency-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_difference_between_even_and_odd_frequency_i/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) |

Pages: [1](https://leetcode-py.wisl.dev/catalog/topics/hash-table), 2


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