hcwei13
diff --git a/‎README.md
+7-2 b/‎README.md
+7-2
diff --git a/‎docs/Algorithm_Templates/Python/Cipher/README.md ‎docs/Algorithm_Templates/Cipher/README.md b/‎docs/Algorithm_Templates/Python/Cipher/README.md ‎docs/Algorithm_Templates/Cipher/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Compression/README.md ‎docs/Algorithm_Templates/Compression/README.md b/‎docs/Algorithm_Templates/Python/Compression/README.md ‎docs/Algorithm_Templates/Compression/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Conversion/README.md ‎docs/Algorithm_Templates/Conversion/README.md b/‎docs/Algorithm_Templates/Python/Conversion/README.md ‎docs/Algorithm_Templates/Conversion/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Graph/README.md ‎docs/Algorithm_Templates/Data_Structure/Graph/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Graph/README.md ‎docs/Algorithm_Templates/Data_Structure/Graph/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/HashMap/README.md ‎docs/Algorithm_Templates/Data_Structure/HashMap/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/HashMap/README.md ‎docs/Algorithm_Templates/Data_Structure/HashMap/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/HashTable/README.md ‎docs/Algorithm_Templates/Data_Structure/HashTable/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/HashTable/README.md ‎docs/Algorithm_Templates/Data_Structure/HashTable/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Heqp/README.md ‎docs/Algorithm_Templates/Data_Structure/Heqp/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Heqp/README.md ‎docs/Algorithm_Templates/Data_Structure/Heqp/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/LinkedList/README.md ‎docs/Algorithm_Templates/Data_Structure/LinkedList/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/LinkedList/README.md ‎docs/Algorithm_Templates/Data_Structure/LinkedList/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Matrix/README.md ‎docs/Algorithm_Templates/Data_Structure/Matrix/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Matrix/README.md ‎docs/Algorithm_Templates/Data_Structure/Matrix/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Queue/README.md ‎docs/Algorithm_Templates/Data_Structure/Queue/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Queue/README.md ‎docs/Algorithm_Templates/Data_Structure/Queue/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/README.md ‎docs/Algorithm_Templates/Data_Structure/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/README.md ‎docs/Algorithm_Templates/Data_Structure/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Stack/README.md ‎docs/Algorithm_Templates/Data_Structure/Stack/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Stack/README.md ‎docs/Algorithm_Templates/Data_Structure/Stack/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Data_Structure/Tree/README.md ‎docs/Algorithm_Templates/Data_Structure/Tree/README.md b/‎docs/Algorithm_Templates/Python/Data_Structure/Tree/README.md ‎docs/Algorithm_Templates/Data_Structure/Tree/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Dynamic_Programming/README.md ‎docs/Algorithm_Templates/Dynamic_Programming/README.md b/‎docs/Algorithm_Templates/Python/Dynamic_Programming/README.md ‎docs/Algorithm_Templates/Dynamic_Programming/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Hash/README.md ‎docs/Algorithm_Templates/Hash/README.md b/‎docs/Algorithm_Templates/Python/Hash/README.md ‎docs/Algorithm_Templates/Hash/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Others/NextNodeInOrderTree.md ‎docs/Algorithm_Templates/Others/NextNodeInOrderTree.md b/‎docs/Algorithm_Templates/Python/Others/NextNodeInOrderTree.md ‎docs/Algorithm_Templates/Others/NextNodeInOrderTree.md
diff --git a/‎docs/Algorithm_Templates/Python/Others/TopKWords.java ‎docs/Algorithm_Templates/Others/TopKWords.java b/‎docs/Algorithm_Templates/Python/Others/TopKWords.java ‎docs/Algorithm_Templates/Others/TopKWords.java
diff --git a/‎docs/Algorithm_Templates/Python/Others/words.txt ‎docs/Algorithm_Templates/Others/words.txt b/‎docs/Algorithm_Templates/Python/Others/words.txt ‎docs/Algorithm_Templates/Others/words.txt
diff --git a/‎docs/Algorithm_Templates/Python/Sort/README.md
-16 b/‎docs/Algorithm_Templates/Python/Sort/README.md
-16
diff --git a/‎docs/Algorithm_Templates/README.md
+5 b/‎docs/Algorithm_Templates/README.md
+5
diff --git a/‎docs/Algorithm_Templates/Python/Search/README.md ‎docs/Algorithm_Templates/Search/README.md b/‎docs/Algorithm_Templates/Python/Search/README.md ‎docs/Algorithm_Templates/Search/README.md
diff --git a/‎docs/Algorithm_Templates/Python/Sort/BubbleSort.py ‎docs/Algorithm_Templates/Sort/BubbleSort.py b/‎docs/Algorithm_Templates/Python/Sort/BubbleSort.py ‎docs/Algorithm_Templates/Sort/BubbleSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Sort/InsertSort.py ‎docs/Algorithm_Templates/Sort/InsertSort.py b/‎docs/Algorithm_Templates/Python/Sort/InsertSort.py ‎docs/Algorithm_Templates/Sort/InsertSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Sort/MergeSort.py ‎docs/Algorithm_Templates/Sort/MergeSort.py b/‎docs/Algorithm_Templates/Python/Sort/MergeSort.py ‎docs/Algorithm_Templates/Sort/MergeSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Sort/QuickSort.py ‎docs/Algorithm_Templates/Sort/QuickSort.py b/‎docs/Algorithm_Templates/Python/Sort/QuickSort.py ‎docs/Algorithm_Templates/Sort/QuickSort.py
diff --git a/‎docs/Algorithm_Templates/Python/README.md ‎docs/Algorithm_Templates/Sort/README.md
+1-3 b/‎docs/Algorithm_Templates/Python/README.md ‎docs/Algorithm_Templates/Sort/README.md
+1-3
diff --git a/‎docs/Algorithm_Templates/Python/Sort/RadixSort.py ‎docs/Algorithm_Templates/Sort/RadixSort.py b/‎docs/Algorithm_Templates/Python/Sort/RadixSort.py ‎docs/Algorithm_Templates/Sort/RadixSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Sort/SelectionSort.py ‎docs/Algorithm_Templates/Sort/SelectionSort.py b/‎docs/Algorithm_Templates/Python/Sort/SelectionSort.py ‎docs/Algorithm_Templates/Sort/SelectionSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Sort/ShellSort.py ‎docs/Algorithm_Templates/Sort/ShellSort.py b/‎docs/Algorithm_Templates/Python/Sort/ShellSort.py ‎docs/Algorithm_Templates/Sort/ShellSort.py
diff --git a/‎docs/Algorithm_Templates/Python/Traversals/README.md ‎docs/Algorithm_Templates/Traversals/README.md b/‎docs/Algorithm_Templates/Python/Traversals/README.md ‎docs/Algorithm_Templates/Traversals/README.md
diff --git a/‎docs/Leetcode_Solutions/Python/001._two_sum.md ‎docs/Leetcode_Solutions/001._two_sum.md b/‎docs/Leetcode_Solutions/Python/001._two_sum.md ‎docs/Leetcode_Solutions/001._two_sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/002._add_two_numbers.md ‎docs/Leetcode_Solutions/002._add_two_numbers.md b/‎docs/Leetcode_Solutions/Python/002._add_two_numbers.md ‎docs/Leetcode_Solutions/002._add_two_numbers.md
diff --git a/‎docs/Leetcode_Solutions/Python/003._longest_substring_without_repeating_characters.md ‎docs/Leetcode_Solutions/003._longest_substring_without_repeating_characters.md b/‎docs/Leetcode_Solutions/Python/003._longest_substring_without_repeating_characters.md ‎docs/Leetcode_Solutions/003._longest_substring_without_repeating_characters.md
diff --git a/‎docs/Leetcode_Solutions/Python/004._median_of_two_sorted_arrays.md ‎docs/Leetcode_Solutions/004._median_of_two_sorted_arrays.md b/‎docs/Leetcode_Solutions/Python/004._median_of_two_sorted_arrays.md ‎docs/Leetcode_Solutions/004._median_of_two_sorted_arrays.md
diff --git a/‎docs/Leetcode_Solutions/Python/005._longest_palindromic_substring.md ‎docs/Leetcode_Solutions/005._longest_palindromic_substring.md b/‎docs/Leetcode_Solutions/Python/005._longest_palindromic_substring.md ‎docs/Leetcode_Solutions/005._longest_palindromic_substring.md
diff --git a/‎docs/Leetcode_Solutions/Python/006._ZigZag_Conversion.md ‎docs/Leetcode_Solutions/006._ZigZag_Conversion.md b/‎docs/Leetcode_Solutions/Python/006._ZigZag_Conversion.md ‎docs/Leetcode_Solutions/006._ZigZag_Conversion.md
diff --git a/‎docs/Leetcode_Solutions/Python/007._Reverse_Integer.md ‎docs/Leetcode_Solutions/007._Reverse_Integer.md b/‎docs/Leetcode_Solutions/Python/007._Reverse_Integer.md ‎docs/Leetcode_Solutions/007._Reverse_Integer.md
diff --git a/‎docs/Leetcode_Solutions/Python/008._string_to_integer_(atoi).md ‎docs/Leetcode_Solutions/008._string_to_integer_(atoi).md b/‎docs/Leetcode_Solutions/Python/008._string_to_integer_(atoi).md ‎docs/Leetcode_Solutions/008._string_to_integer_(atoi).md
diff --git a/‎docs/Leetcode_Solutions/Python/009._Palindrome_Number.md ‎docs/Leetcode_Solutions/009._Palindrome_Number.md b/‎docs/Leetcode_Solutions/Python/009._Palindrome_Number.md ‎docs/Leetcode_Solutions/009._Palindrome_Number.md
diff --git a/‎docs/Leetcode_Solutions/Python/010._regular_expression_matching.md ‎docs/Leetcode_Solutions/010._regular_expression_matching.md b/‎docs/Leetcode_Solutions/Python/010._regular_expression_matching.md ‎docs/Leetcode_Solutions/010._regular_expression_matching.md
diff --git a/‎docs/Leetcode_Solutions/Python/011._container_with_most_water.md ‎docs/Leetcode_Solutions/011._container_with_most_water.md b/‎docs/Leetcode_Solutions/Python/011._container_with_most_water.md ‎docs/Leetcode_Solutions/011._container_with_most_water.md
diff --git a/‎docs/Leetcode_Solutions/Python/012._Integer_to_Roman.md ‎docs/Leetcode_Solutions/012._Integer_to_Roman.md b/‎docs/Leetcode_Solutions/Python/012._Integer_to_Roman.md ‎docs/Leetcode_Solutions/012._Integer_to_Roman.md
diff --git a/‎docs/Leetcode_Solutions/Python/013._Roman_to_Integer.md ‎docs/Leetcode_Solutions/013._Roman_to_Integer.md b/‎docs/Leetcode_Solutions/Python/013._Roman_to_Integer.md ‎docs/Leetcode_Solutions/013._Roman_to_Integer.md
diff --git a/‎docs/Leetcode_Solutions/Python/014._longest_common_prefix.md ‎docs/Leetcode_Solutions/014._longest_common_prefix.md b/‎docs/Leetcode_Solutions/Python/014._longest_common_prefix.md ‎docs/Leetcode_Solutions/014._longest_common_prefix.md
diff --git a/‎docs/Leetcode_Solutions/Python/015._3sum.md ‎docs/Leetcode_Solutions/015._3sum.md b/‎docs/Leetcode_Solutions/Python/015._3sum.md ‎docs/Leetcode_Solutions/015._3sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/016._3sum_closest.md ‎docs/Leetcode_Solutions/016._3sum_closest.md b/‎docs/Leetcode_Solutions/Python/016._3sum_closest.md ‎docs/Leetcode_Solutions/016._3sum_closest.md
diff --git a/‎docs/Leetcode_Solutions/Python/017._letter_combinations_of_a_phone_number.md ‎docs/Leetcode_Solutions/017._letter_combinations_of_a_phone_number.md b/‎docs/Leetcode_Solutions/Python/017._letter_combinations_of_a_phone_number.md ‎docs/Leetcode_Solutions/017._letter_combinations_of_a_phone_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/018._4sum.md ‎docs/Leetcode_Solutions/018._4sum.md b/‎docs/Leetcode_Solutions/Python/018._4sum.md ‎docs/Leetcode_Solutions/018._4sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/019._remove_nth_node_from_end_of_list.md ‎docs/Leetcode_Solutions/019._remove_nth_node_from_end_of_list.md b/‎docs/Leetcode_Solutions/Python/019._remove_nth_node_from_end_of_list.md ‎docs/Leetcode_Solutions/019._remove_nth_node_from_end_of_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/020._valid_parentheses.md ‎docs/Leetcode_Solutions/020._valid_parentheses.md b/‎docs/Leetcode_Solutions/Python/020._valid_parentheses.md ‎docs/Leetcode_Solutions/020._valid_parentheses.md
diff --git a/‎docs/Leetcode_Solutions/Python/021._merge_two_sorted_lists.md ‎docs/Leetcode_Solutions/021._merge_two_sorted_lists.md b/‎docs/Leetcode_Solutions/Python/021._merge_two_sorted_lists.md ‎docs/Leetcode_Solutions/021._merge_two_sorted_lists.md
diff --git a/‎docs/Leetcode_Solutions/Python/022._generate_parentheses.md ‎docs/Leetcode_Solutions/022._generate_parentheses.md b/‎docs/Leetcode_Solutions/Python/022._generate_parentheses.md ‎docs/Leetcode_Solutions/022._generate_parentheses.md
diff --git a/‎docs/Leetcode_Solutions/Python/023._merge_k_sorted_lists.md ‎docs/Leetcode_Solutions/023._merge_k_sorted_lists.md b/‎docs/Leetcode_Solutions/Python/023._merge_k_sorted_lists.md ‎docs/Leetcode_Solutions/023._merge_k_sorted_lists.md
diff --git a/‎docs/Leetcode_Solutions/Python/024._swap_nodes_in_pairs.md ‎docs/Leetcode_Solutions/024._swap_nodes_in_pairs.md b/‎docs/Leetcode_Solutions/Python/024._swap_nodes_in_pairs.md ‎docs/Leetcode_Solutions/024._swap_nodes_in_pairs.md
diff --git a/‎docs/Leetcode_Solutions/Python/026._Remove_Duplicates_from_Sorted_Array.md ‎docs/Leetcode_Solutions/026._Remove_Duplicates_from_Sorted_Array.md b/‎docs/Leetcode_Solutions/Python/026._Remove_Duplicates_from_Sorted_Array.md ‎docs/Leetcode_Solutions/026._Remove_Duplicates_from_Sorted_Array.md
diff --git a/‎docs/Leetcode_Solutions/Python/027._Remove_Element.md ‎docs/Leetcode_Solutions/027._Remove_Element.md b/‎docs/Leetcode_Solutions/Python/027._Remove_Element.md ‎docs/Leetcode_Solutions/027._Remove_Element.md
diff --git a/‎docs/Leetcode_Solutions/Python/028._implement_strstr().md ‎docs/Leetcode_Solutions/028._implement_strstr().md b/‎docs/Leetcode_Solutions/Python/028._implement_strstr().md ‎docs/Leetcode_Solutions/028._implement_strstr().md
diff --git a/‎docs/Leetcode_Solutions/Python/030._Substring_with_Concatenation_of_All_Words.md ‎docs/Leetcode_Solutions/030._Substring_with_Concatenation_of_All_Words.md b/‎docs/Leetcode_Solutions/Python/030._Substring_with_Concatenation_of_All_Words.md ‎docs/Leetcode_Solutions/030._Substring_with_Concatenation_of_All_Words.md
diff --git a/‎docs/Leetcode_Solutions/Python/031._next_permutation.md ‎docs/Leetcode_Solutions/031._next_permutation.md b/‎docs/Leetcode_Solutions/Python/031._next_permutation.md ‎docs/Leetcode_Solutions/031._next_permutation.md
diff --git a/‎docs/Leetcode_Solutions/Python/033._search_in_rotated_sorted_array.md ‎docs/Leetcode_Solutions/033._search_in_rotated_sorted_array.md b/‎docs/Leetcode_Solutions/Python/033._search_in_rotated_sorted_array.md ‎docs/Leetcode_Solutions/033._search_in_rotated_sorted_array.md
diff --git a/‎docs/Leetcode_Solutions/Python/034._Search for a Range.md ‎docs/Leetcode_Solutions/034._Search for a Range.md b/‎docs/Leetcode_Solutions/Python/034._Search for a Range.md ‎docs/Leetcode_Solutions/034._Search for a Range.md
diff --git a/‎docs/Leetcode_Solutions/Python/035._search_insert_position.md ‎docs/Leetcode_Solutions/035._search_insert_position.md b/‎docs/Leetcode_Solutions/Python/035._search_insert_position.md ‎docs/Leetcode_Solutions/035._search_insert_position.md
diff --git a/‎docs/Leetcode_Solutions/Python/038._Count_and_Say.md ‎docs/Leetcode_Solutions/038._Count_and_Say.md b/‎docs/Leetcode_Solutions/Python/038._Count_and_Say.md ‎docs/Leetcode_Solutions/038._Count_and_Say.md
diff --git a/‎docs/Leetcode_Solutions/Python/039._combination_sum.md ‎docs/Leetcode_Solutions/039._combination_sum.md b/‎docs/Leetcode_Solutions/Python/039._combination_sum.md ‎docs/Leetcode_Solutions/039._combination_sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/040._combination_sum_ii.md ‎docs/Leetcode_Solutions/040._combination_sum_ii.md b/‎docs/Leetcode_Solutions/Python/040._combination_sum_ii.md ‎docs/Leetcode_Solutions/040._combination_sum_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/042._trapping_rain_water.md ‎docs/Leetcode_Solutions/042._trapping_rain_water.md b/‎docs/Leetcode_Solutions/Python/042._trapping_rain_water.md ‎docs/Leetcode_Solutions/042._trapping_rain_water.md
diff --git a/‎docs/Leetcode_Solutions/Python/043._multiply_strings.md ‎docs/Leetcode_Solutions/043._multiply_strings.md b/‎docs/Leetcode_Solutions/Python/043._multiply_strings.md ‎docs/Leetcode_Solutions/043._multiply_strings.md
diff --git a/‎docs/Leetcode_Solutions/Python/044._wildcard_matching.md ‎docs/Leetcode_Solutions/044._wildcard_matching.md b/‎docs/Leetcode_Solutions/Python/044._wildcard_matching.md ‎docs/Leetcode_Solutions/044._wildcard_matching.md
diff --git a/‎docs/Leetcode_Solutions/Python/045._Jump_Game_II.md ‎docs/Leetcode_Solutions/045._Jump_Game_II.md b/‎docs/Leetcode_Solutions/Python/045._Jump_Game_II.md ‎docs/Leetcode_Solutions/045._Jump_Game_II.md
diff --git a/‎docs/Leetcode_Solutions/Python/046._permutations.md ‎docs/Leetcode_Solutions/046._permutations.md b/‎docs/Leetcode_Solutions/Python/046._permutations.md ‎docs/Leetcode_Solutions/046._permutations.md
diff --git a/‎docs/Leetcode_Solutions/Python/047._permutations_ii.md ‎docs/Leetcode_Solutions/047._permutations_ii.md b/‎docs/Leetcode_Solutions/Python/047._permutations_ii.md ‎docs/Leetcode_Solutions/047._permutations_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/048._rotate_image.md ‎docs/Leetcode_Solutions/048._rotate_image.md b/‎docs/Leetcode_Solutions/Python/048._rotate_image.md ‎docs/Leetcode_Solutions/048._rotate_image.md
diff --git a/‎docs/Leetcode_Solutions/Python/049._group_anagrams_python.md ‎docs/Leetcode_Solutions/049._group_anagrams_python.md b/‎docs/Leetcode_Solutions/Python/049._group_anagrams_python.md ‎docs/Leetcode_Solutions/049._group_anagrams_python.md
diff --git a/‎docs/Leetcode_Solutions/Python/050._pow(x,_n).md ‎docs/Leetcode_Solutions/050._pow(x,_n).md b/‎docs/Leetcode_Solutions/Python/050._pow(x,_n).md ‎docs/Leetcode_Solutions/050._pow(x,_n).md
diff --git a/‎docs/Leetcode_Solutions/Python/051._n-queens.md ‎docs/Leetcode_Solutions/051._n-queens.md b/‎docs/Leetcode_Solutions/Python/051._n-queens.md ‎docs/Leetcode_Solutions/051._n-queens.md
diff --git a/‎docs/Leetcode_Solutions/Python/052._n-queens_ii.md ‎docs/Leetcode_Solutions/052._n-queens_ii.md b/‎docs/Leetcode_Solutions/Python/052._n-queens_ii.md ‎docs/Leetcode_Solutions/052._n-queens_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/053._maximum_subarray.md ‎docs/Leetcode_Solutions/053._maximum_subarray.md b/‎docs/Leetcode_Solutions/Python/053._maximum_subarray.md ‎docs/Leetcode_Solutions/053._maximum_subarray.md
diff --git a/‎docs/Leetcode_Solutions/Python/054._spiral_matrix.md ‎docs/Leetcode_Solutions/054._spiral_matrix.md b/‎docs/Leetcode_Solutions/Python/054._spiral_matrix.md ‎docs/Leetcode_Solutions/054._spiral_matrix.md
diff --git a/‎docs/Leetcode_Solutions/Python/055._jump_game.md ‎docs/Leetcode_Solutions/055._jump_game.md b/‎docs/Leetcode_Solutions/Python/055._jump_game.md ‎docs/Leetcode_Solutions/055._jump_game.md
diff --git a/‎docs/Leetcode_Solutions/Python/056._Merge_Intervals.md ‎docs/Leetcode_Solutions/056._Merge_Intervals.md b/‎docs/Leetcode_Solutions/Python/056._Merge_Intervals.md ‎docs/Leetcode_Solutions/056._Merge_Intervals.md
diff --git a/‎docs/Leetcode_Solutions/Python/058._length_of_last_word.md ‎docs/Leetcode_Solutions/058._length_of_last_word.md b/‎docs/Leetcode_Solutions/Python/058._length_of_last_word.md ‎docs/Leetcode_Solutions/058._length_of_last_word.md
diff --git a/‎docs/Leetcode_Solutions/Python/059._spiral_matrix_ii.md ‎docs/Leetcode_Solutions/059._spiral_matrix_ii.md b/‎docs/Leetcode_Solutions/Python/059._spiral_matrix_ii.md ‎docs/Leetcode_Solutions/059._spiral_matrix_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/060._permutation_sequence.md ‎docs/Leetcode_Solutions/060._permutation_sequence.md b/‎docs/Leetcode_Solutions/Python/060._permutation_sequence.md ‎docs/Leetcode_Solutions/060._permutation_sequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/061._rotate_list.md ‎docs/Leetcode_Solutions/061._rotate_list.md b/‎docs/Leetcode_Solutions/Python/061._rotate_list.md ‎docs/Leetcode_Solutions/061._rotate_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/064._minimum_path_sum.md ‎docs/Leetcode_Solutions/064._minimum_path_sum.md b/‎docs/Leetcode_Solutions/Python/064._minimum_path_sum.md ‎docs/Leetcode_Solutions/064._minimum_path_sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/065.unique_paths_ii.md ‎docs/Leetcode_Solutions/065.unique_paths_ii.md b/‎docs/Leetcode_Solutions/Python/065.unique_paths_ii.md ‎docs/Leetcode_Solutions/065.unique_paths_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/066._plus_one.md ‎docs/Leetcode_Solutions/066._plus_one.md b/‎docs/Leetcode_Solutions/Python/066._plus_one.md ‎docs/Leetcode_Solutions/066._plus_one.md
diff --git a/‎docs/Leetcode_Solutions/Python/067._add_binary.md ‎docs/Leetcode_Solutions/067._add_binary.md b/‎docs/Leetcode_Solutions/Python/067._add_binary.md ‎docs/Leetcode_Solutions/067._add_binary.md
diff --git a/‎docs/Leetcode_Solutions/Python/069._sqrt(x).md ‎docs/Leetcode_Solutions/069._sqrt(x).md b/‎docs/Leetcode_Solutions/Python/069._sqrt(x).md ‎docs/Leetcode_Solutions/069._sqrt(x).md
diff --git a/‎docs/Leetcode_Solutions/Python/070. Climbing Stairs.md ‎docs/Leetcode_Solutions/070. Climbing Stairs.md b/‎docs/Leetcode_Solutions/Python/070. Climbing Stairs.md ‎docs/Leetcode_Solutions/070. Climbing Stairs.md
diff --git a/‎docs/Leetcode_Solutions/Python/072._edit_distance.md ‎docs/Leetcode_Solutions/072._edit_distance.md b/‎docs/Leetcode_Solutions/Python/072._edit_distance.md ‎docs/Leetcode_Solutions/072._edit_distance.md
diff --git a/‎docs/Leetcode_Solutions/Python/073. Set Matrix Zeroes.md ‎docs/Leetcode_Solutions/073. Set Matrix Zeroes.md b/‎docs/Leetcode_Solutions/Python/073. Set Matrix Zeroes.md ‎docs/Leetcode_Solutions/073. Set Matrix Zeroes.md
diff --git a/‎docs/Leetcode_Solutions/Python/074._search_a_2d_matrix.md ‎docs/Leetcode_Solutions/074._search_a_2d_matrix.md b/‎docs/Leetcode_Solutions/Python/074._search_a_2d_matrix.md ‎docs/Leetcode_Solutions/074._search_a_2d_matrix.md
diff --git a/‎docs/Leetcode_Solutions/Python/075._sort_colors.md ‎docs/Leetcode_Solutions/075._sort_colors.md b/‎docs/Leetcode_Solutions/Python/075._sort_colors.md ‎docs/Leetcode_Solutions/075._sort_colors.md
diff --git a/‎docs/Leetcode_Solutions/Python/076._Minimum_Window_Substring.md ‎docs/Leetcode_Solutions/076._Minimum_Window_Substring.md b/‎docs/Leetcode_Solutions/Python/076._Minimum_Window_Substring.md ‎docs/Leetcode_Solutions/076._Minimum_Window_Substring.md
diff --git a/‎docs/Leetcode_Solutions/Python/077._combinations.md ‎docs/Leetcode_Solutions/077._combinations.md b/‎docs/Leetcode_Solutions/Python/077._combinations.md ‎docs/Leetcode_Solutions/077._combinations.md
diff --git a/‎docs/Leetcode_Solutions/Python/078.Subsets .md ‎docs/Leetcode_Solutions/078.Subsets .md b/‎docs/Leetcode_Solutions/Python/078.Subsets .md ‎docs/Leetcode_Solutions/078.Subsets .md
diff --git a/‎docs/Leetcode_Solutions/Python/079._word_search.md ‎docs/Leetcode_Solutions/079._word_search.md b/‎docs/Leetcode_Solutions/Python/079._word_search.md ‎docs/Leetcode_Solutions/079._word_search.md
diff --git a/‎docs/Leetcode_Solutions/Python/082._remove_duplicates_from_sorted_list_ii.md ‎docs/Leetcode_Solutions/082._remove_duplicates_from_sorted_list_ii.md b/‎docs/Leetcode_Solutions/Python/082._remove_duplicates_from_sorted_list_ii.md ‎docs/Leetcode_Solutions/082._remove_duplicates_from_sorted_list_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/083._remove_duplicates_from_sorted_list.md ‎docs/Leetcode_Solutions/083._remove_duplicates_from_sorted_list.md b/‎docs/Leetcode_Solutions/Python/083._remove_duplicates_from_sorted_list.md ‎docs/Leetcode_Solutions/083._remove_duplicates_from_sorted_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/086._partition_list.md ‎docs/Leetcode_Solutions/086._partition_list.md b/‎docs/Leetcode_Solutions/Python/086._partition_list.md ‎docs/Leetcode_Solutions/086._partition_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/088._merge_sorted_array.md ‎docs/Leetcode_Solutions/088._merge_sorted_array.md b/‎docs/Leetcode_Solutions/Python/088._merge_sorted_array.md ‎docs/Leetcode_Solutions/088._merge_sorted_array.md
diff --git a/‎docs/Leetcode_Solutions/Python/089._gray_code.md ‎docs/Leetcode_Solutions/089._gray_code.md b/‎docs/Leetcode_Solutions/Python/089._gray_code.md ‎docs/Leetcode_Solutions/089._gray_code.md
diff --git a/‎docs/Leetcode_Solutions/Python/090._subsets_ii.md ‎docs/Leetcode_Solutions/090._subsets_ii.md b/‎docs/Leetcode_Solutions/Python/090._subsets_ii.md ‎docs/Leetcode_Solutions/090._subsets_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/091._decode_ways.md ‎docs/Leetcode_Solutions/091._decode_ways.md b/‎docs/Leetcode_Solutions/Python/091._decode_ways.md ‎docs/Leetcode_Solutions/091._decode_ways.md
diff --git a/‎docs/Leetcode_Solutions/Python/092._reverse_linked_list_ii.md ‎docs/Leetcode_Solutions/092._reverse_linked_list_ii.md b/‎docs/Leetcode_Solutions/Python/092._reverse_linked_list_ii.md ‎docs/Leetcode_Solutions/092._reverse_linked_list_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/093._restore_ip_addresses.md ‎docs/Leetcode_Solutions/093._restore_ip_addresses.md b/‎docs/Leetcode_Solutions/Python/093._restore_ip_addresses.md ‎docs/Leetcode_Solutions/093._restore_ip_addresses.md
diff --git a/‎docs/Leetcode_Solutions/Python/094._binary_tree_inorder_traversal.md ‎docs/Leetcode_Solutions/094._binary_tree_inorder_traversal.md b/‎docs/Leetcode_Solutions/Python/094._binary_tree_inorder_traversal.md ‎docs/Leetcode_Solutions/094._binary_tree_inorder_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/096._unique_binary_search_trees.md ‎docs/Leetcode_Solutions/096._unique_binary_search_trees.md b/‎docs/Leetcode_Solutions/Python/096._unique_binary_search_trees.md ‎docs/Leetcode_Solutions/096._unique_binary_search_trees.md
diff --git a/‎docs/Leetcode_Solutions/Python/098._validate_binary_search_tree.md ‎docs/Leetcode_Solutions/098._validate_binary_search_tree.md b/‎docs/Leetcode_Solutions/Python/098._validate_binary_search_tree.md ‎docs/Leetcode_Solutions/098._validate_binary_search_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/100._same_tree.md ‎docs/Leetcode_Solutions/100._same_tree.md b/‎docs/Leetcode_Solutions/Python/100._same_tree.md ‎docs/Leetcode_Solutions/100._same_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/101._symmetric_tree.md ‎docs/Leetcode_Solutions/101._symmetric_tree.md b/‎docs/Leetcode_Solutions/Python/101._symmetric_tree.md ‎docs/Leetcode_Solutions/101._symmetric_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/102._binary_tree_level_order_traversal.md ‎docs/Leetcode_Solutions/102._binary_tree_level_order_traversal.md b/‎docs/Leetcode_Solutions/Python/102._binary_tree_level_order_traversal.md ‎docs/Leetcode_Solutions/102._binary_tree_level_order_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/103._binary_tree_zigzag_level_order_traversal.md ‎docs/Leetcode_Solutions/103._binary_tree_zigzag_level_order_traversal.md b/‎docs/Leetcode_Solutions/Python/103._binary_tree_zigzag_level_order_traversal.md ‎docs/Leetcode_Solutions/103._binary_tree_zigzag_level_order_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/104._maximum_depth_of_binary_tree.md ‎docs/Leetcode_Solutions/104._maximum_depth_of_binary_tree.md b/‎docs/Leetcode_Solutions/Python/104._maximum_depth_of_binary_tree.md ‎docs/Leetcode_Solutions/104._maximum_depth_of_binary_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/105._construct_binary_tree_from_preorder_and_inorder_traversal.md ‎docs/Leetcode_Solutions/105._construct_binary_tree_from_preorder_and_inorder_traversal.md b/‎docs/Leetcode_Solutions/Python/105._construct_binary_tree_from_preorder_and_inorder_traversal.md ‎docs/Leetcode_Solutions/105._construct_binary_tree_from_preorder_and_inorder_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/106._construct_binary_tree_from_inorder_and_postorder_traversal.md ‎docs/Leetcode_Solutions/106._construct_binary_tree_from_inorder_and_postorder_traversal.md b/‎docs/Leetcode_Solutions/Python/106._construct_binary_tree_from_inorder_and_postorder_traversal.md ‎docs/Leetcode_Solutions/106._construct_binary_tree_from_inorder_and_postorder_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/107._binary_tree_level_order_traversal_ii.md ‎docs/Leetcode_Solutions/107._binary_tree_level_order_traversal_ii.md b/‎docs/Leetcode_Solutions/Python/107._binary_tree_level_order_traversal_ii.md ‎docs/Leetcode_Solutions/107._binary_tree_level_order_traversal_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/108._convert_sorted_array_to_binary_search_tree.md ‎docs/Leetcode_Solutions/108._convert_sorted_array_to_binary_search_tree.md b/‎docs/Leetcode_Solutions/Python/108._convert_sorted_array_to_binary_search_tree.md ‎docs/Leetcode_Solutions/108._convert_sorted_array_to_binary_search_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/109._convert_sorted_list_to_binary_search_tree.md ‎docs/Leetcode_Solutions/109._convert_sorted_list_to_binary_search_tree.md b/‎docs/Leetcode_Solutions/Python/109._convert_sorted_list_to_binary_search_tree.md ‎docs/Leetcode_Solutions/109._convert_sorted_list_to_binary_search_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/110._balanced_binary_tree.md ‎docs/Leetcode_Solutions/110._balanced_binary_tree.md b/‎docs/Leetcode_Solutions/Python/110._balanced_binary_tree.md ‎docs/Leetcode_Solutions/110._balanced_binary_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/111._minimum_depth_of_binary_tree.md ‎docs/Leetcode_Solutions/111._minimum_depth_of_binary_tree.md b/‎docs/Leetcode_Solutions/Python/111._minimum_depth_of_binary_tree.md ‎docs/Leetcode_Solutions/111._minimum_depth_of_binary_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/112._path_sum.md ‎docs/Leetcode_Solutions/112._path_sum.md b/‎docs/Leetcode_Solutions/Python/112._path_sum.md ‎docs/Leetcode_Solutions/112._path_sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/113._path_sum_ii.md ‎docs/Leetcode_Solutions/113._path_sum_ii.md b/‎docs/Leetcode_Solutions/Python/113._path_sum_ii.md ‎docs/Leetcode_Solutions/113._path_sum_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/114._flatten_binary_tree_to_linked_list.md ‎docs/Leetcode_Solutions/114._flatten_binary_tree_to_linked_list.md b/‎docs/Leetcode_Solutions/Python/114._flatten_binary_tree_to_linked_list.md ‎docs/Leetcode_Solutions/114._flatten_binary_tree_to_linked_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/116._populating_next_right_pointers_in_each_node.md ‎docs/Leetcode_Solutions/116._populating_next_right_pointers_in_each_node.md b/‎docs/Leetcode_Solutions/Python/116._populating_next_right_pointers_in_each_node.md ‎docs/Leetcode_Solutions/116._populating_next_right_pointers_in_each_node.md
diff --git a/‎docs/Leetcode_Solutions/Python/118._pascal's_triangle.md ‎docs/Leetcode_Solutions/118._pascal's_triangle.md b/‎docs/Leetcode_Solutions/Python/118._pascal's_triangle.md ‎docs/Leetcode_Solutions/118._pascal's_triangle.md
diff --git a/‎docs/Leetcode_Solutions/Python/119. _Pascal's_Triangle_II.md ‎docs/Leetcode_Solutions/119. _Pascal's_Triangle_II.md b/‎docs/Leetcode_Solutions/Python/119. _Pascal's_Triangle_II.md ‎docs/Leetcode_Solutions/119. _Pascal's_Triangle_II.md
diff --git a/‎docs/Leetcode_Solutions/Python/120. Triangle.md ‎docs/Leetcode_Solutions/120. Triangle.md b/‎docs/Leetcode_Solutions/Python/120. Triangle.md ‎docs/Leetcode_Solutions/120. Triangle.md
diff --git a/‎docs/Leetcode_Solutions/Python/121._Best_Time_to_Buy_and_Sell_Stock.md ‎docs/Leetcode_Solutions/121._Best_Time_to_Buy_and_Sell_Stock.md b/‎docs/Leetcode_Solutions/Python/121._Best_Time_to_Buy_and_Sell_Stock.md ‎docs/Leetcode_Solutions/121._Best_Time_to_Buy_and_Sell_Stock.md
diff --git a/‎docs/Leetcode_Solutions/Python/124._Binary_Tree_Maximum_Path_Sum.md ‎docs/Leetcode_Solutions/124._Binary_Tree_Maximum_Path_Sum.md b/‎docs/Leetcode_Solutions/Python/124._Binary_Tree_Maximum_Path_Sum.md ‎docs/Leetcode_Solutions/124._Binary_Tree_Maximum_Path_Sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/125._valid_palindrome.md ‎docs/Leetcode_Solutions/125._valid_palindrome.md b/‎docs/Leetcode_Solutions/Python/125._valid_palindrome.md ‎docs/Leetcode_Solutions/125._valid_palindrome.md
diff --git a/‎docs/Leetcode_Solutions/Python/126. Word Ladder II.md ‎docs/Leetcode_Solutions/126. Word Ladder II.md b/‎docs/Leetcode_Solutions/Python/126. Word Ladder II.md ‎docs/Leetcode_Solutions/126. Word Ladder II.md
diff --git a/‎docs/Leetcode_Solutions/Python/127._word_ladder.md ‎docs/Leetcode_Solutions/127._word_ladder.md b/‎docs/Leetcode_Solutions/Python/127._word_ladder.md ‎docs/Leetcode_Solutions/127._word_ladder.md
diff --git a/‎docs/Leetcode_Solutions/Python/128._Longest_Consecutive_Sequence.md ‎docs/Leetcode_Solutions/128._Longest_Consecutive_Sequence.md b/‎docs/Leetcode_Solutions/Python/128._Longest_Consecutive_Sequence.md ‎docs/Leetcode_Solutions/128._Longest_Consecutive_Sequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/129._sum_root_to_leaf_numbers.md ‎docs/Leetcode_Solutions/129._sum_root_to_leaf_numbers.md b/‎docs/Leetcode_Solutions/Python/129._sum_root_to_leaf_numbers.md ‎docs/Leetcode_Solutions/129._sum_root_to_leaf_numbers.md
diff --git a/‎docs/Leetcode_Solutions/Python/130._surrounded_regions.md ‎docs/Leetcode_Solutions/130._surrounded_regions.md b/‎docs/Leetcode_Solutions/Python/130._surrounded_regions.md ‎docs/Leetcode_Solutions/130._surrounded_regions.md
diff --git a/‎docs/Leetcode_Solutions/Python/131._palindrome_partitioning.md ‎docs/Leetcode_Solutions/131._palindrome_partitioning.md b/‎docs/Leetcode_Solutions/Python/131._palindrome_partitioning.md ‎docs/Leetcode_Solutions/131._palindrome_partitioning.md
diff --git a/‎docs/Leetcode_Solutions/Python/133._clone_graph.md ‎docs/Leetcode_Solutions/133._clone_graph.md b/‎docs/Leetcode_Solutions/Python/133._clone_graph.md ‎docs/Leetcode_Solutions/133._clone_graph.md
diff --git a/‎docs/Leetcode_Solutions/Python/136._single_number.md ‎docs/Leetcode_Solutions/136._single_number.md b/‎docs/Leetcode_Solutions/Python/136._single_number.md ‎docs/Leetcode_Solutions/136._single_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/139._word_break.md ‎docs/Leetcode_Solutions/139._word_break.md b/‎docs/Leetcode_Solutions/Python/139._word_break.md ‎docs/Leetcode_Solutions/139._word_break.md
diff --git a/‎docs/Leetcode_Solutions/Python/140._word_break_ii.md ‎docs/Leetcode_Solutions/140._word_break_ii.md b/‎docs/Leetcode_Solutions/Python/140._word_break_ii.md ‎docs/Leetcode_Solutions/140._word_break_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/141._linked_list_cycle.md ‎docs/Leetcode_Solutions/141._linked_list_cycle.md b/‎docs/Leetcode_Solutions/Python/141._linked_list_cycle.md ‎docs/Leetcode_Solutions/141._linked_list_cycle.md
diff --git a/‎docs/Leetcode_Solutions/Python/142_Linked_List_Cycle_II.md ‎docs/Leetcode_Solutions/142_Linked_List_Cycle_II.md b/‎docs/Leetcode_Solutions/Python/142_Linked_List_Cycle_II.md ‎docs/Leetcode_Solutions/142_Linked_List_Cycle_II.md
diff --git a/‎docs/Leetcode_Solutions/Python/143._reorder_list.md ‎docs/Leetcode_Solutions/143._reorder_list.md b/‎docs/Leetcode_Solutions/Python/143._reorder_list.md ‎docs/Leetcode_Solutions/143._reorder_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/144._binary_tree_preorder_traversal.md ‎docs/Leetcode_Solutions/144._binary_tree_preorder_traversal.md b/‎docs/Leetcode_Solutions/Python/144._binary_tree_preorder_traversal.md ‎docs/Leetcode_Solutions/144._binary_tree_preorder_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/145._binary_tree_postorder_traversal.md ‎docs/Leetcode_Solutions/145._binary_tree_postorder_traversal.md b/‎docs/Leetcode_Solutions/Python/145._binary_tree_postorder_traversal.md ‎docs/Leetcode_Solutions/145._binary_tree_postorder_traversal.md
diff --git a/‎docs/Leetcode_Solutions/Python/147._insertion_sort_list.md ‎docs/Leetcode_Solutions/147._insertion_sort_list.md b/‎docs/Leetcode_Solutions/Python/147._insertion_sort_list.md ‎docs/Leetcode_Solutions/147._insertion_sort_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/148._sort_list.md ‎docs/Leetcode_Solutions/148._sort_list.md b/‎docs/Leetcode_Solutions/Python/148._sort_list.md ‎docs/Leetcode_Solutions/148._sort_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/150._evaluate_reverse_polish_notation.md ‎docs/Leetcode_Solutions/150._evaluate_reverse_polish_notation.md b/‎docs/Leetcode_Solutions/Python/150._evaluate_reverse_polish_notation.md ‎docs/Leetcode_Solutions/150._evaluate_reverse_polish_notation.md
diff --git a/‎docs/Leetcode_Solutions/Python/151._reverse_words_in_a_string.md ‎docs/Leetcode_Solutions/151._reverse_words_in_a_string.md b/‎docs/Leetcode_Solutions/Python/151._reverse_words_in_a_string.md ‎docs/Leetcode_Solutions/151._reverse_words_in_a_string.md
diff --git a/‎docs/Leetcode_Solutions/Python/152._maximum_product_subarray.md ‎docs/Leetcode_Solutions/152._maximum_product_subarray.md b/‎docs/Leetcode_Solutions/Python/152._maximum_product_subarray.md ‎docs/Leetcode_Solutions/152._maximum_product_subarray.md
diff --git a/‎docs/Leetcode_Solutions/Python/153._find_minimum_in_rotated_sorted_array.md ‎docs/Leetcode_Solutions/153._find_minimum_in_rotated_sorted_array.md b/‎docs/Leetcode_Solutions/Python/153._find_minimum_in_rotated_sorted_array.md ‎docs/Leetcode_Solutions/153._find_minimum_in_rotated_sorted_array.md
diff --git a/‎docs/Leetcode_Solutions/Python/155._min_stack.md ‎docs/Leetcode_Solutions/155._min_stack.md b/‎docs/Leetcode_Solutions/Python/155._min_stack.md ‎docs/Leetcode_Solutions/155._min_stack.md
diff --git a/‎docs/Leetcode_Solutions/Python/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md ‎docs/Leetcode_Solutions/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md b/‎docs/Leetcode_Solutions/Python/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md ‎docs/Leetcode_Solutions/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md
diff --git a/‎docs/Leetcode_Solutions/Python/160._intersection_of_two_linked_lists.md ‎docs/Leetcode_Solutions/160._intersection_of_two_linked_lists.md b/‎docs/Leetcode_Solutions/Python/160._intersection_of_two_linked_lists.md ‎docs/Leetcode_Solutions/160._intersection_of_two_linked_lists.md
diff --git a/‎docs/Leetcode_Solutions/Python/162._find_peak_element.md ‎docs/Leetcode_Solutions/162._find_peak_element.md b/‎docs/Leetcode_Solutions/Python/162._find_peak_element.md ‎docs/Leetcode_Solutions/162._find_peak_element.md
diff --git a/‎docs/Leetcode_Solutions/Python/165._compare_version_numbers.md ‎docs/Leetcode_Solutions/165._compare_version_numbers.md b/‎docs/Leetcode_Solutions/Python/165._compare_version_numbers.md ‎docs/Leetcode_Solutions/165._compare_version_numbers.md
diff --git a/‎docs/Leetcode_Solutions/Python/166._Fraction_to_Recurring_Decimal.md ‎docs/Leetcode_Solutions/166._Fraction_to_Recurring_Decimal.md b/‎docs/Leetcode_Solutions/Python/166._Fraction_to_Recurring_Decimal.md ‎docs/Leetcode_Solutions/166._Fraction_to_Recurring_Decimal.md
diff --git a/‎docs/Leetcode_Solutions/Python/167._two_sum_ii_-_input_array_is_sorted.md ‎docs/Leetcode_Solutions/167._two_sum_ii_-_input_array_is_sorted.md b/‎docs/Leetcode_Solutions/Python/167._two_sum_ii_-_input_array_is_sorted.md ‎docs/Leetcode_Solutions/167._two_sum_ii_-_input_array_is_sorted.md
diff --git a/‎docs/Leetcode_Solutions/Python/168._excel_sheet_column_title.md ‎docs/Leetcode_Solutions/168._excel_sheet_column_title.md b/‎docs/Leetcode_Solutions/Python/168._excel_sheet_column_title.md ‎docs/Leetcode_Solutions/168._excel_sheet_column_title.md
diff --git a/‎docs/Leetcode_Solutions/Python/169._majority_element.md ‎docs/Leetcode_Solutions/169._majority_element.md b/‎docs/Leetcode_Solutions/Python/169._majority_element.md ‎docs/Leetcode_Solutions/169._majority_element.md
diff --git a/‎docs/Leetcode_Solutions/Python/171._excel_sheet_column_number.md ‎docs/Leetcode_Solutions/171._excel_sheet_column_number.md b/‎docs/Leetcode_Solutions/Python/171._excel_sheet_column_number.md ‎docs/Leetcode_Solutions/171._excel_sheet_column_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/173._binary_search_tree_iterator.md ‎docs/Leetcode_Solutions/173._binary_search_tree_iterator.md b/‎docs/Leetcode_Solutions/Python/173._binary_search_tree_iterator.md ‎docs/Leetcode_Solutions/173._binary_search_tree_iterator.md
diff --git a/‎docs/Leetcode_Solutions/Python/179._Largest_Number.md ‎docs/Leetcode_Solutions/179._Largest_Number.md b/‎docs/Leetcode_Solutions/Python/179._Largest_Number.md ‎docs/Leetcode_Solutions/179._Largest_Number.md
diff --git a/‎docs/Leetcode_Solutions/Python/189._rotate_array.md ‎docs/Leetcode_Solutions/189._rotate_array.md b/‎docs/Leetcode_Solutions/Python/189._rotate_array.md ‎docs/Leetcode_Solutions/189._rotate_array.md
diff --git a/‎docs/Leetcode_Solutions/Python/191._number_of_1_bits.md ‎docs/Leetcode_Solutions/191._number_of_1_bits.md b/‎docs/Leetcode_Solutions/Python/191._number_of_1_bits.md ‎docs/Leetcode_Solutions/191._number_of_1_bits.md
diff --git a/‎docs/Leetcode_Solutions/Python/198._house_robber.md ‎docs/Leetcode_Solutions/198._house_robber.md b/‎docs/Leetcode_Solutions/Python/198._house_robber.md ‎docs/Leetcode_Solutions/198._house_robber.md
diff --git a/‎docs/Leetcode_Solutions/Python/199._binary_tree_right_side_view.md ‎docs/Leetcode_Solutions/199._binary_tree_right_side_view.md b/‎docs/Leetcode_Solutions/Python/199._binary_tree_right_side_view.md ‎docs/Leetcode_Solutions/199._binary_tree_right_side_view.md
diff --git a/‎docs/Leetcode_Solutions/Python/200._number_of_islands.md ‎docs/Leetcode_Solutions/200._number_of_islands.md b/‎docs/Leetcode_Solutions/Python/200._number_of_islands.md ‎docs/Leetcode_Solutions/200._number_of_islands.md
diff --git a/‎docs/Leetcode_Solutions/Python/203._remove_linked_list_elements.md ‎docs/Leetcode_Solutions/203._remove_linked_list_elements.md b/‎docs/Leetcode_Solutions/Python/203._remove_linked_list_elements.md ‎docs/Leetcode_Solutions/203._remove_linked_list_elements.md
diff --git a/‎docs/Leetcode_Solutions/Python/204._count_primes.md ‎docs/Leetcode_Solutions/204._count_primes.md b/‎docs/Leetcode_Solutions/Python/204._count_primes.md ‎docs/Leetcode_Solutions/204._count_primes.md
diff --git a/‎docs/Leetcode_Solutions/Python/205._isomorphic_strings.md ‎docs/Leetcode_Solutions/205._isomorphic_strings.md b/‎docs/Leetcode_Solutions/Python/205._isomorphic_strings.md ‎docs/Leetcode_Solutions/205._isomorphic_strings.md
diff --git a/‎docs/Leetcode_Solutions/Python/206._reverse_linked_list.md ‎docs/Leetcode_Solutions/206._reverse_linked_list.md b/‎docs/Leetcode_Solutions/Python/206._reverse_linked_list.md ‎docs/Leetcode_Solutions/206._reverse_linked_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/207._course_schedule.md ‎docs/Leetcode_Solutions/207._course_schedule.md b/‎docs/Leetcode_Solutions/Python/207._course_schedule.md ‎docs/Leetcode_Solutions/207._course_schedule.md
diff --git a/‎docs/Leetcode_Solutions/Python/208._implement_trie_(prefix_tree).md ‎docs/Leetcode_Solutions/208._implement_trie_(prefix_tree).md b/‎docs/Leetcode_Solutions/Python/208._implement_trie_(prefix_tree).md ‎docs/Leetcode_Solutions/208._implement_trie_(prefix_tree).md
diff --git a/‎docs/Leetcode_Solutions/Python/210._course_schedule_ii.md ‎docs/Leetcode_Solutions/210._course_schedule_ii.md b/‎docs/Leetcode_Solutions/Python/210._course_schedule_ii.md ‎docs/Leetcode_Solutions/210._course_schedule_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/211. Add and Search Word - Data structure design.md ‎docs/Leetcode_Solutions/211. Add and Search Word - Data structure design.md b/‎docs/Leetcode_Solutions/Python/211. Add and Search Word - Data structure design.md ‎docs/Leetcode_Solutions/211. Add and Search Word - Data structure design.md
diff --git a/‎docs/Leetcode_Solutions/Python/213._house_robber_ii.md ‎docs/Leetcode_Solutions/213._house_robber_ii.md b/‎docs/Leetcode_Solutions/Python/213._house_robber_ii.md ‎docs/Leetcode_Solutions/213._house_robber_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/216._combination_sum_iii.md ‎docs/Leetcode_Solutions/216._combination_sum_iii.md b/‎docs/Leetcode_Solutions/Python/216._combination_sum_iii.md ‎docs/Leetcode_Solutions/216._combination_sum_iii.md
diff --git a/‎docs/Leetcode_Solutions/Python/217._contains_duplicate.md ‎docs/Leetcode_Solutions/217._contains_duplicate.md b/‎docs/Leetcode_Solutions/Python/217._contains_duplicate.md ‎docs/Leetcode_Solutions/217._contains_duplicate.md
diff --git a/‎docs/Leetcode_Solutions/Python/218._The _Skyline_Problem .md ‎docs/Leetcode_Solutions/218._The _Skyline_Problem .md b/‎docs/Leetcode_Solutions/Python/218._The _Skyline_Problem .md ‎docs/Leetcode_Solutions/218._The _Skyline_Problem .md
diff --git a/‎docs/Leetcode_Solutions/Python/219._contains_duplicate_ii.md ‎docs/Leetcode_Solutions/219._contains_duplicate_ii.md b/‎docs/Leetcode_Solutions/Python/219._contains_duplicate_ii.md ‎docs/Leetcode_Solutions/219._contains_duplicate_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/221._maximal_square.md ‎docs/Leetcode_Solutions/221._maximal_square.md b/‎docs/Leetcode_Solutions/Python/221._maximal_square.md ‎docs/Leetcode_Solutions/221._maximal_square.md
diff --git a/‎docs/Leetcode_Solutions/Python/222._count_complete_tree_nodes.md ‎docs/Leetcode_Solutions/222._count_complete_tree_nodes.md b/‎docs/Leetcode_Solutions/Python/222._count_complete_tree_nodes.md ‎docs/Leetcode_Solutions/222._count_complete_tree_nodes.md
diff --git a/‎docs/Leetcode_Solutions/Python/223._rectangle_area.md ‎docs/Leetcode_Solutions/223._rectangle_area.md b/‎docs/Leetcode_Solutions/Python/223._rectangle_area.md ‎docs/Leetcode_Solutions/223._rectangle_area.md
diff --git a/‎docs/Leetcode_Solutions/Python/224. Basic Calculator .md ‎docs/Leetcode_Solutions/224. Basic Calculator .md b/‎docs/Leetcode_Solutions/Python/224. Basic Calculator .md ‎docs/Leetcode_Solutions/224. Basic Calculator .md
diff --git a/‎docs/Leetcode_Solutions/Python/225._implement_stack_using_queues.md ‎docs/Leetcode_Solutions/225._implement_stack_using_queues.md b/‎docs/Leetcode_Solutions/Python/225._implement_stack_using_queues.md ‎docs/Leetcode_Solutions/225._implement_stack_using_queues.md
diff --git a/‎docs/Leetcode_Solutions/Python/226._invert_binary_tree.md ‎docs/Leetcode_Solutions/226._invert_binary_tree.md b/‎docs/Leetcode_Solutions/Python/226._invert_binary_tree.md ‎docs/Leetcode_Solutions/226._invert_binary_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/227._basic_calculator_ii.md ‎docs/Leetcode_Solutions/227._basic_calculator_ii.md b/‎docs/Leetcode_Solutions/Python/227._basic_calculator_ii.md ‎docs/Leetcode_Solutions/227._basic_calculator_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/228._summary_ranges.md ‎docs/Leetcode_Solutions/228._summary_ranges.md b/‎docs/Leetcode_Solutions/Python/228._summary_ranges.md ‎docs/Leetcode_Solutions/228._summary_ranges.md
diff --git a/‎docs/Leetcode_Solutions/Python/229._majority_element_ii.md ‎docs/Leetcode_Solutions/229._majority_element_ii.md b/‎docs/Leetcode_Solutions/Python/229._majority_element_ii.md ‎docs/Leetcode_Solutions/229._majority_element_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/230._kth_smallest_element_in_a_bst.md ‎docs/Leetcode_Solutions/230._kth_smallest_element_in_a_bst.md b/‎docs/Leetcode_Solutions/Python/230._kth_smallest_element_in_a_bst.md ‎docs/Leetcode_Solutions/230._kth_smallest_element_in_a_bst.md
diff --git a/‎docs/Leetcode_Solutions/Python/231. _Power_of_Two.md ‎docs/Leetcode_Solutions/231. _Power_of_Two.md b/‎docs/Leetcode_Solutions/Python/231. _Power_of_Two.md ‎docs/Leetcode_Solutions/231. _Power_of_Two.md
diff --git a/‎docs/Leetcode_Solutions/Python/232._implement_queue_using_stacks.md ‎docs/Leetcode_Solutions/232._implement_queue_using_stacks.md b/‎docs/Leetcode_Solutions/Python/232._implement_queue_using_stacks.md ‎docs/Leetcode_Solutions/232._implement_queue_using_stacks.md
diff --git a/‎docs/Leetcode_Solutions/Python/234._palindrome_linked_list.md ‎docs/Leetcode_Solutions/234._palindrome_linked_list.md b/‎docs/Leetcode_Solutions/Python/234._palindrome_linked_list.md ‎docs/Leetcode_Solutions/234._palindrome_linked_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/235._lowest_common_ancestor_of_a_binary_search_tree.md ‎docs/Leetcode_Solutions/235._lowest_common_ancestor_of_a_binary_search_tree.md b/‎docs/Leetcode_Solutions/Python/235._lowest_common_ancestor_of_a_binary_search_tree.md ‎docs/Leetcode_Solutions/235._lowest_common_ancestor_of_a_binary_search_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/236._lowest_common_ancestor_of_a_binary_tree.md ‎docs/Leetcode_Solutions/236._lowest_common_ancestor_of_a_binary_tree.md b/‎docs/Leetcode_Solutions/Python/236._lowest_common_ancestor_of_a_binary_tree.md ‎docs/Leetcode_Solutions/236._lowest_common_ancestor_of_a_binary_tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/237._delete_node_in_a_linked_list.md ‎docs/Leetcode_Solutions/237._delete_node_in_a_linked_list.md b/‎docs/Leetcode_Solutions/Python/237._delete_node_in_a_linked_list.md ‎docs/Leetcode_Solutions/237._delete_node_in_a_linked_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/238._product_of_array_except_self.md ‎docs/Leetcode_Solutions/238._product_of_array_except_self.md b/‎docs/Leetcode_Solutions/Python/238._product_of_array_except_self.md ‎docs/Leetcode_Solutions/238._product_of_array_except_self.md
diff --git a/‎docs/Leetcode_Solutions/Python/240._search_a_2d_matrix_ii.md ‎docs/Leetcode_Solutions/240._search_a_2d_matrix_ii.md b/‎docs/Leetcode_Solutions/Python/240._search_a_2d_matrix_ii.md ‎docs/Leetcode_Solutions/240._search_a_2d_matrix_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/242._valid_anagram.md ‎docs/Leetcode_Solutions/242._valid_anagram.md b/‎docs/Leetcode_Solutions/Python/242._valid_anagram.md ‎docs/Leetcode_Solutions/242._valid_anagram.md
diff --git a/‎docs/Leetcode_Solutions/Python/252. Meeting Rooms.md ‎docs/Leetcode_Solutions/252. Meeting Rooms.md b/‎docs/Leetcode_Solutions/Python/252. Meeting Rooms.md ‎docs/Leetcode_Solutions/252. Meeting Rooms.md
diff --git a/‎docs/Leetcode_Solutions/Python/255._Verify_Preorder_Sequence_in_Binary_Search_Tree.md ‎docs/Leetcode_Solutions/255._Verify_Preorder_Sequence_in_Binary_Search_Tree.md b/‎docs/Leetcode_Solutions/Python/255._Verify_Preorder_Sequence_in_Binary_Search_Tree.md ‎docs/Leetcode_Solutions/255._Verify_Preorder_Sequence_in_Binary_Search_Tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/256. Paint House.md ‎docs/Leetcode_Solutions/256. Paint House.md b/‎docs/Leetcode_Solutions/Python/256. Paint House.md ‎docs/Leetcode_Solutions/256. Paint House.md
diff --git a/‎docs/Leetcode_Solutions/Python/257._binary_tree_paths.md ‎docs/Leetcode_Solutions/257._binary_tree_paths.md b/‎docs/Leetcode_Solutions/Python/257._binary_tree_paths.md ‎docs/Leetcode_Solutions/257._binary_tree_paths.md
diff --git a/‎docs/Leetcode_Solutions/Python/258_ Add_Digits.md ‎docs/Leetcode_Solutions/258_ Add_Digits.md b/‎docs/Leetcode_Solutions/Python/258_ Add_Digits.md ‎docs/Leetcode_Solutions/258_ Add_Digits.md
diff --git a/‎docs/Leetcode_Solutions/Python/261. Graph Valid Tree.md ‎docs/Leetcode_Solutions/261. Graph Valid Tree.md b/‎docs/Leetcode_Solutions/Python/261. Graph Valid Tree.md ‎docs/Leetcode_Solutions/261. Graph Valid Tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/263._ugly_number.md ‎docs/Leetcode_Solutions/263._ugly_number.md b/‎docs/Leetcode_Solutions/Python/263._ugly_number.md ‎docs/Leetcode_Solutions/263._ugly_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/264._ugly_number_ii.md ‎docs/Leetcode_Solutions/264._ugly_number_ii.md b/‎docs/Leetcode_Solutions/Python/264._ugly_number_ii.md ‎docs/Leetcode_Solutions/264._ugly_number_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/265. Paint House II.md ‎docs/Leetcode_Solutions/265. Paint House II.md b/‎docs/Leetcode_Solutions/Python/265. Paint House II.md ‎docs/Leetcode_Solutions/265. Paint House II.md
diff --git a/‎docs/Leetcode_Solutions/Python/266. Palindrome Permutation.md ‎docs/Leetcode_Solutions/266. Palindrome Permutation.md b/‎docs/Leetcode_Solutions/Python/266. Palindrome Permutation.md ‎docs/Leetcode_Solutions/266. Palindrome Permutation.md
diff --git a/‎docs/Leetcode_Solutions/Python/267. Palindrome Permutation II.md ‎docs/Leetcode_Solutions/267. Palindrome Permutation II.md b/‎docs/Leetcode_Solutions/Python/267. Palindrome Permutation II.md ‎docs/Leetcode_Solutions/267. Palindrome Permutation II.md
diff --git a/‎docs/Leetcode_Solutions/Python/268._missing_number.md ‎docs/Leetcode_Solutions/268._missing_number.md b/‎docs/Leetcode_Solutions/Python/268._missing_number.md ‎docs/Leetcode_Solutions/268._missing_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/270. Closest Binary Search Tree Value.md ‎docs/Leetcode_Solutions/270. Closest Binary Search Tree Value.md b/‎docs/Leetcode_Solutions/Python/270. Closest Binary Search Tree Value.md ‎docs/Leetcode_Solutions/270. Closest Binary Search Tree Value.md
diff --git a/‎docs/Leetcode_Solutions/Python/276. Paint Fence.md ‎docs/Leetcode_Solutions/276. Paint Fence.md b/‎docs/Leetcode_Solutions/Python/276. Paint Fence.md ‎docs/Leetcode_Solutions/276. Paint Fence.md
diff --git a/‎docs/Leetcode_Solutions/Python/277. Find the Celebrity.md ‎docs/Leetcode_Solutions/277. Find the Celebrity.md b/‎docs/Leetcode_Solutions/Python/277. Find the Celebrity.md ‎docs/Leetcode_Solutions/277. Find the Celebrity.md
diff --git a/‎docs/Leetcode_Solutions/Python/278._First_Bad _Version.md ‎docs/Leetcode_Solutions/278._First_Bad _Version.md b/‎docs/Leetcode_Solutions/Python/278._First_Bad _Version.md ‎docs/Leetcode_Solutions/278._First_Bad _Version.md
diff --git a/‎docs/Leetcode_Solutions/Python/279._perfect_squares.md ‎docs/Leetcode_Solutions/279._perfect_squares.md b/‎docs/Leetcode_Solutions/Python/279._perfect_squares.md ‎docs/Leetcode_Solutions/279._perfect_squares.md
diff --git a/‎docs/Leetcode_Solutions/Python/280._Wiggle_Sort.md ‎docs/Leetcode_Solutions/280._Wiggle_Sort.md b/‎docs/Leetcode_Solutions/Python/280._Wiggle_Sort.md ‎docs/Leetcode_Solutions/280._Wiggle_Sort.md
diff --git a/‎docs/Leetcode_Solutions/Python/283._move_zeroes.md ‎docs/Leetcode_Solutions/283._move_zeroes.md b/‎docs/Leetcode_Solutions/Python/283._move_zeroes.md ‎docs/Leetcode_Solutions/283._move_zeroes.md
diff --git a/‎docs/Leetcode_Solutions/Python/285._inorder_successor_in_bst.md ‎docs/Leetcode_Solutions/285._inorder_successor_in_bst.md b/‎docs/Leetcode_Solutions/Python/285._inorder_successor_in_bst.md ‎docs/Leetcode_Solutions/285._inorder_successor_in_bst.md
diff --git a/‎docs/Leetcode_Solutions/Python/286. Walls and Gates.md ‎docs/Leetcode_Solutions/286. Walls and Gates.md b/‎docs/Leetcode_Solutions/Python/286. Walls and Gates.md ‎docs/Leetcode_Solutions/286. Walls and Gates.md
diff --git a/‎docs/Leetcode_Solutions/Python/289._game_of_life.md ‎docs/Leetcode_Solutions/289._game_of_life.md b/‎docs/Leetcode_Solutions/Python/289._game_of_life.md ‎docs/Leetcode_Solutions/289._game_of_life.md
diff --git a/‎docs/Leetcode_Solutions/Python/290._word_pattern.md ‎docs/Leetcode_Solutions/290._word_pattern.md b/‎docs/Leetcode_Solutions/Python/290._word_pattern.md ‎docs/Leetcode_Solutions/290._word_pattern.md
diff --git a/‎docs/Leetcode_Solutions/Python/292._nim_game.md ‎docs/Leetcode_Solutions/292._nim_game.md b/‎docs/Leetcode_Solutions/Python/292._nim_game.md ‎docs/Leetcode_Solutions/292._nim_game.md
diff --git a/‎docs/Leetcode_Solutions/Python/293._Flip_Game.md ‎docs/Leetcode_Solutions/293._Flip_Game.md b/‎docs/Leetcode_Solutions/Python/293._Flip_Game.md ‎docs/Leetcode_Solutions/293._Flip_Game.md
diff --git a/‎docs/Leetcode_Solutions/Python/296. Best Meeting Point.md ‎docs/Leetcode_Solutions/296. Best Meeting Point.md b/‎docs/Leetcode_Solutions/Python/296. Best Meeting Point.md ‎docs/Leetcode_Solutions/296. Best Meeting Point.md
diff --git a/‎docs/Leetcode_Solutions/Python/298. Binary Tree Longest Consecutive Sequence.md ‎docs/Leetcode_Solutions/298. Binary Tree Longest Consecutive Sequence.md b/‎docs/Leetcode_Solutions/Python/298. Binary Tree Longest Consecutive Sequence.md ‎docs/Leetcode_Solutions/298. Binary Tree Longest Consecutive Sequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/299._bulls_and_cows.md ‎docs/Leetcode_Solutions/299._bulls_and_cows.md b/‎docs/Leetcode_Solutions/Python/299._bulls_and_cows.md ‎docs/Leetcode_Solutions/299._bulls_and_cows.md
diff --git a/‎docs/Leetcode_Solutions/Python/300._longest_increasing_subsequence.md ‎docs/Leetcode_Solutions/300._longest_increasing_subsequence.md b/‎docs/Leetcode_Solutions/Python/300._longest_increasing_subsequence.md ‎docs/Leetcode_Solutions/300._longest_increasing_subsequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/303._range_sum_query_-_immutable.md ‎docs/Leetcode_Solutions/303._range_sum_query_-_immutable.md b/‎docs/Leetcode_Solutions/Python/303._range_sum_query_-_immutable.md ‎docs/Leetcode_Solutions/303._range_sum_query_-_immutable.md
diff --git a/‎docs/Leetcode_Solutions/Python/316._Remove_Duplicate_Letters.md ‎docs/Leetcode_Solutions/316._Remove_Duplicate_Letters.md b/‎docs/Leetcode_Solutions/Python/316._Remove_Duplicate_Letters.md ‎docs/Leetcode_Solutions/316._Remove_Duplicate_Letters.md
diff --git a/‎docs/Leetcode_Solutions/Python/319._Bulb_Switcher.md ‎docs/Leetcode_Solutions/319._Bulb_Switcher.md b/‎docs/Leetcode_Solutions/Python/319._Bulb_Switcher.md ‎docs/Leetcode_Solutions/319._Bulb_Switcher.md
diff --git a/‎docs/Leetcode_Solutions/Python/322. Coin Change.md ‎docs/Leetcode_Solutions/322. Coin Change.md b/‎docs/Leetcode_Solutions/Python/322. Coin Change.md ‎docs/Leetcode_Solutions/322. Coin Change.md
diff --git a/‎docs/Leetcode_Solutions/Python/323. Number of Connected Components in an Undirected Graph.md ‎docs/Leetcode_Solutions/323. Number of Connected Components in an Undirected Graph.md b/‎docs/Leetcode_Solutions/Python/323. Number of Connected Components in an Undirected Graph.md ‎docs/Leetcode_Solutions/323. Number of Connected Components in an Undirected Graph.md
diff --git a/‎docs/Leetcode_Solutions/Python/324._Wiggle_Sort_II.md ‎docs/Leetcode_Solutions/324._Wiggle_Sort_II.md b/‎docs/Leetcode_Solutions/Python/324._Wiggle_Sort_II.md ‎docs/Leetcode_Solutions/324._Wiggle_Sort_II.md
diff --git a/‎docs/Leetcode_Solutions/Python/326._power_of_three.md ‎docs/Leetcode_Solutions/326._power_of_three.md b/‎docs/Leetcode_Solutions/Python/326._power_of_three.md ‎docs/Leetcode_Solutions/326._power_of_three.md
diff --git a/‎docs/Leetcode_Solutions/Python/328._odd_even_linked_list.md ‎docs/Leetcode_Solutions/328._odd_even_linked_list.md b/‎docs/Leetcode_Solutions/Python/328._odd_even_linked_list.md ‎docs/Leetcode_Solutions/328._odd_even_linked_list.md
diff --git a/‎docs/Leetcode_Solutions/Python/334._increasing_triplet_subsequence.md ‎docs/Leetcode_Solutions/334._increasing_triplet_subsequence.md b/‎docs/Leetcode_Solutions/Python/334._increasing_triplet_subsequence.md ‎docs/Leetcode_Solutions/334._increasing_triplet_subsequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/337._house_robber_iii.md ‎docs/Leetcode_Solutions/337._house_robber_iii.md b/‎docs/Leetcode_Solutions/Python/337._house_robber_iii.md ‎docs/Leetcode_Solutions/337._house_robber_iii.md
diff --git a/‎docs/Leetcode_Solutions/Python/338. Counting Bits.md ‎docs/Leetcode_Solutions/338. Counting Bits.md b/‎docs/Leetcode_Solutions/Python/338. Counting Bits.md ‎docs/Leetcode_Solutions/338. Counting Bits.md
diff --git a/‎docs/Leetcode_Solutions/Python/339. Nested List Weight Sum.md ‎docs/Leetcode_Solutions/339. Nested List Weight Sum.md b/‎docs/Leetcode_Solutions/Python/339. Nested List Weight Sum.md ‎docs/Leetcode_Solutions/339. Nested List Weight Sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/341._Flatten_Nested_List_Iterator.md ‎docs/Leetcode_Solutions/341._Flatten_Nested_List_Iterator.md b/‎docs/Leetcode_Solutions/Python/341._Flatten_Nested_List_Iterator.md ‎docs/Leetcode_Solutions/341._Flatten_Nested_List_Iterator.md
diff --git a/‎docs/Leetcode_Solutions/Python/342._Power_of_Four.md ‎docs/Leetcode_Solutions/342._Power_of_Four.md b/‎docs/Leetcode_Solutions/Python/342._Power_of_Four.md ‎docs/Leetcode_Solutions/342._Power_of_Four.md
diff --git a/‎docs/Leetcode_Solutions/Python/344._reverse_string.md ‎docs/Leetcode_Solutions/344._reverse_string.md b/‎docs/Leetcode_Solutions/Python/344._reverse_string.md ‎docs/Leetcode_Solutions/344._reverse_string.md
diff --git a/‎docs/Leetcode_Solutions/Python/345._Reverse_Vowels_of_a_String.md ‎docs/Leetcode_Solutions/345._Reverse_Vowels_of_a_String.md b/‎docs/Leetcode_Solutions/Python/345._Reverse_Vowels_of_a_String.md ‎docs/Leetcode_Solutions/345._Reverse_Vowels_of_a_String.md
diff --git a/‎docs/Leetcode_Solutions/Python/349._intersection_of_two_arrays.md ‎docs/Leetcode_Solutions/349._intersection_of_two_arrays.md b/‎docs/Leetcode_Solutions/Python/349._intersection_of_two_arrays.md ‎docs/Leetcode_Solutions/349._intersection_of_two_arrays.md
diff --git a/‎docs/Leetcode_Solutions/Python/350._intersection_of_two_arrays_ii.md ‎docs/Leetcode_Solutions/350._intersection_of_two_arrays_ii.md b/‎docs/Leetcode_Solutions/Python/350._intersection_of_two_arrays_ii.md ‎docs/Leetcode_Solutions/350._intersection_of_two_arrays_ii.md
diff --git a/‎docs/Leetcode_Solutions/Python/353. Design Snake Game.md ‎docs/Leetcode_Solutions/353. Design Snake Game.md b/‎docs/Leetcode_Solutions/Python/353. Design Snake Game.md ‎docs/Leetcode_Solutions/353. Design Snake Game.md
diff --git a/‎docs/Leetcode_Solutions/Python/361._Bomb_Enemy.md ‎docs/Leetcode_Solutions/361._Bomb_Enemy.md b/‎docs/Leetcode_Solutions/Python/361._Bomb_Enemy.md ‎docs/Leetcode_Solutions/361._Bomb_Enemy.md
diff --git a/‎docs/Leetcode_Solutions/Python/364. Nested List Weight Sum II.md ‎docs/Leetcode_Solutions/364. Nested List Weight Sum II.md b/‎docs/Leetcode_Solutions/Python/364. Nested List Weight Sum II.md ‎docs/Leetcode_Solutions/364. Nested List Weight Sum II.md
diff --git a/‎docs/Leetcode_Solutions/Python/366. Find Leaves of Binary Tree.md ‎docs/Leetcode_Solutions/366. Find Leaves of Binary Tree.md b/‎docs/Leetcode_Solutions/Python/366. Find Leaves of Binary Tree.md ‎docs/Leetcode_Solutions/366. Find Leaves of Binary Tree.md
diff --git a/‎docs/Leetcode_Solutions/Python/367._valid_perfect_square.md ‎docs/Leetcode_Solutions/367._valid_perfect_square.md b/‎docs/Leetcode_Solutions/Python/367._valid_perfect_square.md ‎docs/Leetcode_Solutions/367._valid_perfect_square.md
diff --git a/‎docs/Leetcode_Solutions/Python/369.Plus One Linked List.md ‎docs/Leetcode_Solutions/369.Plus One Linked List.md b/‎docs/Leetcode_Solutions/Python/369.Plus One Linked List.md ‎docs/Leetcode_Solutions/369.Plus One Linked List.md
diff --git a/‎docs/Leetcode_Solutions/Python/371._sum_of_two_integers.md ‎docs/Leetcode_Solutions/371._sum_of_two_integers.md b/‎docs/Leetcode_Solutions/Python/371._sum_of_two_integers.md ‎docs/Leetcode_Solutions/371._sum_of_two_integers.md
diff --git a/‎docs/Leetcode_Solutions/Python/374._Guess_Number_Higher_or_Lower.md ‎docs/Leetcode_Solutions/374._Guess_Number_Higher_or_Lower.md b/‎docs/Leetcode_Solutions/Python/374._Guess_Number_Higher_or_Lower.md ‎docs/Leetcode_Solutions/374._Guess_Number_Higher_or_Lower.md
diff --git a/‎docs/Leetcode_Solutions/Python/377._combination_sum_iv.md ‎docs/Leetcode_Solutions/377._combination_sum_iv.md b/‎docs/Leetcode_Solutions/Python/377._combination_sum_iv.md ‎docs/Leetcode_Solutions/377._combination_sum_iv.md
diff --git a/‎docs/Leetcode_Solutions/Python/378._kth_smallest_element_in_a_sorted_matrix.md ‎docs/Leetcode_Solutions/378._kth_smallest_element_in_a_sorted_matrix.md b/‎docs/Leetcode_Solutions/Python/378._kth_smallest_element_in_a_sorted_matrix.md ‎docs/Leetcode_Solutions/378._kth_smallest_element_in_a_sorted_matrix.md
diff --git a/‎docs/Leetcode_Solutions/Python/380. Insert Delete GetRandom O(1).md ‎docs/Leetcode_Solutions/380. Insert Delete GetRandom O(1).md b/‎docs/Leetcode_Solutions/Python/380. Insert Delete GetRandom O(1).md ‎docs/Leetcode_Solutions/380. Insert Delete GetRandom O(1).md
diff --git a/‎docs/Leetcode_Solutions/Python/381. Insert Delete GetRandom O(1) - Duplicates allowed.md ‎docs/Leetcode_Solutions/381. Insert Delete GetRandom O(1) - Duplicates allowed.md b/‎docs/Leetcode_Solutions/Python/381. Insert Delete GetRandom O(1) - Duplicates allowed.md ‎docs/Leetcode_Solutions/381. Insert Delete GetRandom O(1) - Duplicates allowed.md
diff --git a/‎docs/Leetcode_Solutions/Python/382._linked_list_random_node.md ‎docs/Leetcode_Solutions/382._linked_list_random_node.md b/‎docs/Leetcode_Solutions/Python/382._linked_list_random_node.md ‎docs/Leetcode_Solutions/382._linked_list_random_node.md
diff --git a/‎docs/Leetcode_Solutions/Python/383._ransom_note.md ‎docs/Leetcode_Solutions/383._ransom_note.md b/‎docs/Leetcode_Solutions/Python/383._ransom_note.md ‎docs/Leetcode_Solutions/383._ransom_note.md
diff --git a/‎docs/Leetcode_Solutions/Python/384. Shuffle an Array.md ‎docs/Leetcode_Solutions/384. Shuffle an Array.md b/‎docs/Leetcode_Solutions/Python/384. Shuffle an Array.md ‎docs/Leetcode_Solutions/384. Shuffle an Array.md
diff --git a/‎docs/Leetcode_Solutions/Python/387._first_unique_character_in_a_string.md ‎docs/Leetcode_Solutions/387._first_unique_character_in_a_string.md b/‎docs/Leetcode_Solutions/Python/387._first_unique_character_in_a_string.md ‎docs/Leetcode_Solutions/387._first_unique_character_in_a_string.md
diff --git a/‎docs/Leetcode_Solutions/Python/388._Longest_Absolute_File_Path.md ‎docs/Leetcode_Solutions/388._Longest_Absolute_File_Path.md b/‎docs/Leetcode_Solutions/Python/388._Longest_Absolute_File_Path.md ‎docs/Leetcode_Solutions/388._Longest_Absolute_File_Path.md
diff --git a/‎docs/Leetcode_Solutions/Python/389._find_the_difference.md ‎docs/Leetcode_Solutions/389._find_the_difference.md b/‎docs/Leetcode_Solutions/Python/389._find_the_difference.md ‎docs/Leetcode_Solutions/389._find_the_difference.md
diff --git a/‎docs/Leetcode_Solutions/Python/392._is_subsequence.md ‎docs/Leetcode_Solutions/392._is_subsequence.md b/‎docs/Leetcode_Solutions/Python/392._is_subsequence.md ‎docs/Leetcode_Solutions/392._is_subsequence.md
diff --git a/‎docs/Leetcode_Solutions/Python/394._decode_string.md ‎docs/Leetcode_Solutions/394._decode_string.md b/‎docs/Leetcode_Solutions/Python/394._decode_string.md ‎docs/Leetcode_Solutions/394._decode_string.md
diff --git a/‎docs/Leetcode_Solutions/Python/400. Nth Digit.md ‎docs/Leetcode_Solutions/400. Nth Digit.md b/‎docs/Leetcode_Solutions/Python/400. Nth Digit.md ‎docs/Leetcode_Solutions/400. Nth Digit.md
diff --git a/‎docs/Leetcode_Solutions/Python/401._binary_watch.md ‎docs/Leetcode_Solutions/401._binary_watch.md b/‎docs/Leetcode_Solutions/Python/401._binary_watch.md ‎docs/Leetcode_Solutions/401._binary_watch.md
diff --git a/‎docs/Leetcode_Solutions/Python/404._sum_of_left_leaves.md ‎docs/Leetcode_Solutions/404._sum_of_left_leaves.md b/‎docs/Leetcode_Solutions/Python/404._sum_of_left_leaves.md ‎docs/Leetcode_Solutions/404._sum_of_left_leaves.md
diff --git a/‎docs/Leetcode_Solutions/Python/405. Convert a Number to Hexadecimal.md ‎docs/Leetcode_Solutions/405. Convert a Number to Hexadecimal.md b/‎docs/Leetcode_Solutions/Python/405. Convert a Number to Hexadecimal.md ‎docs/Leetcode_Solutions/405. Convert a Number to Hexadecimal.md
diff --git a/‎docs/Leetcode_Solutions/Python/406._Queue_Reconstruction_by_Height.md ‎docs/Leetcode_Solutions/406._Queue_Reconstruction_by_Height.md b/‎docs/Leetcode_Solutions/Python/406._Queue_Reconstruction_by_Height.md ‎docs/Leetcode_Solutions/406._Queue_Reconstruction_by_Height.md
diff --git a/‎docs/Leetcode_Solutions/Python/412._fizz_buzz.md ‎docs/Leetcode_Solutions/412._fizz_buzz.md b/‎docs/Leetcode_Solutions/Python/412._fizz_buzz.md ‎docs/Leetcode_Solutions/412._fizz_buzz.md
diff --git a/‎docs/Leetcode_Solutions/Python/413. Arithmetic Slices.md ‎docs/Leetcode_Solutions/413. Arithmetic Slices.md b/‎docs/Leetcode_Solutions/Python/413. Arithmetic Slices.md ‎docs/Leetcode_Solutions/413. Arithmetic Slices.md
diff --git a/‎docs/Leetcode_Solutions/Python/414._third_maximum_number.md ‎docs/Leetcode_Solutions/414._third_maximum_number.md b/‎docs/Leetcode_Solutions/Python/414._third_maximum_number.md ‎docs/Leetcode_Solutions/414._third_maximum_number.md
diff --git a/‎docs/Leetcode_Solutions/Python/415._add_strings.md ‎docs/Leetcode_Solutions/415._add_strings.md b/‎docs/Leetcode_Solutions/Python/415._add_strings.md ‎docs/Leetcode_Solutions/415._add_strings.md
diff --git a/‎docs/Leetcode_Solutions/Python/416. Partition Equal Subset Sum.md ‎docs/Leetcode_Solutions/416. Partition Equal Subset Sum.md b/‎docs/Leetcode_Solutions/Python/416. Partition Equal Subset Sum.md ‎docs/Leetcode_Solutions/416. Partition Equal Subset Sum.md
diff --git a/‎docs/Leetcode_Solutions/Python/421._Maximum_XOR_of_Two_Numbers_in_an_Array.md ‎docs/Leetcode_Solutions/421._Maximum_XOR_of_Two_Numbers_in_an_Array.md b/‎docs/Leetcode_Solutions/Python/421._Maximum_XOR_of_Two_Numbers_in_an_Array.md ‎docs/Leetcode_Solutions/421._Maximum_XOR_of_Two_Numbers_in_an_Array.md
diff --git a/‎docs/Leetcode_Solutions/Python/422. Valid Word Square.md ‎docs/Leetcode_Solutions/422. Valid Word Square.md b/‎docs/Leetcode_Solutions/Python/422. Valid Word Square.md ‎docs/Leetcode_Solutions/422. Valid Word Square.md
diff --git a/‎docs/Leetcode_Solutions/Python/434._number_of_segments_in_a_string.md ‎docs/Leetcode_Solutions/434._number_of_segments_in_a_string.md b/‎docs/Leetcode_Solutions/Python/434._number_of_segments_in_a_string.md ‎docs/Leetcode_Solutions/434._number_of_segments_in_a_string.md
diff --git a/‎docs/Leetcode_Solutions/Python/437._path_sum_iii.md ‎docs/Leetcode_Solutions/437._path_sum_iii.md b/‎docs/Leetcode_Solutions/Python/437._path_sum_iii.md ‎docs/Leetcode_Solutions/437._path_sum_iii.md
diff --git a/‎docs/Leetcode_Solutions/Python/438._Find_All_Anagrams_in_a_String.md ‎docs/Leetcode_Solutions/438._Find_All_Anagrams_in_a_String.md b/‎docs/Leetcode_Solutions/Python/438._Find_All_Anagrams_in_a_String.md ‎docs/Leetcode_Solutions/438._Find_All_Anagrams_in_a_String.md
diff --git a/‎docs/Leetcode_Solutions/Python/439. Ternary Expression Parser.md ‎docs/Leetcode_Solutions/439. Ternary Expression Parser.md b/‎docs/Leetcode_Solutions/Python/439. Ternary Expression Parser.md ‎docs/Leetcode_Solutions/439. Ternary Expression Parser.md
diff --git a/‎docs/Leetcode_Solutions/Python/441._arranging_coins.md ‎docs/Leetcode_Solutions/441._arranging_coins.md b/‎docs/Leetcode_Solutions/Python/441._arranging_coins.md ‎docs/Leetcode_Solutions/441._arranging_coins.md
diff --git a/‎docs/Leetcode_Solutions/Python/448._Find_All_Numbers_Disappeared_in_an_Array.md ‎docs/Leetcode_Solutions/448._Find_All_Numbers_Disappeared_in_an_Array.md b/‎docs/Leetcode_Solutions/Python/448._Find_All_Numbers_Disappeared_in_an_Array.md ‎docs/Leetcode_Solutions/448._Find_All_Numbers_Disappeared_in_an_Array.md
diff --git a/‎docs/Leetcode_Solutions/Python/450. Delete Node in a BST.md ‎docs/Leetcode_Solutions/450. Delete Node in a BST.md b/‎docs/Leetcode_Solutions/Python/450. Delete Node in a BST.md ‎docs/Leetcode_Solutions/450. Delete Node in a BST.md
diff --git a/‎docs/Leetcode_Solutions/Python/453._Minimum_Moves_to_Equal_Array_Elements.md ‎docs/Leetcode_Solutions/453._Minimum_Moves_to_Equal_Array_Elements.md b/‎docs/Leetcode_Solutions/Python/453._Minimum_Moves_to_Equal_Array_Elements.md ‎docs/Leetcode_Solutions/453._Minimum_Moves_to_Equal_Array_Elements.md
diff --git a/‎docs/Leetcode_Solutions/Python/459._Repeated_Substring_Pattern.md ‎docs/Leetcode_Solutions/459._Repeated_Substring_Pattern.md b/‎docs/Leetcode_Solutions/Python/459._Repeated_Substring_Pattern.md ‎docs/Leetcode_Solutions/459._Repeated_Substring_Pattern.md
diff --git a/‎docs/Leetcode_Solutions/Python/461._Hamming Distance.md ‎docs/Leetcode_Solutions/461._Hamming Distance.md b/‎docs/Leetcode_Solutions/Python/461._Hamming Distance.md ‎docs/Leetcode_Solutions/461._Hamming Distance.md
diff --git a/‎docs/Leetcode_Solutions/Python/463._Island_Perimeter.md ‎docs/Leetcode_Solutions/463._Island_Perimeter.md b/‎docs/Leetcode_Solutions/Python/463._Island_Perimeter.md ‎docs/Leetcode_Solutions/463._Island_Perimeter.md
diff --git a/‎docs/Leetcode_Solutions/Python/467._Unique_Substrings_in_Wraparound_String.md ‎docs/Leetcode_Solutions/467._Unique_Substrings_in_Wraparound_String.md b/‎docs/Leetcode_Solutions/Python/467._Unique_Substrings_in_Wraparound_String.md ‎docs/Leetcode_Solutions/467._Unique_Substrings_in_Wraparound_String.md
diff --git a/‎docs/Leetcode_Solutions/Python/469. Convex Polygon.md ‎docs/Leetcode_Solutions/469. Convex Polygon.md b/‎docs/Leetcode_Solutions/Python/469. Convex Polygon.md ‎docs/Leetcode_Solutions/469. Convex Polygon.md
diff --git a/‎docs/Leetcode_Solutions/Python/476._Number_Complement.md ‎docs/Leetcode_Solutions/476._Number_Complement.md b/‎docs/Leetcode_Solutions/Python/476._Number_Complement.md ‎docs/Leetcode_Solutions/476._Number_Complement.md
diff --git a/‎docs/Leetcode_Solutions/Python/477._Total_Hamming_Distance.md ‎docs/Leetcode_Solutions/477._Total_Hamming_Distance.md b/‎docs/Leetcode_Solutions/Python/477._Total_Hamming_Distance.md ‎docs/Leetcode_Solutions/477._Total_Hamming_Distance.md
diff --git a/‎docs/Leetcode_Solutions/Python/485._Max_Consecutive_Ones.md ‎docs/Leetcode_Solutions/485._Max_Consecutive_Ones.md b/‎docs/Leetcode_Solutions/Python/485._Max_Consecutive_Ones.md ‎docs/Leetcode_Solutions/485._Max_Consecutive_Ones.md
diff --git a/‎docs/Leetcode_Solutions/Python/587._Erect_the_Fence .md ‎docs/Leetcode_Solutions/587._Erect_the_Fence .md b/‎docs/Leetcode_Solutions/Python/587._Erect_the_Fence .md ‎docs/Leetcode_Solutions/587._Erect_the_Fence .md
diff --git a/‎docs/Leetcode_Solutions/Python/599._Minimum_Index_Sum_of_Two_Lists.md ‎docs/Leetcode_Solutions/599._Minimum_Index_Sum_of_Two_Lists.md b/‎docs/Leetcode_Solutions/Python/599._Minimum_Index_Sum_of_Two_Lists.md ‎docs/Leetcode_Solutions/599._Minimum_Index_Sum_of_Two_Lists.md