Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/zhuifengshen/awesome-leetcode

LeetCode Efficient Training Guide!
https://github.com/zhuifengshen/awesome-leetcode
List: awesome-leetcode
algorithm awesome leetcode
Last synced: 16 days ago
JSON representation
LeetCode Efficient Training Guide!
Host: GitHub
URL: https://github.com/zhuifengshen/awesome-leetcode
Owner: zhuifengshen
License: gpl-3.0
Created: 2019-05-21T03:53:44.000Z (over 5 years ago)
Default Branch: master
Last Pushed: 2023-06-11T13:43:50.000Z (over 1 year ago)
Last Synced: 2024-10-22T07:41:12.095Z (2 months ago)
Topics: algorithm, awesome, leetcode
Language: Python
Homepage:
Size: 21.2 MB
Stars: 14
Watchers: 1
Forks: 8
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

ultimate-awesome - awesome-leetcode - LeetCode Efficient Training Guide!. (Other Lists / Monkey C Lists)
README

        
LeetCode高效训练指南




     

     

          



## Contents

1. [Leetcode Solutions](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Leetcode_Solutions)

    - [Python](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Leetcode_Solutions/Python)

    - [Java](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Leetcode_Solutions/Java)

    - [JavaScript](https://github.com/apachecn/awesome-algorithm/tree/master/docs/Leetcode_Solutions/JavaScript)

    - [C++](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Leetcode_Solutions/C++)

    - [ipynb](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Leetcode_Solutions/ipynb)

2. [剑指 Offer](https://github.com/apachecn/awesome-algorithm/tree/master/docs/%E5%89%91%E6%8C%87offer)

    - [Python](https://github.com/apachecn/awesome-algorithm/tree/master/docs/剑指offer/Python)

    - [Java](https://github.com/apachecn/awesome-algorithm/tree/master/docs/剑指offer/Java)

    - [JavaScript](https://github.com/apachecn/awesome-algorithm/tree/master/docs/剑指offer/JavaScript)

    - [C++](https://github.com/apachecn/awesome-algorithm/tree/master/docs/剑指offer/C++)

2. [Algorithm Implementation](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Algorithm_Implementation)

    - [Python](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Algorithm_Implementation/Python)

    - [Java](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Algorithm_Implementation/Java)

    - [JavaScript](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Algorithm_Implementation/JavaScript)

    - [C++](https://github.com/apachecn/awesome-leetcode/tree/master/docs/Algorithm_Implementation/C++)

    

    

## Useful Links

- [结构化算法刷题训练指南](https://xiaozhuanlan.com/Lisanaaa)

- [编程之法：面试和算法心得](https://wizardforcel.gitbooks.io/the-art-of-programming-by-july/content/index.html)

- [kamyu104的Github](https://github.com/kamyu104/LeetCode-Solutions)

- [数据结构与算法/leetcode/lintcode题解](https://algorithm.yuanbin.me/zh-hans/)

- [看云文档：数据结构与算法](https://www.kancloud.cn/kancloud/data-structure-and-algorithm-notes/73048)

- [visualgo算法可视化网站](https://visualgo.net/en)

- [Data Structure Visualization](https://www.cs.usfca.edu/~galles/visualization/Algorithms.html)

- [HiredInTech System Design](https://www.hiredintech.com/)

- [mitcc的Github](https://github.com/mitcc/AlgoSolutions)

- [小土刀的面试刷题笔记](http://wdxtub.com/interview/14520594642530.html)

- [nonstriater/Learn-Algorithms](https://github.com/nonstriater/Learn-Algorithms)

- [剑指 Offer 题解](https://github.com/gatieme/CodingInterviews)

- https://github.com/liuchuo/LeetCode

- [公瑾的Github](https://github.com/yuzhoujr/leetcode)

- [shejie1993](https://shenjie1993.gitbooks.io/leetcode-python/content/096%20Unique%20Binary%20Search%20Trees.html)

- [算法/NLP/深度学习/机器学习面试笔记](https://github.com/imhuay/Interview_Notes-Chinese)

- [CS-Notes](https://github.com/CyC2018/CS-Notes)

- [OI Wiki](https://oi-wiki.org)

- [leetcode-in-go](https://github.com/aQuaYi/LeetCode-in-Go#leetcode-%E7%9A%84-go-%E8%A7%A3%E7%AD%94)

- [Algorithm Archive](https://github.com/algorithm-archivists/algorithm-archive)

- [Grokking the System Design Interview](https://www.educative.io/collection/5668639101419520/5649050225344512)

- [算法珠玑](https://soulmachine.gitbooks.io/algorithm-essentials/java/)

- [AlgoCasts 用心做好每一个算法视频](https://algocasts.io)

- [awesome-golang-leetcode](https://github.com/kylesliu/awesome-golang-leetcode)

## Pull Request

If you feel your PR is satisfied with one of the conditions below, we are glad to merge it. Welcome to contributions, open to suggestions!

- Different thinking

- Time & Space complexity optimization

- Follow up solutions

- Unsubmitted questions

Feel free to get our [Pull Request template/模版](https://github.com/apachecn/awesome-leetcode/blob/master/PULL_REQUEST_TEMPLATE.md)

- **Title format(文件命名格式): xxx._word1_word2_word3_word4.md**

- **Content format(内容规范): boilerplate + ideas**

## Acknowledgement

> Please note, this repository is based on [awesome algorithm](https://github.com/apachecn/awesome-algorithm) . However, it has been modified, added and improved to reflect our knowledge, wisdom and efforts.

## License

GPL-3.0 © [ApacheCN](https://github.com/apachecn)

> **欢迎任何人参与和完善：一个人可以走的很快，但是一群人却可以走的更远！**

## Appendix：LeetCode Solution List（Python）

- [0001._two_sum](./docs/Leetcode_Solutions/Python/0001._two_sum.md)

- [0002._add_two_numbers](./docs/Leetcode_Solutions/Python/0002._add_two_numbers.md)

- [0003._longest_substring_without_repeating_characters](./docs/Leetcode_Solutions/Python/0003._longest_substring_without_repeating_characters.md)

- [0004._median_of_two_sorted_arrays](./docs/Leetcode_Solutions/Python/0004._median_of_two_sorted_arrays.md)

- [0005._longest_palindromic_substring](./docs/Leetcode_Solutions/Python/0005._longest_palindromic_substring.md)

- [0006._ZigZag_Conversion](./docs/Leetcode_Solutions/Python/0006._ZigZag_Conversion.md)

- [0007._Reverse_Integer](./docs/Leetcode_Solutions/Python/0007._Reverse_Integer.md)

- [0008._string_to_integer_(atoi)](./docs/Leetcode_Solutions/Python/0008._string_to_integer_(atoi).md)

- [0009._Palindrome_Number](./docs/Leetcode_Solutions/Python/0009._Palindrome_Number.md)

- [0010._regular_expression_matching](./docs/Leetcode_Solutions/Python/0010._regular_expression_matching.md)

- [0011._container_with_most_water](./docs/Leetcode_Solutions/Python/0011._container_with_most_water.md)

- [0012._Integer_to_Roman](./docs/Leetcode_Solutions/Python/0012._Integer_to_Roman.md)

- [0013._Roman_to_Integer](./docs/Leetcode_Solutions/Python/0013._Roman_to_Integer.md)

- [0014._longest_common_prefix](./docs/Leetcode_Solutions/Python/0014._longest_common_prefix.md)

- [0015._3sum](./docs/Leetcode_Solutions/Python/0015._3sum.md)

- [0016._3sum_closest](./docs/Leetcode_Solutions/Python/0016._3sum_closest.md)

- [0017._letter_combinations_of_a_phone_number](./docs/Leetcode_Solutions/Python/0017._letter_combinations_of_a_phone_number.md)

- [0018._4sum](./docs/Leetcode_Solutions/Python/0018._4sum.md)

- [0019._remove_nth_node_from_end_of_list](./docs/Leetcode_Solutions/Python/0019._remove_nth_node_from_end_of_list.md)

- [0020._valid_parentheses](./docs/Leetcode_Solutions/Python/0020._valid_parentheses.md)

- [0021._merge_two_sorted_lists](./docs/Leetcode_Solutions/Python/0021._merge_two_sorted_lists.md)

- [0022._generate_parentheses](./docs/Leetcode_Solutions/Python/0022._generate_parentheses.md)

- [0023._merge_k_sorted_lists](./docs/Leetcode_Solutions/Python/0023._merge_k_sorted_lists.md)

- [0024._swap_nodes_in_pairs](./docs/Leetcode_Solutions/Python/0024._swap_nodes_in_pairs.md)

- [0025._Reverse_Nodes_in_k-Group](./docs/Leetcode_Solutions/Python/0025._Reverse_Nodes_in_k-Group.md)

- [0026._Remove_Duplicates_from_Sorted_Array](./docs/Leetcode_Solutions/Python/0026._Remove_Duplicates_from_Sorted_Array.md)

- [0027._Remove_Element](./docs/Leetcode_Solutions/Python/0027._Remove_Element.md)

- [0028._implement_strstr()](./docs/Leetcode_Solutions/Python/0028._implement_strstr().md)

- [0029._Divide_Two_Integers](./docs/Leetcode_Solutions/Python/0029._Divide_Two_Integers.md)

- [0030._Substring_with_Concatenation_of_All_Words](./docs/Leetcode_Solutions/Python/0030._Substring_with_Concatenation_of_All_Words.md)

- [0031._next_permutation](./docs/Leetcode_Solutions/Python/0031._next_permutation.md)

- [0032._longest_valid_parentheses](./docs/Leetcode_Solutions/Python/0032._longest_valid_parentheses.md)

- [0033._search_in_rotated_sorted_array](./docs/Leetcode_Solutions/Python/0033._search_in_rotated_sorted_array.md)

- [0034._Search_for_a_Range](./docs/Leetcode_Solutions/Python/0034._Search_for_a_Range.md)

- [0035._search_insert_position](./docs/Leetcode_Solutions/Python/0035._search_insert_position.md)

- [0036._Valid_Sudoku](./docs/Leetcode_Solutions/Python/0036._Valid_Sudoku.md)

- [0037._Sudoku_Solver](./docs/Leetcode_Solutions/Python/0037._Sudoku_Solver.md)

- [0038._Count_and_Say](./docs/Leetcode_Solutions/Python/0038._Count_and_Say.md)

- [0039._combination_sum](./docs/Leetcode_Solutions/Python/0039._combination_sum.md)

- [0040._combination_sum_ii](./docs/Leetcode_Solutions/Python/0040._combination_sum_ii.md)

- [0041._First_Missing_Positive](./docs/Leetcode_Solutions/Python/0041._First_Missing_Positive.md)

- [0042._trapping_rain_water](./docs/Leetcode_Solutions/Python/0042._trapping_rain_water.md)

- [0043._multiply_strings](./docs/Leetcode_Solutions/Python/0043._multiply_strings.md)

- [0044._wildcard_matching](./docs/Leetcode_Solutions/Python/0044._wildcard_matching.md)

- [0045._Jump_Game_II](./docs/Leetcode_Solutions/Python/0045._Jump_Game_II.md)

- [0046._permutations](./docs/Leetcode_Solutions/Python/0046._permutations.md)

- [0047._permutations_ii](./docs/Leetcode_Solutions/Python/0047._permutations_ii.md)

- [0048._rotate_image](./docs/Leetcode_Solutions/Python/0048._rotate_image.md)

- [0049._group_anagrams](./docs/Leetcode_Solutions/Python/0049._group_anagrams.md)

- [0050._pow(x,_n)](./docs/Leetcode_Solutions/Python/0050._pow(x,_n).md)

- [0051._n-queens](./docs/Leetcode_Solutions/Python/0051._n-queens.md)

- [0052._n-queens_ii](./docs/Leetcode_Solutions/Python/0052._n-queens_ii.md)

- [0053._maximum_subarray](./docs/Leetcode_Solutions/Python/0053._maximum_subarray.md)

- [0054._spiral_matrix](./docs/Leetcode_Solutions/Python/0054._spiral_matrix.md)

- [0055._jump_game](./docs/Leetcode_Solutions/Python/0055._jump_game.md)

- [0056._Merge_Intervals](./docs/Leetcode_Solutions/Python/0056._Merge_Intervals.md)

- [0057._Insert_Interval](./docs/Leetcode_Solutions/Python/0057._Insert_Interval.md)

- [0058._length_of_last_word](./docs/Leetcode_Solutions/Python/0058._length_of_last_word.md)

- [0059._spiral_matrix_ii](./docs/Leetcode_Solutions/Python/0059._spiral_matrix_ii.md)

- [0060._permutation_sequence](./docs/Leetcode_Solutions/Python/0060._permutation_sequence.md)

- [0061._rotate_list](./docs/Leetcode_Solutions/Python/0061._rotate_list.md)

- [0062._unique_paths](./docs/Leetcode_Solutions/Python/0062._unique_paths.md)

- [0063._unique_paths_ii](./docs/Leetcode_Solutions/Python/0063._unique_paths_ii.md)

- [0064._minimum_path_sum](./docs/Leetcode_Solutions/Python/0064._minimum_path_sum.md)

- [0065._Valid_Number](./docs/Leetcode_Solutions/Python/0065._Valid_Number.md)

- [0066._plus_one](./docs/Leetcode_Solutions/Python/0066._plus_one.md)

- [0067._add_binary](./docs/Leetcode_Solutions/Python/0067._add_binary.md)

- [0068._Text_Justification](./docs/Leetcode_Solutions/Python/0068._Text_Justification.md)

- [0069._sqrt(x)](./docs/Leetcode_Solutions/Python/0069._sqrt(x).md)

- [0070._Climbing_Stairs](./docs/Leetcode_Solutions/Python/0070._Climbing_Stairs.md)

- [0071._simplify_path](./docs/Leetcode_Solutions/Python/0071._simplify_path.md)

- [0072._edit_distance](./docs/Leetcode_Solutions/Python/0072._edit_distance.md)

- [0073._Set_Matrix_Zeroes](./docs/Leetcode_Solutions/Python/0073._Set_Matrix_Zeroes.md)

- [0074._search_a_2d_matrix](./docs/Leetcode_Solutions/Python/0074._search_a_2d_matrix.md)

- [0075._sort_colors](./docs/Leetcode_Solutions/Python/0075._sort_colors.md)

- [0076._Minimum_Window_Substring](./docs/Leetcode_Solutions/Python/0076._Minimum_Window_Substring.md)

- [0077._combinations](./docs/Leetcode_Solutions/Python/0077._combinations.md)

- [0078._Subsets](./docs/Leetcode_Solutions/Python/0078._Subsets.md)

- [0079._word_search](./docs/Leetcode_Solutions/Python/0079._word_search.md)

- [0080._remove_duplicates_from_sorted_array_ii](./docs/Leetcode_Solutions/Python/0080._remove_duplicates_from_sorted_array_ii.md)

- [0081._Search_in_Rotated_Sorted_Array_II](./docs/Leetcode_Solutions/Python/0081._Search_in_Rotated_Sorted_Array_II.md)

- [0082._remove_duplicates_from_sorted_list_ii](./docs/Leetcode_Solutions/Python/0082._remove_duplicates_from_sorted_list_ii.md)

- [0083._remove_duplicates_from_sorted_list](./docs/Leetcode_Solutions/Python/0083._remove_duplicates_from_sorted_list.md)

- [0084._Largest_Rectangle_in_Histogram](./docs/Leetcode_Solutions/Python/0084._Largest_Rectangle_in_Histogram.md)

- [0085._Maximal_Rectangle](./docs/Leetcode_Solutions/Python/0085._Maximal_Rectangle.md)

- [0086._partition_list](./docs/Leetcode_Solutions/Python/0086._partition_list.md)

- [0087._Scramble_String](./docs/Leetcode_Solutions/Python/0087._Scramble_String.md)

- [0088._merge_sorted_array](./docs/Leetcode_Solutions/Python/0088._merge_sorted_array.md)

- [0089._gray_code](./docs/Leetcode_Solutions/Python/0089._gray_code.md)

- [0090._subsets_ii](./docs/Leetcode_Solutions/Python/0090._subsets_ii.md)

- [0091._decode_ways](./docs/Leetcode_Solutions/Python/0091._decode_ways.md)

- [0092._reverse_linked_list_ii](./docs/Leetcode_Solutions/Python/0092._reverse_linked_list_ii.md)

- [0093._restore_ip_addresses](./docs/Leetcode_Solutions/Python/0093._restore_ip_addresses.md)

- [0094._binary_tree_inorder_traversal](./docs/Leetcode_Solutions/Python/0094._binary_tree_inorder_traversal.md)

- [0095._Unique_Binary_Search_Trees_II](./docs/Leetcode_Solutions/Python/0095._Unique_Binary_Search_Trees_II.md)

- [0096._unique_binary_search_trees](./docs/Leetcode_Solutions/Python/0096._unique_binary_search_trees.md)

- [0097._Interleaving_String](./docs/Leetcode_Solutions/Python/0097._Interleaving_String.md)

- [0098._validate_binary_search_tree](./docs/Leetcode_Solutions/Python/0098._validate_binary_search_tree.md)

- [0099._Recover_Binary_Search_Tree](./docs/Leetcode_Solutions/Python/0099._Recover_Binary_Search_Tree.md)

- [0100._same_tree](./docs/Leetcode_Solutions/Python/0100._same_tree.md)

- [0101._symmetric_tree](./docs/Leetcode_Solutions/Python/0101._symmetric_tree.md)

- [0102._binary_tree_level_order_traversal](./docs/Leetcode_Solutions/Python/0102._binary_tree_level_order_traversal.md)

- [0103._binary_tree_zigzag_level_order_traversal](./docs/Leetcode_Solutions/Python/0103._binary_tree_zigzag_level_order_traversal.md)

- [0104._maximum_depth_of_binary_tree](./docs/Leetcode_Solutions/Python/0104._maximum_depth_of_binary_tree.md)

- [0105._construct_binary_tree_from_preorder_and_inorder_traversal](./docs/Leetcode_Solutions/Python/0105._construct_binary_tree_from_preorder_and_inorder_traversal.md)

- [0106._construct_binary_tree_from_inorder_and_postorder_traversal](./docs/Leetcode_Solutions/Python/0106._construct_binary_tree_from_inorder_and_postorder_traversal.md)

- [0107._binary_tree_level_order_traversal_ii](./docs/Leetcode_Solutions/Python/0107._binary_tree_level_order_traversal_ii.md)

- [0108._convert_sorted_array_to_binary_search_tree](./docs/Leetcode_Solutions/Python/0108._convert_sorted_array_to_binary_search_tree.md)

- [0109._convert_sorted_list_to_binary_search_tree](./docs/Leetcode_Solutions/Python/0109._convert_sorted_list_to_binary_search_tree.md)

- [0110._balanced_binary_tree](./docs/Leetcode_Solutions/Python/0110._balanced_binary_tree.md)

- [0111._minimum_depth_of_binary_tree](./docs/Leetcode_Solutions/Python/0111._minimum_depth_of_binary_tree.md)

- [0112._path_sum](./docs/Leetcode_Solutions/Python/0112._path_sum.md)

- [0113._path_sum_ii](./docs/Leetcode_Solutions/Python/0113._path_sum_ii.md)

- [0114._flatten_binary_tree_to_linked_list](./docs/Leetcode_Solutions/Python/0114._flatten_binary_tree_to_linked_list.md)

- [0115._Distinct_Subsequences](./docs/Leetcode_Solutions/Python/0115._Distinct_Subsequences.md)

- [0116._populating_next_right_pointers_in_each_node](./docs/Leetcode_Solutions/Python/0116._populating_next_right_pointers_in_each_node.md)

- [0117._Populating_Next_Right_Pointers_in_Each_Node_II](./docs/Leetcode_Solutions/Python/0117._Populating_Next_Right_Pointers_in_Each_Node_II.md)

- [0118._pascal's_triangle](./docs/Leetcode_Solutions/Python/0118._pascal's_triangle.md)

- [0119._Pascal's_Triangle_II](./docs/Leetcode_Solutions/Python/0119._Pascal's_Triangle_II.md)

- [0120._Triangle](./docs/Leetcode_Solutions/Python/0120._Triangle.md)

- [0121._Best_Time_to_Buy_and_Sell_Stock](./docs/Leetcode_Solutions/Python/0121._Best_Time_to_Buy_and_Sell_Stock.md)

- [0122._Best_Time_to_Buy_and_Sell_Stock_II](./docs/Leetcode_Solutions/Python/0122._Best_Time_to_Buy_and_Sell_Stock_II.md)

- [0123._Best_Time_to_Buy_and_Sell_Stock_III](./docs/Leetcode_Solutions/Python/0123._Best_Time_to_Buy_and_Sell_Stock_III.md)

- [0124._Binary_Tree_Maximum_Path_Sum](./docs/Leetcode_Solutions/Python/0124._Binary_Tree_Maximum_Path_Sum.md)

- [0125._valid_palindrome](./docs/Leetcode_Solutions/Python/0125._valid_palindrome.md)

- [0126._Word_Ladder_II](./docs/Leetcode_Solutions/Python/0126._Word_Ladder_II.md)

- [0127._word_ladder](./docs/Leetcode_Solutions/Python/0127._word_ladder.md)

- [0128._Longest_Consecutive_Sequence](./docs/Leetcode_Solutions/Python/0128._Longest_Consecutive_Sequence.md)

- [0129._sum_root_to_leaf_numbers](./docs/Leetcode_Solutions/Python/0129._sum_root_to_leaf_numbers.md)

- [0130._surrounded_regions](./docs/Leetcode_Solutions/Python/0130._surrounded_regions.md)

- [0131._palindrome_partitioning](./docs/Leetcode_Solutions/Python/0131._palindrome_partitioning.md)

- [0132._Palindrome_Partitioning_II](./docs/Leetcode_Solutions/Python/0132._Palindrome_Partitioning_II.md)

- [0133._clone_graph](./docs/Leetcode_Solutions/Python/0133._clone_graph.md)

- [0134._Gas_Station](./docs/Leetcode_Solutions/Python/0134._Gas_Station.md)

- [0135._Candy](./docs/Leetcode_Solutions/Python/0135._Candy.md)

- [0136._single_number](./docs/Leetcode_Solutions/Python/0136._single_number.md)

- [0137._Single_Number_II](./docs/Leetcode_Solutions/Python/0137._Single_Number_II.md)

- [0138._Copy_List_with_Random_Pointer](./docs/Leetcode_Solutions/Python/0138._Copy_List_with_Random_Pointer.md)

- [0139._word_break](./docs/Leetcode_Solutions/Python/0139._word_break.md)

- [0140._word_break_ii](./docs/Leetcode_Solutions/Python/0140._word_break_ii.md)

- [0141._linked_list_cycle](./docs/Leetcode_Solutions/Python/0141._linked_list_cycle.md)

- [0142_Linked_List_Cycle_II](./docs/Leetcode_Solutions/Python/0142_Linked_List_Cycle_II.md)

- [0143._reorder_list](./docs/Leetcode_Solutions/Python/0143._reorder_list.md)

- [0144._binary_tree_preorder_traversal](./docs/Leetcode_Solutions/Python/0144._binary_tree_preorder_traversal.md)

- [0145._binary_tree_postorder_traversal](./docs/Leetcode_Solutions/Python/0145._binary_tree_postorder_traversal.md)

- [0146._LRU_Cache](./docs/Leetcode_Solutions/Python/0146._LRU_Cache.md)

- [0147._insertion_sort_list](./docs/Leetcode_Solutions/Python/0147._insertion_sort_list.md)

- [0148._sort_list](./docs/Leetcode_Solutions/Python/0148._sort_list.md)

- [0149._Max_Points_on_a_Line](./docs/Leetcode_Solutions/Python/0149._Max_Points_on_a_Line.md)

- [0150._evaluate_reverse_polish_notation](./docs/Leetcode_Solutions/Python/0150._evaluate_reverse_polish_notation.md)

- [0151._reverse_words_in_a_string](./docs/Leetcode_Solutions/Python/0151._reverse_words_in_a_string.md)

- [0152._maximum_product_subarray](./docs/Leetcode_Solutions/Python/0152._maximum_product_subarray.md)

- [0153._find_minimum_in_rotated_sorted_array](./docs/Leetcode_Solutions/Python/0153._find_minimum_in_rotated_sorted_array.md)

- [0154._Find_Minimum_in_Rotated_Sorted_Array_II](./docs/Leetcode_Solutions/Python/0154._Find_Minimum_in_Rotated_Sorted_Array_II.md)

- [0155._min_stack](./docs/Leetcode_Solutions/Python/0155._min_stack.md)

- [0156._Binary_Tree_Upside_Down](./docs/Leetcode_Solutions/Python/0156._Binary_Tree_Upside_Down.md)

- [0157._Read_N_Characters_Given_Read4](./docs/Leetcode_Solutions/Python/0157._Read_N_Characters_Given_Read4.md)

- [0158._Read_N_Characters_Given_Read4_II_-_Call_multiple_times](./docs/Leetcode_Solutions/Python/0158._Read_N_Characters_Given_Read4_II_-_Call_multiple_times.md)

- [0159._Longest_Substring_with_At_Most_Two_Distinct_Characters](./docs/Leetcode_Solutions/Python/0159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md)

- [0160._intersection_of_two_linked_lists](./docs/Leetcode_Solutions/Python/0160._intersection_of_two_linked_lists.md)

- [0161._One_Edit_Distance](./docs/Leetcode_Solutions/Python/0161._One_Edit_Distance.md)

- [0162._find_peak_element](./docs/Leetcode_Solutions/Python/0162._find_peak_element.md)

- [0163._Missing_Ranges](./docs/Leetcode_Solutions/Python/0163._Missing_Ranges.md)

- [0165._compare_version_numbers](./docs/Leetcode_Solutions/Python/0165._compare_version_numbers.md)

- [0166._Fraction_to_Recurring_Decimal](./docs/Leetcode_Solutions/Python/0166._Fraction_to_Recurring_Decimal.md)

- [0167._two_sum_ii_-_input_array_is_sorted](./docs/Leetcode_Solutions/Python/0167._two_sum_ii_-_input_array_is_sorted.md)

- [0168._excel_sheet_column_title](./docs/Leetcode_Solutions/Python/0168._excel_sheet_column_title.md)

- [0169._majority_element](./docs/Leetcode_Solutions/Python/0169._majority_element.md)

- [0170._Two_Sum_III_-_Data_structure_design](./docs/Leetcode_Solutions/Python/0170._Two_Sum_III_-_Data_structure_design.md)

- [0171._excel_sheet_column_number](./docs/Leetcode_Solutions/Python/0171._excel_sheet_column_number.md)

- [0172._Factorial_Trailing_Zeroes](./docs/Leetcode_Solutions/Python/0172._Factorial_Trailing_Zeroes.md)

- [0173._binary_search_tree_iterator](./docs/Leetcode_Solutions/Python/0173._binary_search_tree_iterator.md)

- [0174._dungeon_game](./docs/Leetcode_Solutions/Python/0174._dungeon_game.md)

- [0176._Second_Highest_Salary](./docs/Leetcode_Solutions/Python/0176._Second_Highest_Salary.md)

- [0177._Nth_Highest_Salary](./docs/Leetcode_Solutions/Python/0177._Nth_Highest_Salary.md)

- [0178._Rank_Scores](./docs/Leetcode_Solutions/Python/0178._Rank_Scores.md)

- [0179._Largest_Number](./docs/Leetcode_Solutions/Python/0179._Largest_Number.md)

- [0180._Consecutive_Numbers](./docs/Leetcode_Solutions/Python/0180._Consecutive_Numbers.md)

- [0182._duplicate_emails](./docs/Leetcode_Solutions/Python/0182._duplicate_emails.md)

- [0183._Customers_Who_Never_Order](./docs/Leetcode_Solutions/Python/0183._Customers_Who_Never_Order.md)

- [0184._Department_Highest_Salary](./docs/Leetcode_Solutions/Python/0184._Department_Highest_Salary.md)

- [0186._Reverse_Words_in_a_String_II](./docs/Leetcode_Solutions/Python/0186._Reverse_Words_in_a_String_II.md)

- [0187._Repeated_DNA_Sequences](./docs/Leetcode_Solutions/Python/0187._Repeated_DNA_Sequences.md)

- [0188._Best_Time_to_Buy_and_Sell_Stock_IV](./docs/Leetcode_Solutions/Python/0188._Best_Time_to_Buy_and_Sell_Stock_IV.md)

- [0189._rotate_array](./docs/Leetcode_Solutions/Python/0189._rotate_array.md)

- [0190._Reverse_Bits](./docs/Leetcode_Solutions/Python/0190._Reverse_Bits.md)

- [0191._number_of_1_bits](./docs/Leetcode_Solutions/Python/0191._number_of_1_bits.md)

- [0192._Word_Frequency](./docs/Leetcode_Solutions/Python/0192._Word_Frequency.md)

- [0194._Transpose_File](./docs/Leetcode_Solutions/Python/0194._Transpose_File.md)

- [0196._Delete_Duplicate_Emails](./docs/Leetcode_Solutions/Python/0196._Delete_Duplicate_Emails.md)

- [0198._house_robber](./docs/Leetcode_Solutions/Python/0198._house_robber.md)

- [0199._binary_tree_right_side_view](./docs/Leetcode_Solutions/Python/0199._binary_tree_right_side_view.md)

- [0200._number_of_islands](./docs/Leetcode_Solutions/Python/0200._number_of_islands.md)

- [0201._Bitwise_AND_of_Numbers_Range](./docs/Leetcode_Solutions/Python/0201._Bitwise_AND_of_Numbers_Range.md)

- [0202._Happy_Number](./docs/Leetcode_Solutions/Python/0202._Happy_Number.md)

- [0203._remove_linked_list_elements](./docs/Leetcode_Solutions/Python/0203._remove_linked_list_elements.md)

- [0204._count_primes](./docs/Leetcode_Solutions/Python/0204._count_primes.md)

- [0205._isomorphic_strings](./docs/Leetcode_Solutions/Python/0205._isomorphic_strings.md)

- [0206._reverse_linked_list](./docs/Leetcode_Solutions/Python/0206._reverse_linked_list.md)

- [0207._course_schedule](./docs/Leetcode_Solutions/Python/0207._course_schedule.md)

- [0208._implement_trie_(prefix_tree)](./docs/Leetcode_Solutions/Python/0208._implement_trie_(prefix_tree).md)

- [0209._Minimum_Size_Subarray_Sum](./docs/Leetcode_Solutions/Python/0209._Minimum_Size_Subarray_Sum.md)

- [0210._course_schedule_ii](./docs/Leetcode_Solutions/Python/0210._course_schedule_ii.md)

- [0211._Add_and_Search_Word_-_Data_structure_design](./docs/Leetcode_Solutions/Python/0211._Add_and_Search_Word_-_Data_structure_design.md)

- [0212._Word_Search_II](./docs/Leetcode_Solutions/Python/0212._Word_Search_II.md)

- [0213._house_robber_ii](./docs/Leetcode_Solutions/Python/0213._house_robber_ii.md)

- [0214._Shortest_Palindrome](./docs/Leetcode_Solutions/Python/0214._Shortest_Palindrome.md)

- [0215._Kth_Largest_Element_in_an_Array](./docs/Leetcode_Solutions/Python/0215._Kth_Largest_Element_in_an_Array.md)

- [0216._combination_sum_iii](./docs/Leetcode_Solutions/Python/0216._combination_sum_iii.md)

- [0217._contains_duplicate](./docs/Leetcode_Solutions/Python/0217._contains_duplicate.md)

- [0218._The_Skyline_Problem](./docs/Leetcode_Solutions/Python/0218._The_Skyline_Problem.md)

- [0219._contains_duplicate_ii](./docs/Leetcode_Solutions/Python/0219._contains_duplicate_ii.md)

- [0220._Contains_Duplicate_III](./docs/Leetcode_Solutions/Python/0220._Contains_Duplicate_III.md)

- [0221._maximal_square](./docs/Leetcode_Solutions/Python/0221._maximal_square.md)

- [0222._count_complete_tree_nodes](./docs/Leetcode_Solutions/Python/0222._count_complete_tree_nodes.md)

- [0223._rectangle_area](./docs/Leetcode_Solutions/Python/0223._rectangle_area.md)

- [0224._Basic_Calculator](./docs/Leetcode_Solutions/Python/0224._Basic_Calculator.md)

- [0225._implement_stack_using_queues](./docs/Leetcode_Solutions/Python/0225._implement_stack_using_queues.md)

- [0226._invert_binary_tree](./docs/Leetcode_Solutions/Python/0226._invert_binary_tree.md)

- [0227._basic_calculator_ii](./docs/Leetcode_Solutions/Python/0227._basic_calculator_ii.md)

- [0228._summary_ranges](./docs/Leetcode_Solutions/Python/0228._summary_ranges.md)

- [0229._majority_element_ii](./docs/Leetcode_Solutions/Python/0229._majority_element_ii.md)

- [0230._kth_smallest_element_in_a_bst](./docs/Leetcode_Solutions/Python/0230._kth_smallest_element_in_a_bst.md)

- [0231._Power_of_Two](./docs/Leetcode_Solutions/Python/0231._Power_of_Two.md)

- [0232._implement_queue_using_stacks](./docs/Leetcode_Solutions/Python/0232._implement_queue_using_stacks.md)

- [0234._palindrome_linked_list](./docs/Leetcode_Solutions/Python/0234._palindrome_linked_list.md)

- [0235._lowest_common_ancestor_of_a_binary_search_tree](./docs/Leetcode_Solutions/Python/0235._lowest_common_ancestor_of_a_binary_search_tree.md)

- [0236._lowest_common_ancestor_of_a_binary_tree](./docs/Leetcode_Solutions/Python/0236._lowest_common_ancestor_of_a_binary_tree.md)

- [0237._delete_node_in_a_linked_list](./docs/Leetcode_Solutions/Python/0237._delete_node_in_a_linked_list.md)

- [0238._product_of_array_except_self](./docs/Leetcode_Solutions/Python/0238._product_of_array_except_self.md)

- [0239._Sliding_Window_Maximum](./docs/Leetcode_Solutions/Python/0239._Sliding_Window_Maximum.md)

- [0240._search_a_2d_matrix_ii](./docs/Leetcode_Solutions/Python/0240._search_a_2d_matrix_ii.md)

- [0241._Different_Ways_to_Add_Parentheses](./docs/Leetcode_Solutions/Python/0241._Different_Ways_to_Add_Parentheses.md)

- [0242._valid_anagram](./docs/Leetcode_Solutions/Python/0242._valid_anagram.md)

- [0243._Shortest_Word_Distance](./docs/Leetcode_Solutions/Python/0243._Shortest_Word_Distance.md)

- [0244._Shortest_Word_Distance_II](./docs/Leetcode_Solutions/Python/0244._Shortest_Word_Distance_II.md)

- [0245._Shortest_Word_Distance_III](./docs/Leetcode_Solutions/Python/0245._Shortest_Word_Distance_III.md)

- [0247._Strobogrammatic_Number_II](./docs/Leetcode_Solutions/Python/0247._Strobogrammatic_Number_II.md)

- [0249._Group_Shifted_Strings](./docs/Leetcode_Solutions/Python/0249._Group_Shifted_Strings.md)

- [0250._Count_Univalue_Subtrees](./docs/Leetcode_Solutions/Python/0250._Count_Univalue_Subtrees.md)

- [0251._Flatten_2D_Vector](./docs/Leetcode_Solutions/Python/0251._Flatten_2D_Vector.md)

- [0252._Meeting_Rooms](./docs/Leetcode_Solutions/Python/0252._Meeting_Rooms.md)

- [0253._Meeting_Rooms_II](./docs/Leetcode_Solutions/Python/0253._Meeting_Rooms_II.md)

- [0254._Factor_Combinations](./docs/Leetcode_Solutions/Python/0254._Factor_Combinations.md)

- [0255._Verify_Preorder_Sequence_in_Binary_Search_Tree](./docs/Leetcode_Solutions/Python/0255._Verify_Preorder_Sequence_in_Binary_Search_Tree.md)

- [0256._Paint_House](./docs/Leetcode_Solutions/Python/0256._Paint_House.md)

- [0257._binary_tree_paths](./docs/Leetcode_Solutions/Python/0257._binary_tree_paths.md)

- [0258._Add_Digits](./docs/Leetcode_Solutions/Python/0258._Add_Digits.md)

- [0259._3Sum_Smaller](./docs/Leetcode_Solutions/Python/0259._3Sum_Smaller.md)

- [0260._Single_Number_III](./docs/Leetcode_Solutions/Python/0260._Single_Number_III.md)

- [0261._Graph_Valid_Tree](./docs/Leetcode_Solutions/Python/0261._Graph_Valid_Tree.md)

- [0263._ugly_number](./docs/Leetcode_Solutions/Python/0263._ugly_number.md)

- [0264._ugly_number_ii](./docs/Leetcode_Solutions/Python/0264._ugly_number_ii.md)

- [0265._Paint_House_II](./docs/Leetcode_Solutions/Python/0265._Paint_House_II.md)

- [0266._Palindrome_Permutation](./docs/Leetcode_Solutions/Python/0266._Palindrome_Permutation.md)

- [0267._Palindrome_Permutation_II](./docs/Leetcode_Solutions/Python/0267._Palindrome_Permutation_II.md)

- [0268._missing_number](./docs/Leetcode_Solutions/Python/0268._missing_number.md)

- [0269._Alien_Dictionary](./docs/Leetcode_Solutions/Python/0269._Alien_Dictionary.md)

- [0270._Closest_Binary_Search_Tree_Value](./docs/Leetcode_Solutions/Python/0270._Closest_Binary_Search_Tree_Value.md)

- [0276._Paint_Fence](./docs/Leetcode_Solutions/Python/0276._Paint_Fence.md)

- [0277._Find_the_Celebrity](./docs/Leetcode_Solutions/Python/0277._Find_the_Celebrity.md)

- [0278._First_Bad_Version](./docs/Leetcode_Solutions/Python/0278._First_Bad_Version.md)

- [0279._perfect_squares](./docs/Leetcode_Solutions/Python/0279._perfect_squares.md)

- [0280._Wiggle_Sort](./docs/Leetcode_Solutions/Python/0280._Wiggle_Sort.md)

- [0281._Zigzag_Iterator](./docs/Leetcode_Solutions/Python/0281._Zigzag_Iterator.md)

- [0282._Expression_Add_Operators](./docs/Leetcode_Solutions/Python/0282._Expression_Add_Operators.md)

- [0283._move_zeroes](./docs/Leetcode_Solutions/Python/0283._move_zeroes.md)

- [0285._inorder_successor_in_bst](./docs/Leetcode_Solutions/Python/0285._inorder_successor_in_bst.md)

- [0286._Walls_and_Gates](./docs/Leetcode_Solutions/Python/0286._Walls_and_Gates.md)

- [0287._Find_the_Duplicate_Number](./docs/Leetcode_Solutions/Python/0287._Find_the_Duplicate_Number.md)

- [0289._game_of_life](./docs/Leetcode_Solutions/Python/0289._game_of_life.md)

- [0290._word_pattern](./docs/Leetcode_Solutions/Python/0290._word_pattern.md)

- [0292._nim_game](./docs/Leetcode_Solutions/Python/0292._nim_game.md)

- [0293._Flip_Game](./docs/Leetcode_Solutions/Python/0293._Flip_Game.md)

- [0295._Find_Median_from_Data_Stream](./docs/Leetcode_Solutions/Python/0295._Find_Median_from_Data_Stream.md)

- [0296._Best_Meeting_Point](./docs/Leetcode_Solutions/Python/0296._Best_Meeting_Point.md)

- [0297._Serialize_and_Deserialize_Binary_Tree](./docs/Leetcode_Solutions/Python/0297._Serialize_and_Deserialize_Binary_Tree.md)

- [0298._Binary_Tree_Longest_Consecutive_Sequence](./docs/Leetcode_Solutions/Python/0298._Binary_Tree_Longest_Consecutive_Sequence.md)

- [0299._bulls_and_cows](./docs/Leetcode_Solutions/Python/0299._bulls_and_cows.md)

- [0300._longest_increasing_subsequence](./docs/Leetcode_Solutions/Python/0300._longest_increasing_subsequence.md)

- [0301._Remove_Invalid_Parentheses](./docs/Leetcode_Solutions/Python/0301._Remove_Invalid_Parentheses.md)

- [0303._range_sum_query_-_immutable](./docs/Leetcode_Solutions/Python/0303._range_sum_query_-_immutable.md)

- [0305._Number_of_Islands_II](./docs/Leetcode_Solutions/Python/0305._Number_of_Islands_II.md)

- [0307._Range_Sum_Query_-_Mutable](./docs/Leetcode_Solutions/Python/0307._Range_Sum_Query_-_Mutable.md)

- [0308._Range_Sum_Query_2D_-_Mutable](./docs/Leetcode_Solutions/Python/0308._Range_Sum_Query_2D_-_Mutable.md)

- [0309._Best_Time_to_Buy_and_Sell_Stock_with_Cooldown](./docs/Leetcode_Solutions/Python/0309._Best_Time_to_Buy_and_Sell_Stock_with_Cooldown.md)

- [0310._Minimum_Height_Trees](./docs/Leetcode_Solutions/Python/0310._Minimum_Height_Trees.md)

- [0311._Sparse_Matrix_Multiplication](./docs/Leetcode_Solutions/Python/0311._Sparse_Matrix_Multiplication.md)

- [0312._Burst_Balloons](./docs/Leetcode_Solutions/Python/0312._Burst_Balloons.md)

- [0313._Super_Ugly_Number](./docs/Leetcode_Solutions/Python/0313._Super_Ugly_Number.md)

- [0315._Count_of_Smaller_Numbers_After_Self](./docs/Leetcode_Solutions/Python/0315._Count_of_Smaller_Numbers_After_Self.md)

- [0316._Remove_Duplicate_Letters](./docs/Leetcode_Solutions/Python/0316._Remove_Duplicate_Letters.md)

- [0318._Maximum_Product_of_Word_Lengths](./docs/Leetcode_Solutions/Python/0318._Maximum_Product_of_Word_Lengths.md)

- [0319._Bulb_Switcher](./docs/Leetcode_Solutions/Python/0319._Bulb_Switcher.md)

- [0321._Create_Maximum_Number](./docs/Leetcode_Solutions/Python/0321._Create_Maximum_Number.md)

- [0322._Coin_Change](./docs/Leetcode_Solutions/Python/0322._Coin_Change.md)

- [0323._number_of_connected_components_in_an_undirected_graph](./docs/Leetcode_Solutions/Python/0323._number_of_connected_components_in_an_undirected_graph.md)

- [0324._Wiggle_Sort_II](./docs/Leetcode_Solutions/Python/0324._Wiggle_Sort_II.md)

- [0325._Maximum_Size_Subarray_Sum_Equals_k](./docs/Leetcode_Solutions/Python/0325._Maximum_Size_Subarray_Sum_Equals_k.md)

- [0326._power_of_three](./docs/Leetcode_Solutions/Python/0326._power_of_three.md)

- [0328._odd_even_linked_list](./docs/Leetcode_Solutions/Python/0328._odd_even_linked_list.md)

- [0329._Longest_Increasing_Path_in_a_Matrix](./docs/Leetcode_Solutions/Python/0329._Longest_Increasing_Path_in_a_Matrix.md)

- [0332._Reconstruct_Itinerary](./docs/Leetcode_Solutions/Python/0332._Reconstruct_Itinerary.md)

- [0334._increasing_triplet_subsequence](./docs/Leetcode_Solutions/Python/0334._increasing_triplet_subsequence.md)

- [0336._Palindrome_Pairs](./docs/Leetcode_Solutions/Python/0336._Palindrome_Pairs.md)

- [0337._house_robber_iii](./docs/Leetcode_Solutions/Python/0337._house_robber_iii.md)

- [0338._Counting_Bits](./docs/Leetcode_Solutions/Python/0338._Counting_Bits.md)

- [0339._Nested_List_Weight_Sum](./docs/Leetcode_Solutions/Python/0339._Nested_List_Weight_Sum.md)

- [0340._Longest_Substring_with_At_Most_K_Distinct_Characters](./docs/Leetcode_Solutions/Python/0340._Longest_Substring_with_At_Most_K_Distinct_Characters.md)

- [0341._Flatten_Nested_List_Iterator](./docs/Leetcode_Solutions/Python/0341._Flatten_Nested_List_Iterator.md)

- [0342._Power_of_Four](./docs/Leetcode_Solutions/Python/0342._Power_of_Four.md)

- [0343._Integer_Break](./docs/Leetcode_Solutions/Python/0343._Integer_Break.md)

- [0344._reverse_string](./docs/Leetcode_Solutions/Python/0344._reverse_string.md)

- [0345._Reverse_Vowels_of_a_String](./docs/Leetcode_Solutions/Python/0345._Reverse_Vowels_of_a_String.md)

- [0346._Moving_Average_from_Data_Stream](./docs/Leetcode_Solutions/Python/0346._Moving_Average_from_Data_Stream.md)

- [0347._Top_K_Frequent_Elements](./docs/Leetcode_Solutions/Python/0347._Top_K_Frequent_Elements.md)

- [0348._Design_Tic-Tac-Toe](./docs/Leetcode_Solutions/Python/0348._Design_Tic-Tac-Toe.md)

- [0349._intersection_of_two_arrays](./docs/Leetcode_Solutions/Python/0349._intersection_of_two_arrays.md)

- [0350._intersection_of_two_arrays_ii](./docs/Leetcode_Solutions/Python/0350._intersection_of_two_arrays_ii.md)

- [0353._Design_Snake_Game](./docs/Leetcode_Solutions/Python/0353._Design_Snake_Game.md)

- [0355._Design_Twitter](./docs/Leetcode_Solutions/Python/0355._Design_Twitter.md)

- [0359._Logger_Rate_Limiter](./docs/Leetcode_Solutions/Python/0359._Logger_Rate_Limiter.md)

- [0360._Sort_Transformed_Array](./docs/Leetcode_Solutions/Python/0360._Sort_Transformed_Array.md)

- [0361._Bomb_Enemy](./docs/Leetcode_Solutions/Python/0361._Bomb_Enemy.md)

- [0363._Max_Sum_of_Rectangle_No_Larger_Than_K](./docs/Leetcode_Solutions/Python/0363._Max_Sum_of_Rectangle_No_Larger_Than_K.md)

- [0364._Nested_List_Weight_Sum_II](./docs/Leetcode_Solutions/Python/0364._Nested_List_Weight_Sum_II.md)

- [0366._Find_Leaves_of_Binary_Tree](./docs/Leetcode_Solutions/Python/0366._Find_Leaves_of_Binary_Tree.md)

- [0367._valid_perfect_square](./docs/Leetcode_Solutions/Python/0367._valid_perfect_square.md)

- [0369._Plus_One_Linked_List](./docs/Leetcode_Solutions/Python/0369._Plus_One_Linked_List.md)

- [0370._Range_Addition](./docs/Leetcode_Solutions/Python/0370._Range_Addition.md)

- [0371._sum_of_two_integers](./docs/Leetcode_Solutions/Python/0371._sum_of_two_integers.md)

- [0372._Super_Pow](./docs/Leetcode_Solutions/Python/0372._Super_Pow.md)

- [0374._Guess_Number_Higher_or_Lower](./docs/Leetcode_Solutions/Python/0374._Guess_Number_Higher_or_Lower.md)

- [0376._Wiggle_Subsequence](./docs/Leetcode_Solutions/Python/0376._Wiggle_Subsequence.md)

- [0377._combination_sum_iv](./docs/Leetcode_Solutions/Python/0377._combination_sum_iv.md)

- [0378._kth_smallest_element_in_a_sorted_matrix](./docs/Leetcode_Solutions/Python/0378._kth_smallest_element_in_a_sorted_matrix.md)

- [0380._Insert_Delete_GetRandom_O(1)](./docs/Leetcode_Solutions/Python/0380._Insert_Delete_GetRandom_O(1).md)

- [0381._Insert_Delete_GetRandom_O(1)_-_Duplicates_allowed](./docs/Leetcode_Solutions/Python/0381._Insert_Delete_GetRandom_O(1)_-_Duplicates_allowed.md)

- [0382._linked_list_random_node](./docs/Leetcode_Solutions/Python/0382._linked_list_random_node.md)

- [0383._ransom_note](./docs/Leetcode_Solutions/Python/0383._ransom_note.md)

- [0384._Shuffle_an_Array](./docs/Leetcode_Solutions/Python/0384._Shuffle_an_Array.md)

- [0386._Lexicographical_Numbers](./docs/Leetcode_Solutions/Python/0386._Lexicographical_Numbers.md)

- [0387._first_unique_character_in_a_string](./docs/Leetcode_Solutions/Python/0387._first_unique_character_in_a_string.md)

- [0388._Longest_Absolute_File_Path](./docs/Leetcode_Solutions/Python/0388._Longest_Absolute_File_Path.md)

- [0389._find_the_difference](./docs/Leetcode_Solutions/Python/0389._find_the_difference.md)

- [0392._is_subsequence](./docs/Leetcode_Solutions/Python/0392._is_subsequence.md)

- [0394._decode_string](./docs/Leetcode_Solutions/Python/0394._decode_string.md)

- [0395._Longest_Substring_with_At_Least_K_Repeating_Characters](./docs/Leetcode_Solutions/Python/0395._Longest_Substring_with_At_Least_K_Repeating_Characters.md)

- [0397._Integer_Replacement](./docs/Leetcode_Solutions/Python/0397._Integer_Replacement.md)

- [0398._Random_Pick_Index](./docs/Leetcode_Solutions/Python/0398._Random_Pick_Index.md)

- [0400._Nth_Digit](./docs/Leetcode_Solutions/Python/0400._Nth_Digit.md)

- [0401._binary_watch](./docs/Leetcode_Solutions/Python/0401._binary_watch.md)

- [0402._Remove_K_Digits](./docs/Leetcode_Solutions/Python/0402._Remove_K_Digits.md)

- [0403._Frog_Jump](./docs/Leetcode_Solutions/Python/0403._Frog_Jump.md)

- [0404._sum_of_left_leaves](./docs/Leetcode_Solutions/Python/0404._sum_of_left_leaves.md)

- [0405._Convert_a_Number_to_Hexadecimal](./docs/Leetcode_Solutions/Python/0405._Convert_a_Number_to_Hexadecimal.md)

- [0406._Queue_Reconstruction_by_Height](./docs/Leetcode_Solutions/Python/0406._Queue_Reconstruction_by_Height.md)

- [0408._Valid_Word_Abbreviation](./docs/Leetcode_Solutions/Python/0408._Valid_Word_Abbreviation.md)

- [0409._Longest_Palindrome](./docs/Leetcode_Solutions/Python/0409._Longest_Palindrome.md)

- [0410._Split_Array_Largest_Sum](./docs/Leetcode_Solutions/Python/0410._Split_Array_Largest_Sum.md)

- [0412._fizz_buzz](./docs/Leetcode_Solutions/Python/0412._fizz_buzz.md)

- [0413._Arithmetic_Slices](./docs/Leetcode_Solutions/Python/0413._Arithmetic_Slices.md)

- [0414._third_maximum_number](./docs/Leetcode_Solutions/Python/0414._third_maximum_number.md)

- [0415._add_strings](./docs/Leetcode_Solutions/Python/0415._add_strings.md)

- [0416._Partition_Equal_Subset_Sum](./docs/Leetcode_Solutions/Python/0416._Partition_Equal_Subset_Sum.md)

- [0417._Pacific_Atlantic_Water_Flow](./docs/Leetcode_Solutions/Python/0417._Pacific_Atlantic_Water_Flow.md)

- [0421._Maximum_XOR_of_Two_Numbers_in_an_Array](./docs/Leetcode_Solutions/Python/0421._Maximum_XOR_of_Two_Numbers_in_an_Array.md)

- [0422._Valid_Word_Square](./docs/Leetcode_Solutions/Python/0422._Valid_Word_Square.md)

- [0424._Longest_Repeating_Character_Replacement](./docs/Leetcode_Solutions/Python/0424._Longest_Repeating_Character_Replacement.md)

- [0427._Construct_Quad_Tree](./docs/Leetcode_Solutions/Python/0427._Construct_Quad_Tree.md)

- [0429._N-ary_Tree_Level_Order_Traversal](./docs/Leetcode_Solutions/Python/0429._N-ary_Tree_Level_Order_Traversal.md)

- [0430._Flatten_a_Multilevel_Doubly_Linked_List](./docs/Leetcode_Solutions/Python/0430._Flatten_a_Multilevel_Doubly_Linked_List.md)

- [0433._Minimum_Genetic_Mutation](./docs/Leetcode_Solutions/Python/0433._Minimum_Genetic_Mutation.md)

- [0434._number_of_segments_in_a_string](./docs/Leetcode_Solutions/Python/0434._number_of_segments_in_a_string.md)

- [0435._Non-overlapping_Intervals](./docs/Leetcode_Solutions/Python/0435._Non-overlapping_Intervals.md)

- [0436._Find_Right_Interval](./docs/Leetcode_Solutions/Python/0436._Find_Right_Interval.md)

- [0437._path_sum_iii](./docs/Leetcode_Solutions/Python/0437._path_sum_iii.md)

- [0438._Find_All_Anagrams_in_a_String](./docs/Leetcode_Solutions/Python/0438._Find_All_Anagrams_in_a_String.md)

- [0439._Ternary_Expression_Parser](./docs/Leetcode_Solutions/Python/0439._Ternary_Expression_Parser.md)

- [0441._arranging_coins](./docs/Leetcode_Solutions/Python/0441._arranging_coins.md)

- [0442._Find_All_Duplicates_in_an_Array](./docs/Leetcode_Solutions/Python/0442._Find_All_Duplicates_in_an_Array.md)

- [0448._Find_All_Numbers_Disappeared_in_an_Array](./docs/Leetcode_Solutions/Python/0448._Find_All_Numbers_Disappeared_in_an_Array.md)

- [0450._Delete_Node_in_a_BST](./docs/Leetcode_Solutions/Python/0450._Delete_Node_in_a_BST.md)

- [0452._minimum_number_of_arrows_to_burst_balloons](./docs/Leetcode_Solutions/Python/0452._minimum_number_of_arrows_to_burst_balloons.md)

- [0453._Minimum_Moves_to_Equal_Array_Elements](./docs/Leetcode_Solutions/Python/0453._Minimum_Moves_to_Equal_Array_Elements.md)

- [0454._4Sum_II](./docs/Leetcode_Solutions/Python/0454._4Sum_II.md)

- [0457._Circular_Array_Loop](./docs/Leetcode_Solutions/Python/0457._Circular_Array_Loop.md)

- [0458._Poor_Pigs](./docs/Leetcode_Solutions/Python/0458._Poor_Pigs.md)

- [0459._Repeated_Substring_Pattern](./docs/Leetcode_Solutions/Python/0459._Repeated_Substring_Pattern.md)

- [0461._Hamming_Distance](./docs/Leetcode_Solutions/Python/0461._Hamming_Distance.md)

- [0463._Island_Perimeter](./docs/Leetcode_Solutions/Python/0463._Island_Perimeter.md)

- [0467._Unique_Substrings_in_Wraparound_String](./docs/Leetcode_Solutions/Python/0467._Unique_Substrings_in_Wraparound_String.md)

- [0469._Convex_Polygon](./docs/Leetcode_Solutions/Python/0469._Convex_Polygon.md)

- [0470._Implement_Rand10()_Using_Rand7()](./docs/Leetcode_Solutions/Python/0470._Implement_Rand10()_Using_Rand7().md)

- [0472._Concatenated_Words](./docs/Leetcode_Solutions/Python/0472._Concatenated_Words.md)

- [0475._Heaters](./docs/Leetcode_Solutions/Python/0475._Heaters.md)

- [0476._Number_Complement](./docs/Leetcode_Solutions/Python/0476._Number_Complement.md)

- [0477._Total_Hamming_Distance](./docs/Leetcode_Solutions/Python/0477._Total_Hamming_Distance.md)

- [0478._Generate_Random_Point_in_a_Circle](./docs/Leetcode_Solutions/Python/0478._Generate_Random_Point_in_a_Circle.md)

- [0482._License_Key_Formatting](./docs/Leetcode_Solutions/Python/0482._License_Key_Formatting.md)

- [0484._Find_Permutation](./docs/Leetcode_Solutions/Python/0484._Find_Permutation.md)

- [0485._Max_Consecutive_Ones](./docs/Leetcode_Solutions/Python/0485._Max_Consecutive_Ones.md)

- [0486._Predict_the_Winner](./docs/Leetcode_Solutions/Python/0486._Predict_the_Winner.md)

- [0490._The_Maze](./docs/Leetcode_Solutions/Python/0490._The_Maze.md)

- [0492._Construct_the_Rectangle](./docs/Leetcode_Solutions/Python/0492._Construct_the_Rectangle.md)

- [0494._Target_Sum](./docs/Leetcode_Solutions/Python/0494._Target_Sum.md)

- [0495._Teemo_Attacking](./docs/Leetcode_Solutions/Python/0495._Teemo_Attacking.md)

- [0496._Next_Greater_Element_I](./docs/Leetcode_Solutions/Python/0496._Next_Greater_Element_I.md)

- [0499._The_Maze_III](./docs/Leetcode_Solutions/Python/0499._The_Maze_III.md)

- [0500._Keyboard_Row](./docs/Leetcode_Solutions/Python/0500._Keyboard_Row.md)

- [0501._Find_Mode_in_Binary_Search_Tree](./docs/Leetcode_Solutions/Python/0501._Find_Mode_in_Binary_Search_Tree.md)

- [0504._Base_7](./docs/Leetcode_Solutions/Python/0504._Base_7.md)

- [0505._The_Maze_II](./docs/Leetcode_Solutions/Python/0505._The_Maze_II.md)

- [0507._Perfect_Number](./docs/Leetcode_Solutions/Python/0507._Perfect_Number.md)

- [0509._Fibonacci_Number](./docs/Leetcode_Solutions/Python/0509._Fibonacci_Number.md)

- [0513._Find_Bottom_Left_Tree_Value](./docs/Leetcode_Solutions/Python/0513._Find_Bottom_Left_Tree_Value.md)

- [0515._Find_Largest_Value_in_Each_Tree_Row](./docs/Leetcode_Solutions/Python/0515._Find_Largest_Value_in_Each_Tree_Row.md)

- [0516._Longest_Palindromic_Subsequence](./docs/Leetcode_Solutions/Python/0516._Longest_Palindromic_Subsequence.md)

- [0525._Contiguous_Array](./docs/Leetcode_Solutions/Python/0525._Contiguous_Array.md)

- [0526._Beautiful_Arrangement](./docs/Leetcode_Solutions/Python/0526._Beautiful_Arrangement.md)

- [0528._Random_Pick_with_Weight](./docs/Leetcode_Solutions/Python/0528._Random_Pick_with_Weight.md)

- [0530._Minimum_Absolute_Difference_in_BST](./docs/Leetcode_Solutions/Python/0530._Minimum_Absolute_Difference_in_BST.md)

- [0531._Lonely_Pixel_I](./docs/Leetcode_Solutions/Python/0531._Lonely_Pixel_I.md)

- [0532._K-diff_Pairs_in_an_Array](./docs/Leetcode_Solutions/Python/0532._K-diff_Pairs_in_an_Array.md)

- [0533._Lonely_Pixel_II](./docs/Leetcode_Solutions/Python/0533._Lonely_Pixel_II.md)

- [0535._Encode_and_Decode_TinyURL](./docs/Leetcode_Solutions/Python/0535._Encode_and_Decode_TinyURL.md)

- [0536._Construct_Binary_Tree_from_String](./docs/Leetcode_Solutions/Python/0536._Construct_Binary_Tree_from_String.md)

- [0538._Convert_BST_to_Greater_Tree](./docs/Leetcode_Solutions/Python/0538._Convert_BST_to_Greater_Tree.md)

- [0539._Minimum_Time_Difference](./docs/Leetcode_Solutions/Python/0539._Minimum_Time_Difference.md)

- [0540._Single_Element_in_a_Sorted_Array](./docs/Leetcode_Solutions/Python/0540._Single_Element_in_a_Sorted_Array.md)

- [0541._Reverse_String_II](./docs/Leetcode_Solutions/Python/0541._Reverse_String_II.md)

- [0543._Diameter_of_Binary_Tree](./docs/Leetcode_Solutions/Python/0543._Diameter_of_Binary_Tree.md)

- [0547._Friend_Circles](./docs/Leetcode_Solutions/Python/0547._Friend_Circles.md)

- [0548._Split_Array_with_Equal_Sum](./docs/Leetcode_Solutions/Python/0548._Split_Array_with_Equal_Sum.md)

- [0549._Binary_Tree_Longest_Consecutive_Sequence_II](./docs/Leetcode_Solutions/Python/0549._Binary_Tree_Longest_Consecutive_Sequence_II.md)

- [0551._Student_Attendance_Record_I](./docs/Leetcode_Solutions/Python/0551._Student_Attendance_Record_I.md)

- [0552._Student_Attendance_Record_II](./docs/Leetcode_Solutions/Python/0552._Student_Attendance_Record_II.md)

- [0558._Quad_Tree_Intersection](./docs/Leetcode_Solutions/Python/0558._Quad_Tree_Intersection.md)

- [0559._Maximum_Depth_of_N-ary_Tree](./docs/Leetcode_Solutions/Python/0559._Maximum_Depth_of_N-ary_Tree.md)

- [0560._Subarray_Sum_Equals_K](./docs/Leetcode_Solutions/Python/0560._Subarray_Sum_Equals_K.md)

- [0561._Array_Partition_I](./docs/Leetcode_Solutions/Python/0561._Array_Partition_I.md)

- [0562._Longest_Line_of_Consecutive_One_in_Matrix](./docs/Leetcode_Solutions/Python/0562._Longest_Line_of_Consecutive_One_in_Matrix.md)

- [0563._Binary_Tree_Tilt](./docs/Leetcode_Solutions/Python/0563._Binary_Tree_Tilt.md)

- [0564._Find_the_Closest_Palindrome](./docs/Leetcode_Solutions/Python/0564._Find_the_Closest_Palindrome.md)

- [0565._Array_Nesting](./docs/Leetcode_Solutions/Python/0565._Array_Nesting.md)

- [0566._Reshape_the_Matrix](./docs/Leetcode_Solutions/Python/0566._Reshape_the_Matrix.md)

- [0572._Subtree_of_Another_Tree](./docs/Leetcode_Solutions/Python/0572._Subtree_of_Another_Tree.md)

- [0575._Distribute_Candies](./docs/Leetcode_Solutions/Python/0575._Distribute_Candies.md)

- [0581._Shortest_Unsorted_Continuous_Subarray](./docs/Leetcode_Solutions/Python/0581._Shortest_Unsorted_Continuous_Subarray.md)

- [0583._Delete_Operation_for_Two_Strings](./docs/Leetcode_Solutions/Python/0583._Delete_Operation_for_Two_Strings.md)

- [0587._Erect_the_Fence](./docs/Leetcode_Solutions/Python/0587._Erect_the_Fence.md)

- [0589._N-ary_Tree_Preorder_Traversal](./docs/Leetcode_Solutions/Python/0589._N-ary_Tree_Preorder_Traversal.md)

- [0590._N-ary_Tree_Postorder_Traversal](./docs/Leetcode_Solutions/Python/0590._N-ary_Tree_Postorder_Traversal.md)

- [0592._Fraction_Addition_and_Subtraction](./docs/Leetcode_Solutions/Python/0592._Fraction_Addition_and_Subtraction.md)

- [0593._Valid_Square](./docs/Leetcode_Solutions/Python/0593._Valid_Square.md)

- [0594._Longest_Harmonious_Subsequence](./docs/Leetcode_Solutions/Python/0594._Longest_Harmonious_Subsequence.md)

- [0595._Big_Countries](./docs/Leetcode_Solutions/Python/0595._Big_Countries.md)

- [0599._Minimum_Index_Sum_of_Two_Lists](./docs/Leetcode_Solutions/Python/0599._Minimum_Index_Sum_of_Two_Lists.md)

- [0606._Construct_String_from_Binary_Tree](./docs/Leetcode_Solutions/Python/0606._Construct_String_from_Binary_Tree.md)

- [0609._Find_Duplicate_File_in_System](./docs/Leetcode_Solutions/Python/0609._Find_Duplicate_File_in_System.md)

- [0610._Triangle_Judgement](./docs/Leetcode_Solutions/Python/0610._Triangle_Judgement.md)

- [0611._Valid_Triangle_Number](./docs/Leetcode_Solutions/Python/0611._Valid_Triangle_Number.md)

- [0613._Shortest_Distance_in_a_Line](./docs/Leetcode_Solutions/Python/0613._Shortest_Distance_in_a_Line.md)

- [0617._Merge_Two_Binary_Trees](./docs/Leetcode_Solutions/Python/0617._Merge_Two_Binary_Trees.md)

- [0621._Task_Scheduler](./docs/Leetcode_Solutions/Python/0621._Task_Scheduler.md)

- [0622._Design_Circular_Queue](./docs/Leetcode_Solutions/Python/0622._Design_Circular_Queue.md)

- [0628._Maximum_Product_of_Three_Numbers](./docs/Leetcode_Solutions/Python/0628._Maximum_Product_of_Three_Numbers.md)

- [0630._Course_Schedule_III](./docs/Leetcode_Solutions/Python/0630._Course_Schedule_III.md)

- [0632._Smallest_Range](./docs/Leetcode_Solutions/Python/0632._Smallest_Range.md)

- [0633._Sum_of_Square_Numbers](./docs/Leetcode_Solutions/Python/0633._Sum_of_Square_Numbers.md)

- [0638._Shopping_Offers](./docs/Leetcode_Solutions/Python/0638._Shopping_Offers.md)

- [0640._Solve_the_Equation](./docs/Leetcode_Solutions/Python/0640._Solve_the_Equation.md)

- [0646._Maximum_Length_of_Pair_Chain](./docs/Leetcode_Solutions/Python/0646._Maximum_Length_of_Pair_Chain.md)

- [0647._Palindromic_Substrings](./docs/Leetcode_Solutions/Python/0647._Palindromic_Substrings.md)

- [0653._Two_Sum_IV_-_Input_is_a_BST](./docs/Leetcode_Solutions/Python/0653._Two_Sum_IV_-_Input_is_a_BST.md)

- [0654._Maximum_Binary_Tree](./docs/Leetcode_Solutions/Python/0654._Maximum_Binary_Tree.md)

- [0657._Judge_Route_Circle](./docs/Leetcode_Solutions/Python/0657._Judge_Route_Circle.md)

- [0660._Remove_9](./docs/Leetcode_Solutions/Python/0660._Remove_9.md)

- [0665._Non-decreasing_Array](./docs/Leetcode_Solutions/Python/0665._Non-decreasing_Array.md)

- [0667._Beautiful_Arrangement_II](./docs/Leetcode_Solutions/Python/0667._Beautiful_Arrangement_II.md)

- [0672._Bulb_Switcher_II](./docs/Leetcode_Solutions/Python/0672._Bulb_Switcher_II.md)

- [0677._Map_Sum_Pairs](./docs/Leetcode_Solutions/Python/0677._Map_Sum_Pairs.md)

- [0678._Valid_Parenthesis_String](./docs/Leetcode_Solutions/Python/0678._Valid_Parenthesis_String.md)

- [0680._Valid_Palindrome_II](./docs/Leetcode_Solutions/Python/0680._Valid_Palindrome_II.md)

- [0681._Next_Closest_Time](./docs/Leetcode_Solutions/Python/0681._Next_Closest_Time.md)

- [0682._Baseball_Game](./docs/Leetcode_Solutions/Python/0682._Baseball_Game.md)

- [0684._Redundant_Connection](./docs/Leetcode_Solutions/Python/0684._Redundant_Connection.md)

- [0685._Redundant_Connection_II](./docs/Leetcode_Solutions/Python/0685._Redundant_Connection_II.md)

- [0687._Longest_Univalue_Path](./docs/Leetcode_Solutions/Python/0687._Longest_Univalue_Path.md)

- [0688._Knight_Probability_in_Chessboard](./docs/Leetcode_Solutions/Python/0688._Knight_Probability_in_Chessboard.md)

- [0692._Top_K_Frequent_Words](./docs/Leetcode_Solutions/Python/0692._Top_K_Frequent_Words.md)

- [0693._Binary_Number_with_Alternating_Bits](./docs/Leetcode_Solutions/Python/0693._Binary_Number_with_Alternating_Bits.md)

- [0695._Max_Area_of_Island](./docs/Leetcode_Solutions/Python/0695._Max_Area_of_Island.md)

- [0697._Degree_of_an_Array](./docs/Leetcode_Solutions/Python/0697._Degree_of_an_Array.md)

- [0698._Partition_to_K_Equal_Sum_Subsets](./docs/Leetcode_Solutions/Python/0698._Partition_to_K_Equal_Sum_Subsets.md)

- [0701._Insert_into_a_Binary_Search_Tree](./docs/Leetcode_Solutions/Python/0701._Insert_into_a_Binary_Search_Tree.md)

- [0703._Kth_Largest_Element_in_a_Stream](./docs/Leetcode_Solutions/Python/0703._Kth_Largest_Element_in_a_Stream.md)

- [0707._Design_Linked_List](./docs/Leetcode_Solutions/Python/0707._Design_Linked_List.md)

- [0709._To_Lower_Case](./docs/Leetcode_Solutions/Python/0709._To_Lower_Case.md)

- [0712._Minimum_ASCII_Delete_Sum_for_Two_Strings](./docs/Leetcode_Solutions/Python/0712._Minimum_ASCII_Delete_Sum_for_Two_Strings.md)

- [0713._Subarray_Product_Less_Than_K](./docs/Leetcode_Solutions/Python/0713._Subarray_Product_Less_Than_K.md)

- [0714._Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee](./docs/Leetcode_Solutions/Python/0714._Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee.md)

- [0721._Accounts_Merge](./docs/Leetcode_Solutions/Python/0721._Accounts_Merge.md)

- [0724._Find_Pivot_Index](./docs/Leetcode_Solutions/Python/0724._Find_Pivot_Index.md)

- [0725._Split_Linked_List_in_Parts](./docs/Leetcode_Solutions/Python/0725._Split_Linked_List_in_Parts.md)

- [0729._My_Calendar_I](./docs/Leetcode_Solutions/Python/0729._My_Calendar_I.md)

- [0730._Count_Different_Palindromic_Subsequences](./docs/Leetcode_Solutions/Python/0730._Count_Different_Palindromic_Subsequences.md)

- [0733._Flood_Fill](./docs/Leetcode_Solutions/Python/0733._Flood_Fill.md)

- [0735._Asteroid_Collision](./docs/Leetcode_Solutions/Python/0735._Asteroid_Collision.md)

- [0737._Sentence_Similarity_II](./docs/Leetcode_Solutions/Python/0737._Sentence_Similarity_II.md)

- [0738._Monotone_Increasing_Digits](./docs/Leetcode_Solutions/Python/0738._Monotone_Increasing_Digits.md)

- [0739._Daily_Temperatures](./docs/Leetcode_Solutions/Python/0739._Daily_Temperatures.md)

- [0740._delete_and_earn](./docs/Leetcode_Solutions/Python/0740._delete_and_earn.md)

- [0741._Cherry_Pickup](./docs/Leetcode_Solutions/Python/0741._Cherry_Pickup.md)

- [0746._Min_Cost_Climbing_Stairs](./docs/Leetcode_Solutions/Python/0746._Min_Cost_Climbing_Stairs.md)

- [0752._Open_the_Lock](./docs/Leetcode_Solutions/Python/0752._Open_the_Lock.md)

- [0754._Reach_a_Number](./docs/Leetcode_Solutions/Python/0754._Reach_a_Number.md)

- [0760._Find_Anagram_Mappings](./docs/Leetcode_Solutions/Python/0760._Find_Anagram_Mappings.md)

- [0763._Partition_Labels](./docs/Leetcode_Solutions/Python/0763._Partition_Labels.md)

- [0765._Couples_Holding_Hands](./docs/Leetcode_Solutions/Python/0765._Couples_Holding_Hands.md)

- [0766._Toeplitz_Matrix](./docs/Leetcode_Solutions/Python/0766._Toeplitz_Matrix.md)

- [0767._Reorganize_String](./docs/Leetcode_Solutions/Python/0767._Reorganize_String.md)

- [0771._Jewels_and_Stones](./docs/Leetcode_Solutions/Python/0771._Jewels_and_Stones.md)

- [0774._Minimize_Max_Distance_to_Gas_Station](./docs/Leetcode_Solutions/Python/0774._Minimize_Max_Distance_to_Gas_Station.md)

- [0777._Swap_Adjacent_in_LR_String](./docs/Leetcode_Solutions/Python/0777._Swap_Adjacent_in_LR_String.md)

- [0778._Swim_in_Rising_Water](./docs/Leetcode_Solutions/Python/0778._Swim_in_Rising_Water.md)

- [0784._Letter_Case_Permutation](./docs/Leetcode_Solutions/Python/0784._Letter_Case_Permutation.md)

- [0785._Is_Graph_Bipartite](./docs/Leetcode_Solutions/Python/0785._Is_Graph_Bipartite.md)

- [0791._Custom_Sort_String](./docs/Leetcode_Solutions/Python/0791._Custom_Sort_String.md)

- [0792._Number_of_Matching_Subsequences](./docs/Leetcode_Solutions/Python/0792._Number_of_Matching_Subsequences.md)

- [0796._Rotate_String](./docs/Leetcode_Solutions/Python/0796._Rotate_String.md)

- [0800._Similar_RGB_Color](./docs/Leetcode_Solutions/Python/0800._Similar_RGB_Color.md)

- [0801._Minimum_Swaps_To_Make_Sequences_Increasing](./docs/Leetcode_Solutions/Python/0801._Minimum_Swaps_To_Make_Sequences_Increasing.md)

- [0803._Bricks_Falling_When_Hit](./docs/Leetcode_Solutions/Python/0803._Bricks_Falling_When_Hit.md)

- [0804._unique_morse_code_words](./docs/Leetcode_Solutions/Python/0804._unique_morse_code_words.md)

- [0808._Soup_Servings](./docs/Leetcode_Solutions/Python/0808._Soup_Servings.md)

- [0815._Bus_Routes](./docs/Leetcode_Solutions/Python/0815._Bus_Routes.md)

- [0819._Most_Common_Word](./docs/Leetcode_Solutions/Python/0819._Most_Common_Word.md)

- [0820._Short_Encoding_of_Words](./docs/Leetcode_Solutions/Python/0820._Short_Encoding_of_Words.md)

- [0821._Shortest_Distance_to_a_Character](./docs/Leetcode_Solutions/Python/0821._Shortest_Distance_to_a_Character.md)

- [0824._Goat_Latin](./docs/Leetcode_Solutions/Python/0824._Goat_Latin.md)

- [0825._Friends_Of_Appropriate_Ages](./docs/Leetcode_Solutions/Python/0825._Friends_Of_Appropriate_Ages.md)

- [0826._Most_Profit_Assigning_Work](./docs/Leetcode_Solutions/Python/0826._Most_Profit_Assigning_Work.md)

- [0829._Consecutive_Numbers_Sum](./docs/Leetcode_Solutions/Python/0829._Consecutive_Numbers_Sum.md)

- [0832._Flipping_an_Image](./docs/Leetcode_Solutions/Python/0832._Flipping_an_Image.md)

- [0835._Image_Overlap](./docs/Leetcode_Solutions/Python/0835._Image_Overlap.md)

- [0836._Rectangle_Overlap](./docs/Leetcode_Solutions/Python/0836._Rectangle_Overlap.md)

- [0839._Similar_String_Groups](./docs/Leetcode_Solutions/Python/0839._Similar_String_Groups.md)

- [0843._Guess_the_Word](./docs/Leetcode_Solutions/Python/0843._Guess_the_Word.md)

- [0844._Backspace_String_Compare](./docs/Leetcode_Solutions/Python/0844._Backspace_String_Compare.md)

- [0850._Rectangle_Area_II](./docs/Leetcode_Solutions/Python/0850._Rectangle_Area_II.md)

- [0859._Buddy_Strings](./docs/Leetcode_Solutions/Python/0859._Buddy_Strings.md)

- [0862._Shortest_Subarray_with_Sum_at_Least_K](./docs/Leetcode_Solutions/Python/0862._Shortest_Subarray_with_Sum_at_Least_K.md)

- [0865._Smallest_Subtree_with_all_the_Deepest_Nodes](./docs/Leetcode_Solutions/Python/0865._Smallest_Subtree_with_all_the_Deepest_Nodes.md)

- [0867._transpose_matrix](./docs/Leetcode_Solutions/Python/0867._transpose_matrix.md)

- [0871._Minimum_Number_of_Refueling_Stops](./docs/Leetcode_Solutions/Python/0871._Minimum_Number_of_Refueling_Stops.md)

- [0872._Leaf-Similar_Trees](./docs/Leetcode_Solutions/Python/0872._Leaf-Similar_Trees.md)

- [0873._Length_of_Longest_Fibonacci_Subsequence](./docs/Leetcode_Solutions/Python/0873._Length_of_Longest_Fibonacci_Subsequence.md)

- [0876._middle_of_the_linked_list](./docs/Leetcode_Solutions/Python/0876._middle_of_the_linked_list.md)

- [0877._Stone_Game](./docs/Leetcode_Solutions/Python/0877._Stone_Game.md)

- [0878._Nth_Magical_Number](./docs/Leetcode_Solutions/Python/0878._Nth_Magical_Number.md)

- [0890._Find_and_Replace_Pattern](./docs/Leetcode_Solutions/Python/0890._Find_and_Replace_Pattern.md)

- [0891._Sum_of_Subsequence_Widths](./docs/Leetcode_Solutions/Python/0891._Sum_of_Subsequence_Widths.md)

- [0896._monotonic_array](./docs/Leetcode_Solutions/Python/0896._monotonic_array.md)

- [0900._RLE_Iterator](./docs/Leetcode_Solutions/Python/0900._RLE_Iterator.md)

- [0901._Online_Stock_Span](./docs/Leetcode_Solutions/Python/0901._Online_Stock_Span.md)

- [0902._Numbers_At_Most_N_Given_Digit_Set](./docs/Leetcode_Solutions/Python/0902._Numbers_At_Most_N_Given_Digit_Set.md)

- [0904._Fruit_Into_Baskets](./docs/Leetcode_Solutions/Python/0904._Fruit_Into_Baskets.md)

- [0905._Sort_Array_By_Parity](./docs/Leetcode_Solutions/Python/0905._Sort_Array_By_Parity.md)

- [0906._Super_Palindromes](./docs/Leetcode_Solutions/Python/0906._Super_Palindromes.md)

- [0907._Sum_of_Subarray_Minimums](./docs/Leetcode_Solutions/Python/0907._Sum_of_Subarray_Minimums.md)

- [0908._Smallest_Range](./docs/Leetcode_Solutions/Python/0908._Smallest_Range.md)

- [0910._Smallest_Range_II](./docs/Leetcode_Solutions/Python/0910._Smallest_Range_II.md)

- [0913._Cat_and_Mouse](./docs/Leetcode_Solutions/Python/0913._Cat_and_Mouse.md)

- [0914._X_of_a_Kind_in_a_Deck_of_Cards](./docs/Leetcode_Solutions/Python/0914._X_of_a_Kind_in_a_Deck_of_Cards.md)

- [0915._Partition_Array_into_Disjoint_Intervals](./docs/Leetcode_Solutions/Python/0915._Partition_Array_into_Disjoint_Intervals.md)

- [0916._Word_Subsets](./docs/Leetcode_Solutions/Python/0916._Word_Subsets.md)

- [0917._Reverse_Only_Letters](./docs/Leetcode_Solutions/Python/0917._Reverse_Only_Letters.md)

- [0918._Maximum_Sum_Circular_Subarray](./docs/Leetcode_Solutions/Python/0918._Maximum_Sum_Circular_Subarray.md)

- [0919._Complete_Binary_Tree_Inserter](./docs/Leetcode_Solutions/Python/0919._Complete_Binary_Tree_Inserter.md)

- [0920._Number_of_Music_Playlists](./docs/Leetcode_Solutions/Python/0920._Number_of_Music_Playlists.md)

- [0921._Minimum_Add_to_Make_Parentheses_Valid](./docs/Leetcode_Solutions/Python/0921._Minimum_Add_to_Make_Parentheses_Valid.md)

- [0922._Sort_Array_By_Parity_II](./docs/Leetcode_Solutions/Python/0922._Sort_Array_By_Parity_II.md)

- [0923._3Sum_With_Multiplicity](./docs/Leetcode_Solutions/Python/0923._3Sum_With_Multiplicity.md)

- [0924._Minimize_Malware_Spread](./docs/Leetcode_Solutions/Python/0924._Minimize_Malware_Spread.md)

- [0925._Long_Pressed_Name](./docs/Leetcode_Solutions/Python/0925._Long_Pressed_Name.md)

- [0926._Flip_String_to_Monotone_Increasing](./docs/Leetcode_Solutions/Python/0926._Flip_String_to_Monotone_Increasing.md)

- [0927._Three_Equal_Parts](./docs/Leetcode_Solutions/Python/0927._Three_Equal_Parts.md)

- [0928._Minimize_Malware_Spread_II](./docs/Leetcode_Solutions/Python/0928._Minimize_Malware_Spread_II.md)

- [0929._Unique_Email_Addresses](./docs/Leetcode_Solutions/Python/0929._Unique_Email_Addresses.md)

- [0930._Binary_Subarrays_With_Sum](./docs/Leetcode_Solutions/Python/0930._Binary_Subarrays_With_Sum.md)

- [0931._Minimum_Falling_Path_Sum](./docs/Leetcode_Solutions/Python/0931._Minimum_Falling_Path_Sum.md)

- [0932._Beautiful_Array](./docs/Leetcode_Solutions/Python/0932._Beautiful_Array.md)

- [0933._Number_of_Recent_Calls](./docs/Leetcode_Solutions/Python/0933._Number_of_Recent_Calls.md)

- [0934._Shortest_Bridge](./docs/Leetcode_Solutions/Python/0934._Shortest_Bridge.md)

- [0935._Knight_Dialer](./docs/Leetcode_Solutions/Python/0935._Knight_Dialer.md)

- [0936._Stamping_The_Sequence](./docs/Leetcode_Solutions/Python/0936._Stamping_The_Sequence.md)

- [0937._Reorder_Log_Files](./docs/Leetcode_Solutions/Python/0937._Reorder_Log_Files.md)

- [0938._Range_Sum_of_BST](./docs/Leetcode_Solutions/Python/0938._Range_Sum_of_BST.md)

- [0939._Minimum_Area_Rectangle](./docs/Leetcode_Solutions/Python/0939._Minimum_Area_Rectangle.md)

- [0940._Distinct_Subsequences_II](./docs/Leetcode_Solutions/Python/0940._Distinct_Subsequences_II.md)

- [0941._Valid_Mountain_Array](./docs/Leetcode_Solutions/Python/0941._Valid_Mountain_Array.md)

- [0942._DI_String_Match](./docs/Leetcode_Solutions/Python/0942._DI_String_Match.md)

- [0943._Find_the_Shortest_Superstring](./docs/Leetcode_Solutions/Python/0943._Find_the_Shortest_Superstring.md)

- [0944._Delete_Columns_to_Make_Sorted](./docs/Leetcode_Solutions/Python/0944._Delete_Columns_to_Make_Sorted.md)

- [0945._Minimum_Increment_to_Make_Array_Unique](./docs/Leetcode_Solutions/Python/0945._Minimum_Increment_to_Make_Array_Unique.md)

- [0946._Validate_Stack_Sequences](./docs/Leetcode_Solutions/Python/0946._Validate_Stack_Sequences.md)

- [0947._Most_Stones_Removed_with_Same_Row_or_Column](./docs/Leetcode_Solutions/Python/0947._Most_Stones_Removed_with_Same_Row_or_Column.md)

- [0948._Bag_of_Tokens](./docs/Leetcode_Solutions/Python/0948._Bag_of_Tokens.md)

- [0949._Largest_Time_for_Given_Digits](./docs/Leetcode_Solutions/Python/0949._Largest_Time_for_Given_Digits.md)

- [0950._Reveal_Cards_In_Increasing_Order](./docs/Leetcode_Solutions/Python/0950._Reveal_Cards_In_Increasing_Order.md)

- [0951._Flip_Equivalent_Binary_Trees](./docs/Leetcode_Solutions/Python/0951._Flip_Equivalent_Binary_Trees.md)

- [0952._Largest_Component_Size_by_Common_Factor](./docs/Leetcode_Solutions/Python/0952._Largest_Component_Size_by_Common_Factor.md)

- [0953._Verifying_an_Alien_Dictionary](./docs/Leetcode_Solutions/Python/0953._Verifying_an_Alien_Dictionary.md)

- [0954._Array_of_Doubled_Pairs](./docs/Leetcode_Solutions/Python/0954._Array_of_Doubled_Pairs.md)

- [0955._Delete_Columns_to_Make_Sorted_II](./docs/Leetcode_Solutions/Python/0955._Delete_Columns_to_Make_Sorted_II.md)

- [0956._Tallest_Billboard](./docs/Leetcode_Solutions/Python/0956._Tallest_Billboard.md)

- [0957._Prison_Cells_After_N_Days](./docs/Leetcode_Solutions/Python/0957._Prison_Cells_After_N_Days.md)

- [0958._Check_Completeness_of_a_Binary_Tree](./docs/Leetcode_Solutions/Python/0958._Check_Completeness_of_a_Binary_Tree.md)

- [0959._Regions_Cut_By_Slashes](./docs/Leetcode_Solutions/Python/0959._Regions_Cut_By_Slashes.md)

- [0960._Delete_Columns_to_Make_Sorted_III](./docs/Leetcode_Solutions/Python/0960._Delete_Columns_to_Make_Sorted_III.md)

- [0961._N-Repeated_Element_in_Size_2N_Array](./docs/Leetcode_Solutions/Python/0961._N-Repeated_Element_in_Size_2N_Array.md)

- [0962._Maximum_Width_Ramp](./docs/Leetcode_Solutions/Python/0962._Maximum_Width_Ramp.md)

- [0963._Minimum_Area_Rectangle_II](./docs/Leetcode_Solutions/Python/0963._Minimum_Area_Rectangle_II.md)

- [0964._Least_Operators_to_Express_Number](./docs/Leetcode_Solutions/Python/0964._Least_Operators_to_Express_Number.md)

- [0965._Univalued_Binary_Tree](./docs/Leetcode_Solutions/Python/0965._Univalued_Binary_Tree.md)

- [0966._Vowel_Spellchecker](./docs/Leetcode_Solutions/Python/0966._Vowel_Spellchecker.md)

- [0967._Numbers_With_Same_Consecutive_Differences](./docs/Leetcode_Solutions/Python/0967._Numbers_With_Same_Consecutive_Differences.md)

- [0968._Binary_Tree_Cameras](./docs/Leetcode_Solutions/Python/0968._Binary_Tree_Cameras.md)

- [0969._Pancake_Sorting](./docs/Leetcode_Solutions/Python/0969._Pancake_Sorting.md)

- [0970._Powerful_Integers](./docs/Leetcode_Solutions/Python/0970._Powerful_Integers.md)

- [0971._Flip_Binary_Tree_To_Match_Preorder_Traversal](./docs/Leetcode_Solutions/Python/0971._Flip_Binary_Tree_To_Match_Preorder_Traversal.md)

- [0972._Equal_Rational_Numbers](./docs/Leetcode_Solutions/Python/0972._Equal_Rational_Numbers.md)

- [0973._K_Closest_Points_to_Origin](./docs/Leetcode_Solutions/Python/0973._K_Closest_Points_to_Origin.md)

- [0974._Subarray_Sums_Divisible_by_K](./docs/Leetcode_Solutions/Python/0974._Subarray_Sums_Divisible_by_K.md)

- [0975._Odd_Even_Jump](./docs/Leetcode_Solutions/Python/0975._Odd_Even_Jump.md)

- [0976._Largest_Perimeter_Triangle](./docs/Leetcode_Solutions/Python/0976._Largest_Perimeter_Triangle.md)

- [0977._Squares_of_a_Sorted_Array](./docs/Leetcode_Solutions/Python/0977._Squares_of_a_Sorted_Array.md)

- [0978._Longest_Turbulent_Subarray](./docs/Leetcode_Solutions/Python/0978._Longest_Turbulent_Subarray.md)

- [0979._Distribute_Coins_in_Binary_Tree](./docs/Leetcode_Solutions/Python/0979._Distribute_Coins_in_Binary_Tree.md)

- [0980._Unique_Paths_III](./docs/Leetcode_Solutions/Python/0980._Unique_Paths_III.md)

- [0981._Time_Based_Key-Value_Store](./docs/Leetcode_Solutions/Python/0981._Time_Based_Key-Value_Store.md)

- [0982._Triples_with_Bitwise_AND_Equal_To_Zero](./docs/Leetcode_Solutions/Python/0982._Triples_with_Bitwise_AND_Equal_To_Zero.md)

- [0983._Minimum_Cost_For_Tickets](./docs/Leetcode_Solutions/Python/0983._Minimum_Cost_For_Tickets.md)

- [0984._String_Without_AAA_or_BBB](./docs/Leetcode_Solutions/Python/0984._String_Without_AAA_or_BBB.md)

- [0985._Sum_of_Even_Numbers_After_Queries](./docs/Leetcode_Solutions/Python/0985._Sum_of_Even_Numbers_After_Queries.md)

- [0986._Interval_List_Intersections](./docs/Leetcode_Solutions/Python/0986._Interval_List_Intersections.md)

- [0987._Vertical_Order_Traversal_of_a_Binary_Tree](./docs/Leetcode_Solutions/Python/0987._Vertical_Order_Traversal_of_a_Binary_Tree.md)

- [0988._Smallest_String_Starting_From_Leaf](./docs/Leetcode_Solutions/Python/0988._Smallest_String_Starting_From_Leaf.md)

- [0989._Add_to_Array_-_Form_of_Integer](./docs/Leetcode_Solutions/Python/0989._Add_to_Array_-_Form_of_Integer.md)

- [0990._Satisfiability_of_Equality_Equations](./docs/Leetcode_Solutions/Python/0990._Satisfiability_of_Equality_Equations.md)

- [0991._Broken_Calculator](./docs/Leetcode_Solutions/Python/0991._Broken_Calculator.md)

- [0992._Subarrays_with_K_Different_Integers](./docs/Leetcode_Solutions/Python/0992._Subarrays_with_K_Different_Integers.md)

- [0993._Cousins_in_Binary_Tree](./docs/Leetcode_Solutions/Python/0993._Cousins_in_Binary_Tree.md)

- [0994._Rotting_Oranges](./docs/Leetcode_Solutions/Python/0994._Rotting_Oranges.md)

- [0995._Minimum_Number_of_K_Consecutive_Bit_Flips](./docs/Leetcode_Solutions/Python/0995._Minimum_Number_of_K_Consecutive_Bit_Flips.md)

- [0996._Number_of_Squareful_Arrays](./docs/Leetcode_Solutions/Python/0996._Number_of_Squareful_Arrays.md)

- [0997._Find_the_Town_Judge](./docs/Leetcode_Solutions/Python/0997._Find_the_Town_Judge.md)

- [0998._Maximum_Binary_Tree_II](./docs/Leetcode_Solutions/Python/0998._Maximum_Binary_Tree_II.md)

- [0999._Available_Captures_for_Rook](./docs/Leetcode_Solutions/Python/0999._Available_Captures_for_Rook.md)

- [1001._Grid_Illumination](./docs/Leetcode_Solutions/Python/1001._Grid_Illumination.md)

- [1004._Max_Consecutive_Ones_III](./docs/Leetcode_Solutions/Python/1004._Max_Consecutive_Ones_III.md)

- [1005._Maximize_Sum_Of_Array_After_K_Negations](./docs/Leetcode_Solutions/Python/1005._Maximize_Sum_Of_Array_After_K_Negations.md)

- [1006._Clumsy_Factorial](./docs/Leetcode_Solutions/Python/1006._Clumsy_Factorial.md)

- [1007._Minimum_Domino_Rotations_For_Equal_Row](./docs/Leetcode_Solutions/Python/1007._Minimum_Domino_Rotations_For_Equal_Row.md)

- [1008._Construct_Binary_Search_Tree_from_Preorder_Traversal](./docs/Leetcode_Solutions/Python/1008._Construct_Binary_Search_Tree_from_Preorder_Traversal.md)

- [1009._Complement_of_Base_10_Integer](./docs/Leetcode_Solutions/Python/1009._Complement_of_Base_10_Integer.md)

- [1010._Pairs_of_Songs_With_Total_Durations_Divisible_by_60](./docs/Leetcode_Solutions/Python/1010._Pairs_of_Songs_With_Total_Durations_Divisible_by_60.md)

- [1011._Capacity_To_Ship_Packages_Within_D_Days](./docs/Leetcode_Solutions/Python/1011._Capacity_To_Ship_Packages_Within_D_Days.md)

- [1012._Numbers_With_1_Repeated_Digit](./docs/Leetcode_Solutions/Python/1012._Numbers_With_1_Repeated_Digit.md)