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

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

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 |
| - | - | - | - |
| 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) |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode-py.wisl.dev/problems/longest-substring-without-repeating-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_without_repeating_characters/solution.py) |
| 12 | [Integer to Roman](https://leetcode-py.wisl.dev/problems/integer-to-roman) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/integer_to_roman/solution.py) |
| 13 | [Roman to Integer](https://leetcode-py.wisl.dev/problems/roman-to-integer) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/roman_to_integer/solution.py) |
| 17 | [Letter Combinations of a Phone Number](https://leetcode-py.wisl.dev/problems/letter-combinations-of-a-phone-number) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/letter_combinations_of_a_phone_number/solution.py) |
| 30 | [Substring with Concatenation of All Words](https://leetcode-py.wisl.dev/problems/substring-with-concatenation-of-all-words) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/substring_with_concatenation_of_all_words/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) |
| 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) |
| 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) |
| 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) |
| 76 | [Minimum Window Substring](https://leetcode-py.wisl.dev/problems/minimum-window-substring) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_window_substring/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) |
| 126 | [Word Ladder II](https://leetcode-py.wisl.dev/problems/word-ladder-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_ladder_ii/solution.py) |
| 127 | [Word Ladder](https://leetcode-py.wisl.dev/problems/word-ladder) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_ladder/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) |
| 133 | [Clone Graph](https://leetcode-py.wisl.dev/problems/clone-graph) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/clone_graph/solution.py) |
| 138 | [Copy List with Random Pointer](https://leetcode-py.wisl.dev/problems/copy-list-with-random-pointer) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/copy_list_with_random_pointer/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) |
| 141 | [Linked List Cycle](https://leetcode-py.wisl.dev/problems/linked-list-cycle) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/linked_list_cycle/solution.py) |
| 142 | [Linked List Cycle II](https://leetcode-py.wisl.dev/problems/linked-list-cycle-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/linked_list_cycle_ii/solution.py) |
| 146 | [LRU Cache](https://leetcode-py.wisl.dev/problems/lru-cache) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lru_cache/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) |
| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode-py.wisl.dev/problems/longest-substring-with-at-most-two-distinct-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_with_at_most_two_distinct_characters/solution.py) |
| 160 | [Intersection of Two Linked Lists](https://leetcode-py.wisl.dev/problems/intersection-of-two-linked-lists) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/intersection_of_two_linked_lists/solution.py) |
| 166 | [Fraction to Recurring Decimal](https://leetcode-py.wisl.dev/problems/fraction-to-recurring-decimal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/fraction_to_recurring_decimal/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) |
| 187 | [Repeated DNA Sequences](https://leetcode-py.wisl.dev/problems/repeated-dna-sequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/repeated_dna_sequences/solution.py) |
| 202 | [Happy Number](https://leetcode-py.wisl.dev/problems/happy-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/happy_number/solution.py) |
| 205 | [Isomorphic Strings](https://leetcode-py.wisl.dev/problems/isomorphic-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/isomorphic_strings/solution.py) |
| 208 | [Implement Trie (Prefix Tree)](https://leetcode-py.wisl.dev/problems/implement-trie-prefix-tree) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/implement_trie_prefix_tree/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) |
| 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) |
| 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) |
| 242 | [Valid Anagram](https://leetcode-py.wisl.dev/problems/valid-anagram) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_anagram/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) |
| 246 | [Strobogrammatic Number](https://leetcode-py.wisl.dev/problems/strobogrammatic-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/strobogrammatic_number/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) |
| 264 | [Ugly Number II](https://leetcode-py.wisl.dev/problems/ugly-number-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/ugly_number_ii/solution.py) |
| 266 | [Palindrome Permutation](https://leetcode-py.wisl.dev/problems/palindrome-permutation) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindrome_permutation/solution.py) |
| 267 | [Palindrome Permutation II](https://leetcode-py.wisl.dev/problems/palindrome-permutation-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindrome_permutation_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) |
| 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) |
| 290 | [Word Pattern](https://leetcode-py.wisl.dev/problems/word-pattern) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_pattern/solution.py) |
| 291 | [Word Pattern II](https://leetcode-py.wisl.dev/problems/word-pattern-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_pattern_ii/solution.py) |
| 299 | [Bulls and Cows](https://leetcode-py.wisl.dev/problems/bulls-and-cows) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bulls_and_cows/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) |
| 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) |
| 314 | [Binary Tree Vertical Order Traversal](https://leetcode-py.wisl.dev/problems/binary-tree-vertical-order-traversal) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_vertical_order_traversal/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) |
| 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) |
| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode-py.wisl.dev/problems/longest-substring-with-at-most-k-distinct-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_with_at_most_k_distinct_characters/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) |
| 352 | [Data Stream as Disjoint Intervals](https://leetcode-py.wisl.dev/problems/data-stream-as-disjoint-intervals) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/data_stream_as_disjoint_intervals/solution.py) |
| 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) |
| 355 | [Design Twitter](https://leetcode-py.wisl.dev/problems/design-twitter) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_twitter/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) |
| 358 | [Rearrange String k Distance Apart](https://leetcode-py.wisl.dev/problems/rearrange-string-k-distance-apart) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rearrange_string_k_distance_apart/solution.py) |
| 359 | [Logger Rate Limiter](https://leetcode-py.wisl.dev/problems/logger-rate-limiter) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/logger_rate_limiter/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) |
| 383 | [Ransom Note](https://leetcode-py.wisl.dev/problems/ransom-note) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/ransom_note/solution.py) |
| 387 | [First Unique Character in a String](https://leetcode-py.wisl.dev/problems/first-unique-character-in-a-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/first_unique_character_in_a_string/solution.py) |
| 389 | [Find the Difference](https://leetcode-py.wisl.dev/problems/find-the-difference) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_difference/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) |
| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode-py.wisl.dev/problems/longest-substring-with-at-least-k-repeating-characters) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_with_at_least_k_repeating_characters/solution.py) |
| 398 | [Random Pick Index](https://leetcode-py.wisl.dev/problems/random-pick-index) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_pick_index/solution.py) |
| 409 | [Longest Palindrome](https://leetcode-py.wisl.dev/problems/longest-palindrome) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_palindrome/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) |
| 423 | [Reconstruct Original Digits from English](https://leetcode-py.wisl.dev/problems/reconstruct-original-digits-from-english) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reconstruct_original_digits_from_english/solution.py) |
| 424 | [Longest Repeating Character Replacement](https://leetcode-py.wisl.dev/problems/longest-repeating-character-replacement) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_repeating_character_replacement/solution.py) |
| 432 | [All O\`one Data Structure](https://leetcode-py.wisl.dev/problems/all-oone-data-structure) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/all_oone_data_structure/solution.py) |
| 433 | [Minimum Genetic Mutation](https://leetcode-py.wisl.dev/problems/minimum-genetic-mutation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_genetic_mutation/solution.py) |
| 438 | [Find All Anagrams in a String](https://leetcode-py.wisl.dev/problems/find-all-anagrams-in-a-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_all_anagrams_in_a_string/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) |
| 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) |
| 451 | [Sort Characters By Frequency](https://leetcode-py.wisl.dev/problems/sort-characters-by-frequency) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_characters_by_frequency/solution.py) |
| 454 | [4Sum II](https://leetcode-py.wisl.dev/problems/four-sum-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/four_sum_ii/solution.py) |
| 457 | [Circular Array Loop](https://leetcode-py.wisl.dev/problems/circular-array-loop) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/circular_array_loop/solution.py) |
| 460 | [LFU Cache](https://leetcode-py.wisl.dev/problems/lfu-cache) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lfu_cache/solution.py) |
| 480 | [Sliding Window Median](https://leetcode-py.wisl.dev/problems/sliding-window-median) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sliding_window_median/solution.py) |
| 491 | [Non-decreasing Subsequences](https://leetcode-py.wisl.dev/problems/non-decreasing-subsequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/non_decreasing_subsequences/solution.py) |
| 496 | [Next Greater Element I](https://leetcode-py.wisl.dev/problems/next-greater-element-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/next_greater_element_i/solution.py) |
| 500 | [Keyboard Row](https://leetcode-py.wisl.dev/problems/keyboard-row) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/keyboard_row/solution.py) |
| 508 | [Most Frequent Subtree Sum](https://leetcode-py.wisl.dev/problems/most-frequent-subtree-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_frequent_subtree_sum/solution.py) |
| 519 | [Random Flip Matrix](https://leetcode-py.wisl.dev/problems/random-flip-matrix) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_flip_matrix/solution.py) |
| 522 | [Longest Uncommon Subsequence II](https://leetcode-py.wisl.dev/problems/longest-uncommon-subsequence-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_uncommon_subsequence_ii/solution.py) |
| 523 | [Continuous Subarray Sum](https://leetcode-py.wisl.dev/problems/continuous-subarray-sum) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/continuous_subarray_sum/solution.py) |
| 525 | [Contiguous Array](https://leetcode-py.wisl.dev/problems/contiguous-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contiguous_array/solution.py) |
| 531 | [Lonely Pixel I](https://leetcode-py.wisl.dev/problems/lonely-pixel-i) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lonely_pixel_i/solution.py) |
| 532 | [K-diff Pairs in an Array](https://leetcode-py.wisl.dev/problems/k-diff-pairs-in-an-array) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/k_diff_pairs_in_an_array/solution.py) |
| 533 | [Lonely Pixel II](https://leetcode-py.wisl.dev/problems/lonely-pixel-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lonely_pixel_ii/solution.py) |
| 535 | [Encode and Decode TinyURL](https://leetcode-py.wisl.dev/problems/encode-and-decode-tinyurl) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/encode_and_decode_tinyurl/solution.py) |
| 548 | [Split Array with Equal Sum](https://leetcode-py.wisl.dev/problems/split-array-with-equal-sum) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/split_array_with_equal_sum/solution.py) |
| 554 | [Brick Wall](https://leetcode-py.wisl.dev/problems/brick-wall) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/brick_wall/solution.py) |
| 560 | [Subarray Sum Equals K](https://leetcode-py.wisl.dev/problems/subarray-sum-equals-k) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subarray_sum_equals_k/solution.py) |
| 567 | [Permutation in String](https://leetcode-py.wisl.dev/problems/permutation-in-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/permutation_in_string/solution.py) |
| 575 | [Distribute Candies](https://leetcode-py.wisl.dev/problems/distribute-candies) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/distribute_candies/solution.py) |
| 582 | [Kill Process](https://leetcode-py.wisl.dev/problems/kill-process) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kill_process/solution.py) |
| 588 | [Design In-Memory File System](https://leetcode-py.wisl.dev/problems/design-in-memory-file-system) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_in_memory_file_system/solution.py) |
| 594 | [Longest Harmonious Subsequence](https://leetcode-py.wisl.dev/problems/longest-harmonious-subsequence) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_harmonious_subsequence/solution.py) |
| 599 | [Minimum Index Sum of Two Lists](https://leetcode-py.wisl.dev/problems/minimum-index-sum-of-two-lists) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_index_sum_of_two_lists/solution.py) |
| 609 | [Find Duplicate File in System](https://leetcode-py.wisl.dev/problems/find-duplicate-file-in-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_duplicate_file_in_system/solution.py) |
| 616 | [Add Bold Tag in String](https://leetcode-py.wisl.dev/problems/add-bold-tag-in-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/add_bold_tag_in_string/solution.py) |
| 621 | [Task Scheduler](https://leetcode-py.wisl.dev/problems/task-scheduler) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/task_scheduler/solution.py) |
| 631 | [Design Excel Sum Formula](https://leetcode-py.wisl.dev/problems/design-excel-sum-formula) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_excel_sum_formula/solution.py) |
| 635 | [Design Log Storage System](https://leetcode-py.wisl.dev/problems/design-log-storage-system) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_log_storage_system/solution.py) |
| 645 | [Set Mismatch](https://leetcode-py.wisl.dev/problems/set-mismatch) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/set_mismatch/solution.py) |
| 648 | [Replace Words](https://leetcode-py.wisl.dev/problems/replace-words) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/replace_words/solution.py) |
| 652 | [Find Duplicate Subtrees](https://leetcode-py.wisl.dev/problems/find-duplicate-subtrees) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_duplicate_subtrees/solution.py) |
| 653 | [Two Sum IV - Input is a BST](https://leetcode-py.wisl.dev/problems/two-sum-iv-input-is-a-bst) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_iv_input_is_a_bst/solution.py) |
| 659 | [Split Array into Consecutive Subsequences](https://leetcode-py.wisl.dev/problems/split-array-into-consecutive-subsequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/split_array_into_consecutive_subsequences/solution.py) |
| 666 | [Path Sum IV](https://leetcode-py.wisl.dev/problems/path-sum-iv) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/path_sum_iv/solution.py) |
| 676 | [Implement Magic Dictionary](https://leetcode-py.wisl.dev/problems/implement-magic-dictionary) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/implement_magic_dictionary/solution.py) |
| 677 | [Map Sum Pairs](https://leetcode-py.wisl.dev/problems/map-sum-pairs) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/map_sum_pairs/solution.py) |
| 681 | [Next Closest Time](https://leetcode-py.wisl.dev/problems/next-closest-time) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/next_closest_time/solution.py) |
| 690 | [Employee Importance](https://leetcode-py.wisl.dev/problems/employee-importance) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/employee_importance/solution.py) |
| 692 | [Top K Frequent Words](https://leetcode-py.wisl.dev/problems/top-k-frequent-words) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/top_k_frequent_words/solution.py) |
| 694 | [Number of Distinct Islands](https://leetcode-py.wisl.dev/problems/number-of-distinct-islands) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_distinct_islands/solution.py) |
| 697 | [Degree of an Array](https://leetcode-py.wisl.dev/problems/degree-of-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/degree_of_an_array/solution.py) |
| 705 | [Design HashSet](https://leetcode-py.wisl.dev/problems/design-hash-set) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_hash_set/solution.py) |
| 706 | [Design HashMap](https://leetcode-py.wisl.dev/problems/design-hash-map) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_hash_map/solution.py) |
| 710 | [Random Pick with Blacklist](https://leetcode-py.wisl.dev/problems/random-pick-with-blacklist) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/random_pick_with_blacklist/solution.py) |
| 711 | [Number of Distinct Islands II](https://leetcode-py.wisl.dev/problems/number-of-distinct-islands-ii) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_distinct_islands_ii/solution.py) |
| 720 | [Longest Word in Dictionary](https://leetcode-py.wisl.dev/problems/longest-word-in-dictionary) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_word_in_dictionary/solution.py) |
| 721 | [Accounts Merge](https://leetcode-py.wisl.dev/problems/accounts-merge) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/accounts_merge/solution.py) |
| 726 | [Number of Atoms](https://leetcode-py.wisl.dev/problems/number-of-atoms) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_atoms/solution.py) |
| 734 | [Sentence Similarity](https://leetcode-py.wisl.dev/problems/sentence-similarity) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sentence_similarity/solution.py) |
| 736 | [Parse Lisp Expression](https://leetcode-py.wisl.dev/problems/parse-lisp-expression) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/parse_lisp_expression/solution.py) |
| 737 | [Sentence Similarity II](https://leetcode-py.wisl.dev/problems/sentence-similarity-ii) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sentence_similarity_ii/solution.py) |
| 740 | [Delete and Earn](https://leetcode-py.wisl.dev/problems/delete-and-earn) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_and_earn/solution.py) |
| 745 | [Prefix and Suffix Search](https://leetcode-py.wisl.dev/problems/prefix-and-suffix-search) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/prefix_and_suffix_search/solution.py) |
| 748 | [Shortest Completing Word](https://leetcode-py.wisl.dev/problems/shortest-completing-word) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_completing_word/solution.py) |
| 752 | [Open the Lock](https://leetcode-py.wisl.dev/problems/open-the-lock) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/open_the_lock/solution.py) |
| 756 | [Pyramid Transition Matrix](https://leetcode-py.wisl.dev/problems/pyramid-transition) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pyramid_transition/solution.py) |
| 758 | [Bold Words in String](https://leetcode-py.wisl.dev/problems/bold-words-in-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bold_words_in_string/solution.py) |
| 760 | [Find Anagram Mappings](https://leetcode-py.wisl.dev/problems/find-anagram-mappings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_anagram_mappings/solution.py) |
| 763 | [Partition Labels](https://leetcode-py.wisl.dev/problems/partition-labels) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/partition_labels/solution.py) |
| 767 | [Reorganize String](https://leetcode-py.wisl.dev/problems/reorganize-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reorganize_string/solution.py) |
| 770 | [Basic Calculator IV](https://leetcode-py.wisl.dev/problems/basic-calculator-iv) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/basic_calculator_iv/solution.py) |
| 771 | [Jewels and Stones](https://leetcode-py.wisl.dev/problems/jewels-and-stones) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/jewels_and_stones/solution.py) |
| 781 | [Rabbits in Forest](https://leetcode-py.wisl.dev/problems/rabbits-in-forest) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rabbits_in_forest/solution.py) |
| 791 | [Custom Sort String](https://leetcode-py.wisl.dev/problems/custom-sort-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/custom_sort_string/solution.py) |
| 792 | [Number of Matching Subsequences](https://leetcode-py.wisl.dev/problems/number-of-matching-subsequences) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_matching_subsequences/solution.py) |
| 804 | [Unique Morse Code Words](https://leetcode-py.wisl.dev/problems/unique-morse-code-words) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_morse_code_words/solution.py) |
| 811 | [Subdomain Visit Count](https://leetcode-py.wisl.dev/problems/subdomain-visit-count) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subdomain_visit_count/solution.py) |
| 815 | [Bus Routes](https://leetcode-py.wisl.dev/problems/bus-routes) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/bus_routes/solution.py) |
| 817 | [Linked List Components](https://leetcode-py.wisl.dev/problems/linked-list-components) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/linked_list_components/solution.py) |
| 819 | [Most Common Word](https://leetcode-py.wisl.dev/problems/most-common-word) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/most_common_word/solution.py) |
| 820 | [Short Encoding of Words](https://leetcode-py.wisl.dev/problems/short-encoding-of-words) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/short_encoding_of_words/solution.py) |
| 822 | [Card Flipping Game](https://leetcode-py.wisl.dev/problems/card-flipping-game) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/card_flipping_game/solution.py) |
| 823 | [Binary Trees With Factors](https://leetcode-py.wisl.dev/problems/binary-trees-with-factors) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_trees_with_factors/solution.py) |
| 828 | [Count Unique Characters of All Substrings of a Given String](https://leetcode-py.wisl.dev/problems/count-unique-characters-of-all-substrings-of-a-given-string) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_unique_characters_of_all_substrings_of_a_given_string/solution.py) |
| 833 | [Find And Replace in String](https://leetcode-py.wisl.dev/problems/find-and-replace-in-string) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_and_replace_in_string/solution.py) |
| 839 | [Similar String Groups](https://leetcode-py.wisl.dev/problems/similar-string-groups) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/similar_string_groups/solution.py) |
| 840 | [Magic Squares In Grid](https://leetcode-py.wisl.dev/problems/magic-squares-in-grid) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/magic_squares_in_grid/solution.py) |
| 846 | [Hand of Straights](https://leetcode-py.wisl.dev/problems/hand-of-straights) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/hand_of_straights/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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |

Pages: 1, [2](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.