8000 GitHub - KrisYu/LeetCode-CLRS-Python: Finally, going to take LeetCode
[go: up one dir, main page]
Skip to content

KrisYu/LeetCode-CLRS-Python

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

166 Commits
001._two_sum.md
001._two_sum.md
 
 
002._add_two_numbers.md
002._add_two_numbers.md
 
 
003._longest_substring_without_repeating_characters.md
003._longest_substring_without_repeating_characters.md
 
 
004._median_of_two_sorted_arrays.md
004._median_of_two_sorted_arrays.md
 
 
005._longest_palindromic_substring.md
005._longest_palindromic_substring.md
 
 
008._string_to_integer_(atoi).md
008._string_to_integer_(atoi).md
 
 
010._regular_expression_matching.md
010._regular_expression_matching.md
 
 
011._container_with_most_water.md
011._container_with_most_water.md
 
 
012. Integer to Roman.md
012. Integer to Roman.md
 
 
013.Roman to Integer.md
013.Roman to Integer.md
 
 
014._longest_common_prefix.md
014._longest_common_prefix.md
 
 
015._3sum.md
015._3sum.md
 
 
016._3sum_closest.md
016._3sum_closest.md
 
 
017._letter_combinations_of_a_phone_number.md
017._letter_combinations_of_a_phone_number.md
 
 
018._4sum.md
018._4sum.md
 
 
019._remove_nth_node_from_end_of_list.md
019._remove_nth_node_from_end_of_list.md
 
 
020._valid_parentheses.md
020._valid_parentheses.md
 
 
021._merge_two_sorted_lists.md
021._merge_two_sorted_lists.md
 
 
022._generate_parentheses.md
022._generate_parentheses.md
 
 
023._merge_k_sorted_lists.md
023._merge_k_sorted_lists.md
 
 
024._swap_nodes_in_pairs.md
024._swap_nodes_in_pairs.md
 
 
026._Remove_Duplicates_from_Sorted_Array.md
026._Remove_Duplicates_from_Sorted_Array.md
 
 
028._implement_strstr().md
028._implement_strstr().md
 
 
031._next_permutation.md
031._next_permutation.md
 
 
033._search_in_rotated_sorted_array.md
033._search_in_rotated_sorted_array.md
 
 
034. Search for a Range.md
034. Search for a Range.md
 
 
035._search_insert_position.md
035._search_insert_position.md
 
 
039._combination_sum.md
039._combination_sum.md
 
 
040._combination_sum_ii.md
040._combination_sum_ii.md
 
 
042._trapping_rain_water.md
042._trapping_rain_water.md
 
 
043._multiply_strings.md
043._multiply_strings.md
 
 
044._wildcard_matching.md
044._wildcard_matching.md
 
 
046._permutations.md
046._permutations.md
 
 
047._permutations_ii.md
047._permutations_ii.md
 
 
048._rotate_image.md
048._rotate_image.md
 
 
049._group_anagrams_python.md
049._group_anagrams_python.md
 
 
050._pow(x,_n).md
050._pow(x,_n).md
 
 
051._n-queens.md
051._n-queens.md
 
 
052._n-queens_ii.md
052._n-queens_ii.md
 
 
053._maximum_subarray.md
053._maximum_subarray.md
 
 
054._spiral_matrix.md
054._spiral_matrix.md
 
 
055._jump_game.md
055._jump_game.md
 
 
058._length_of_last_word.md
058._length_of_last_word.md
 
 
059._spiral_matrix_ii.md
059._spiral_matrix_ii.md
 
 
060._permutation_sequence.md
060._permutation_sequence.md
 
 
061._rotate_list.md
061._rotate_list.md
 
 
062._Unique_Paths.md
062._Unique_Paths.md
 
 
064._minimum_path_sum.md
064._minimum_path_sum.md
 
 
065.unique_paths_ii.md
065.unique_paths_ii.md
 
 
066._plus_one.md
066._plus_one.md
 
 
067._add_binary.md
067._add_binary.md
 
 
069._sqrt(x).md
069._sqrt(x).md
 
 
072._edit_distance.md
072._edit_distance.md
 
 
073. Set Matrix Zeroes.md
073. Set Matrix Zeroes.md
 
 
074._search_a_2d_matrix.md
074._search_a_2d_matrix.md
 
 
075._sort_colors.md
075._sort_colors.md
 
 
077._combinations.md
077._combinations.md
 
 
078.Subsets .md
078.Subsets .md
 
 
079._word_search.md
079._word_search.md
 
 
082._remove_duplicates_from_sorted_list_ii.md
082._remove_duplicates_from_sorted_list_ii.md
 
 
083._remove_duplicates_from_sorted_list.md
083._remove_duplicates_from_sorted_list.md
 
 
086._partition_list.md
086._partition_list.md
 
 
088._merge_sorted_array.md
088._merge_sorted_array.md
 
 
089._gray_code.md
089._gray_code.md
 
 
090._subsets_ii.md
090._subsets_ii.md
 
 
091._decode_ways.md
091._decode_ways.md
 
 
092._reverse_linked_list_ii.md
092._reverse_linked_list_ii.md
 
 
093._restore_ip_addresses.md
093._restore_ip_addresses.md
 
 
094._binary_tree_inorder_traversal.md
094._binary_tree_inorder_traversal.md
 
 
096._unique_binary_search_trees.md
096._unique_binary_search_trees.md
 
 
098._validate_binary_search_tree.md
098._validate_binary_search_tree.md
 
 
100._same_tree.md
100._same_tree.md
 
 
101._symmetric_tree.md
101._symmetric_tree.md
 
 
102._binary_tree_level_order_traversal.md
102._binary_tree_level_order_traversal.md
 
 
103._binary_tree_zigzag_level_order_traversal.md
103._binary_tree_zigzag_level_order_traversal.md
 
 
104._maximum_depth_of_binary_tree.md
104._maximum_depth_of_binary_tree.md
 
 
105._construct_binary_tree_from_preorder_and_inorder_traversal.md
105._construct_binary_tree_from_preorder_and_inorder_traversal.md
 
 
106._construct_binary_tree_from_inorder_and_postorder_traversal.md
106._construct_binary_tree_from_inorder_and_postorder_traversal.md
 
 
107._binary_tree_level_order_traversal_ii.md
107._binary_tree_level_order_traversal_ii.md
 
 
108._convert_sorted_array_to_binary_search_tree.md
108._convert_sorted_array_to_binary_search_tree.md
 
 
109._convert_sorted_list_to_binary_search_tree.md
109._convert_sorted_list_to_binary_search_tree.md
 
 
110._balanced_binary_tree.md
110._balanced_binary_tree.md
 
 
111._minimum_depth_of_binary_tree.md
111._minimum_depth_of_binary_tree.md
 
 
112._path_sum.md
112._path_sum.md
 
 
113._path_sum_ii.md
113._path_sum_ii.md
 
 
114._flatten_binary_tree_to_linked_list.md
114._flatten_binary_tree_to_linked_list.md
 
 
1143._Longest_Common_Subsequence.md
1143._Longest_Common_Subsequence.md
 
 
116._populating_next_right_pointers_in_each_node.md
116._populating_next_right_pointers_in_each_node.md
 
 
118._pascal's_triangle.md
118._pascal's_triangle.md
 
 
119. Pascal's Triangle II.md
119. Pascal's Triangle II.md
 
 
120. Triangle.md
120. Triangle.md
 
 
125._valid_palindrome.md
125._valid_palindrome.md
 
 
126. Word Ladder II.md
126. Word Ladder II.md
 
 
127._word_ladder.md
127._word_ladder.md
 
 
128._Longest_Consecutive_Sequence.md
128._Longest_Consecutive_Sequence.md
 
 
129._sum_root_to_leaf_numbers.md
129._sum_root_to_leaf_numbers.md
 
 
130._surrounded_regions.md
130._surrounded_regions.md
 
 
131._palindrome_partitioning.md
131._palindrome_partitioning.md
 
 
133._clone_graph.md
133._clone_graph.md
 
 
136._single_number.md
136._single_number.md
 
 

Repository files navigation

LeetCode × Python × CLRS

Finally, going to take LeetCode, Python can make you focus on the ideas, while CLRS is really kind of tedious, so whenever you finished some reading, you just, just would feel so happy that you can do LeetCode.

  • 📚📖✏️📓
  • 🍔🍝🍛🍣
  • 😕😐😮😏
  • 🙌👎👍💪

About

Finally, going to take LeetCode

Resources

Readme
Activity

Stars

114 stars

Watchers

6 watching

Forks

29 forks
Report repository

Releases

No releases published

Packages

No packages published
0