> ## 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. # Blind 75 > All 75 Blind 75 problems with links to each problem and solution. Blind 75 holds 75 problems (19 Easy, 49 Medium, 7 Hard). Generate the whole collection into the current directory: ```bash theme={"theme":{"light":"github-light","dark":"github-dark"}} lcpy gen -t blind-75 ``` | # | Problem | Difficulty | Solution | | ---- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ---------- | ----------------------------------------------------------------------------------------------------------------------------------------------- | | 1 | [Two Sum](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum/solution.py) | | 3 | [Longest Substring Without Repeating Characters](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_without_repeating_characters/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_substring_without_repeating_characters/solution.py) | | 5 | [Longest Palindromic Substring](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_palindromic_substring/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_palindromic_substring/solution.py) | | 11 | [Container With Most Water](https://github.com/wislertt/leetcode-py/blob/main/leetcode/container_with_most_water/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/container_with_most_water/solution.py) | | 15 | [3Sum](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/three_sum/solution.py) | | 19 | [Remove Nth Node From End of List](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_nth_node_from_end_of_list/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_nth_node_from_end_of_list/solution.py) | | 20 | [Valid Parentheses](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_parentheses/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_parentheses/solution.py) | | 21 | [Merge Two Sorted Lists](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_two_sorted_lists/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_two_sorted_lists/solution.py) | | 23 | [Merge k Sorted Lists](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_k_sorted_lists/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_k_sorted_lists/solution.py) | | 33 | [Search in Rotated Sorted Array](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/search_in_rotated_sorted_array/solution.py) | | 39 | [Combination Sum](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/combination_sum/solution.py) | | 48 | [Rotate Image](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotate_image/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/rotate_image/solution.py) | | 49 | [Group Anagrams](https://github.com/wislertt/leetcode-py/blob/main/leetcode/group_anagrams/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/group_anagrams/solution.py) | | 53 | [Maximum Subarray](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_subarray/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_subarray/solution.py) | | 54 | [Spiral Matrix](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/spiral_matrix/solution.py) | | 55 | [Jump Game](https://github.com/wislertt/leetcode-py/blob/main/leetcode/jump_game/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/jump_game/solution.py) | | 56 | [Merge Intervals](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_intervals/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_intervals/solution.py) | | 57 | [Insert Interval](https://github.com/wislertt/leetcode-py/blob/main/leetcode/insert_interval/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/insert_interval/solution.py) | | 62 | [Unique Paths](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_paths/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/unique_paths/solution.py) | | 70 | [Climbing Stairs](https://github.com/wislertt/leetcode-py/blob/main/leetcode/climbing_stairs/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/climbing_stairs/solution.py) | | 73 | [Set Matrix Zeroes](https://github.com/wislertt/leetcode-py/blob/main/leetcode/set_matrix_zeroes/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/set_matrix_zeroes/solution.py) | | 76 | [Minimum Window Substring](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_window_substring/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_window_substring/solution.py) | | 79 | [Word Search](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search/solution.py) | | 91 | [Decode Ways](https://github.com/wislertt/leetcode-py/blob/main/leetcode/decode_ways/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/decode_ways/solution.py) | | 98 | [Validate Binary Search Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/validate_binary_search_tree/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/validate_binary_search_tree/solution.py) | | 100 | [Same Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/same_tree/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/same_tree/solution.py) | | 102 | [Binary Tree Level Order Traversal](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_level_order_traversal/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_level_order_traversal/solution.py) | | 104 | [Maximum Depth of Binary Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_depth_of_binary_tree/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_depth_of_binary_tree/solution.py) | | 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py) | | 121 | [Best Time to Buy and Sell Stock](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/best_time_to_buy_and_sell_stock/solution.py) | | 124 | [Binary Tree Maximum Path Sum](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_maximum_path_sum/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/binary_tree_maximum_path_sum/solution.py) | | 125 | [Valid Palindrome](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_palindrome/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_palindrome/solution.py) | | 128 | [Longest Consecutive Sequence](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_consecutive_sequence/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_consecutive_sequence/solution.py) | | 133 | [Clone Graph](https://github.com/wislertt/leetcode-py/blob/main/leetcode/clone_graph/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/clone_graph/solution.py) | | 139 | [Word Break](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_break/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_break/solution.py) | | 141 | [Linked List Cycle](https://github.com/wislertt/leetcode-py/blob/main/leetcode/linked_list_cycle/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/linked_list_cycle/solution.py) | | 143 | [Reorder List](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reorder_list/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reorder_list/solution.py) | | 152 | [Maximum Product Subarray](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_product_subarray/README.md) | 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://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_in_rotated_sorted_array/solution.py) | | 190 | [Reverse Bits](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_bits/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_bits/solution.py) | | 191 | [Number of 1 Bits](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_1_bits/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_1_bits/solution.py) | | 198 | [House Robber](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber/solution.py) | | 200 | [Number of Islands](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_islands/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_islands/solution.py) | | 206 | [Reverse Linked List](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_linked_list/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/reverse_linked_list/solution.py) | | 207 | [Course Schedule](https://github.com/wislertt/leetcode-py/blob/main/leetcode/course_schedule/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/course_schedule/solution.py) | | 208 | [Implement Trie (Prefix Tree)](https://github.com/wislertt/leetcode-py/blob/main/leetcode/implement_trie_prefix_tree/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/implement_trie_prefix_tree/solution.py) | | 211 | [Design Add and Search Words Data Structure](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_add_and_search_words_data_structure/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_add_and_search_words_data_structure/solution.py) | | 212 | [Word Search II](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search_ii/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/word_search_ii/solution.py) | | 213 | [House Robber II](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber_ii/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/house_robber_ii/solution.py) | | 217 | [Contains Duplicate](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contains_duplicate/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/contains_duplicate/solution.py) | | 226 | [Invert Binary Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/invert_binary_tree/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/invert_binary_tree/solution.py) | | 230 | [Kth Smallest Element in a BST](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_element_in_a_bst/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_element_in_a_bst/solution.py) | | 235 | [Lowest Common Ancestor of a Binary Search Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lowest_common_ancestor_of_a_binary_search_tree/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lowest_common_ancestor_of_a_binary_search_tree/solution.py) | | 238 | [Product of Array Except Self](https://github.com/wislertt/leetcode-py/blob/main/leetcode/product_of_array_except_self/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/product_of_array_except_self/solution.py) | | 242 | [Valid Anagram](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_anagram/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_anagram/solution.py) | | 252 | [Meeting Rooms](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms/solution.py) | | 253 | [Meeting Rooms II](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms_ii/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms_ii/solution.py) | | 261 | [Graph Valid Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/graph_valid_tree/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/graph_valid_tree/solution.py) | | 268 | [Missing Number](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_number/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_number/solution.py) | | 269 | [Alien Dictionary](https://github.com/wislertt/leetcode-py/blob/main/leetcode/alien_dictionary/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/alien_dictionary/solution.py) | | 271 | [Encode and Decode Strings](https://github.com/wislertt/leetcode-py/blob/main/leetcode/encode_and_decode_strings/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/encode_and_decode_strings/solution.py) | | 295 | [Find Median from Data Stream](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_median_from_data_stream/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_median_from_data_stream/solution.py) | | 297 | [Serialize and Deserialize Binary Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/serialize_and_deserialize_binary_tree/README.md) | Hard | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/serialize_and_deserialize_binary_tree/solution.py) | | 300 | [Longest Increasing Subsequence](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_increasing_subsequence/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_increasing_subsequence/solution.py) | | 322 | [Coin Change](https://github.com/wislertt/leetcode-py/blob/main/leetcode/coin_change/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/coin_change/solution.py) | | 323 | [Number of Connected Components in an Undirected Graph](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_connected_components_in_an_undirected_graph/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_connected_components_in_an_undirected_graph/solution.py) | | 338 | [Counting Bits](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_bits/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_bits/solution.py) | | 347 | [Top K Frequent Elements](https://github.com/wislertt/leetcode-py/blob/main/leetcode/top_k_frequent_elements/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/top_k_frequent_elements/solution.py) | | 371 | [Sum of Two Integers](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_two_integers/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_two_integers/solution.py) | | 417 | [Pacific Atlantic Water Flow](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pacific_atlantic_water_flow/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/pacific_atlantic_water_flow/solution.py) | | 424 | [Longest Repeating Character Replacement](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_repeating_character_replacement/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_repeating_character_replacement/solution.py) | | 435 | [Non-overlapping Intervals](https://github.com/wislertt/leetcode-py/blob/main/leetcode/non_overlapping_intervals/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/non_overlapping_intervals/solution.py) | | 572 | [Subtree of Another Tree](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subtree_of_another_tree/README.md) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/subtree_of_another_tree/solution.py) | | 647 | [Palindromic Substrings](https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindromic_substrings/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindromic_substrings/solution.py) | | 1143 | [Longest Common Subsequence](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_common_subsequence/README.md) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_common_subsequence/solution.py) |