GitHub - jerrt2003/leetcode-in-python

Name		Name	Last commit message	Last commit date
Latest commit History 156 Commits
.svn		.svn
.vscode		.vscode
1004_Max_Consecutive_Ones_III		1004_Max_Consecutive_Ones_III
1007_Minimum_Domino_Rotations_For_Equal_Row		1007_Minimum_Domino_Rotations_For_Equal_Row
1008_Construct_Binary_Search_Tree_from_Preorder_Traversal		1008_Construct_Binary_Search_Tree_from_Preorder_Traversal
100_Same_Tree		100_Same_Tree
1011_Capacity_To_Ship_Packages_Within_D_Days		1011_Capacity_To_Ship_Packages_Within_D_Days
1019_Next_Greater_Node_In_Linked_List		1019_Next_Greater_Node_In_Linked_List
101_Symmetric_Tree		101_Symmetric_Tree
1020_Number_of_Enclaves		1020_Number_of_Enclaves
1023_Camelcase_Matching		1023_Camelcase_Matching
1024_Video_Stitching		1024_Video_Stitching
1026_Maximum_Difference_Between_Node_and_Ancestor		1026_Maximum_Difference_Between_Node_and_Ancestor
1029_Two_City_Scheduling		1029_Two_City_Scheduling
102_Binary_Tree_Level_Order_Traversal		102_Binary_Tree_Level_Order_Traversal
1031_Maximum_Sum_of_Two_Non-Overlapping_Subarrays		1031_Maximum_Sum_of_Two_Non-Overlapping_Subarrays
1032_Stream_of_Characters		1032_Stream_of_Characters
1036_Escape_a_Large_Maze		1036_Escape_a_Large_Maze
1038_Binary_Search_Tree_to_Greater_Sum_Tree		1038_Binary_Search_Tree_to_Greater_Sum_Tree
103_Binary_Tree_Zigzag_Level_Order_Traversal		103_Binary_Tree_Zigzag_Level_Order_Traversal
1047_Remove_All_Adjacent_Duplicates_In_String		1047_Remove_All_Adjacent_Duplicates_In_String
1048_Longest_String_Chain		1048_Longest_String_Chain
1049_Last_Stone_Weight_II		1049_Last_Stone_Weight_II
104_Maximum_Depth_of_Binary_Tree		104_Maximum_Depth_of_Binary_Tree
1053_Previous_Permutation_With_One_Swap		1053_Previous_Permutation_With_One_Swap
1055_Shortest_Way_to_Form_String		1055_Shortest_Way_to_Form_String
1057_Campus_Bikes		1057_Campus_Bikes
1059_All_Paths_from_Source_Lead_to_Destination		1059_All_Paths_from_Source_Lead_to_Destination
105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal		105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
1060_Missing_Element_in_Sorted_Array		1060_Missing_Element_in_Sorted_Array
1066_Campus_Bikes_II		1066_Campus_Bikes_II
106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal		106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
1074_Number_of_Submatrices_That_Sum_to_Target		1074_Number_of_Submatrices_That_Sum_to_Target
1079_Letter_Tile_Possibilities		1079_Letter_Tile_Possibilities
107_Binary_Tree_Level_Order_Traversal_II		107_Binary_Tree_Level_Order_Traversal_II
1087_Brace_Expansion		1087_Brace_Expansion
1088_Confusing_Number_II		1088_Confusing_Number_II
108_Convert_Sorted_Array_to_Binary_Search_Tree		108_Convert_Sorted_Array_to_Binary_Search_Tree
1090_Largest_Values_From_Labels		1090_Largest_Values_From_Labels
1091_Shortest_Path_in_Binary_Matrix		1091_Shortest_Path_in_Binary_Matrix
1094_Car_Pooling		1094_Car_Pooling
1095_Find_in_Mountain_Array		1095_Find_in_Mountain_Array
1096_Brace_Expansion_II		1096_Brace_Expansion_II
109_Convert_Sorted_List_to_Binary_Search_Tree		109_Convert_Sorted_List_to_Binary_Search_Tree
10_Regular_Expression_Matching		10_Regular_Expression_Matching
1102_Path_With_Maximum_Minimum_Value		1102_Path_With_Maximum_Minimum_Value
110_Balanced_Binary_Tree		110_Balanced_Binary_Tree
1110_Delete_Nodes_And_Return_Forest		1110_Delete_Nodes_And_Return_Forest
111_Minimum_Depth_of_Binary_Tree		111_Minimum_Depth_of_Binary_Tree
1123_Lowest_Common_Ancestor_of_Deepest_Leaves		1123_Lowest_Common_Ancestor_of_Deepest_Leaves
112_Path_Sum		112_Path_Sum
1130_Minimum_Cost_Tree_From_Leaf_Values		1130_Minimum_Cost_Tree_From_Leaf_Values
1136_Parallel_Courses		1136_Parallel_Courses
1138_Alphabet_Board_Path		1138_Alphabet_Board_Path
113_Path_Sum_II		113_Path_Sum_II
1144_Decrease_Elements_To_Make_Array_Zigzag		1144_Decrease_Elements_To_Make_Array_Zigzag
1145_Binary_Tree_Coloring_Game		1145_Binary_Tree_Coloring_Game
1146_Snapshot_Array		1146_Snapshot_Array
114_Flatten_Binary_Tree_to_Linked_List		114_Flatten_Binary_Tree_to_Linked_List
1153_String_Transforms_Into_Another_String		1153_String_Transforms_Into_Another_String
1157_Online_Majority_Element_In_Subarray		1157_Online_Majority_Element_In_Subarray
115_Distinct_Subsequences		115_Distinct_Subsequences
1161_Maximum_Level_Sum_of_a_Binary_Tree		1161_Maximum_Level_Sum_of_a_Binary_Tree
1167_Minimum_Cost_to_Connect_Sticks		1167_Minimum_Cost_to_Connect_Sticks
1168_Optimize_Water_Distribution_in_a_Village		1168_Optimize_Water_Distribution_in_a_Village
116_Populating_Next_Right_Pointers_in_Each_Node		116_Populating_Next_Right_Pointers_in_Each_Node
1170_Compare_Strings_by_Frequency_of_the_Smallest_Character		1170_Compare_Strings_by_Frequency_of_the_Smallest_Character
117_Populating_Next_Right_Pointers_in_Each_Node_II		117_Populating_Next_Right_Pointers_in_Each_Node_II
1182_Shortest_Distance_to_Target_Color		1182_Shortest_Distance_to_Target_Color
118_Pascal's_Triangle		118_Pascal's_Triangle
1192_Critical_Connections_in_a_Network		1192_Critical_Connections_in_a_Network
1197_Minimum_Knight_Moves		1197_Minimum_Knight_Moves
119_Pascal's_Triangle_II		119_Pascal's_Triangle_II
11_Container_With_Most_Water		11_Container_With_Most_Water
1203_Sort_Items_by_Groups_Respecting_Dependencies		1203_Sort_Items_by_Groups_Respecting_Dependencies
1209_Remove_All_Adjacent_Duplicates_in_String_II		1209_Remove_All_Adjacent_Duplicates_in_String_II
120_Triangle		120_Triangle
1216_Valid_Palindrome_III		1216_Valid_Palindrome_III
1219_Path_with_Maximum_Gold		1219_Path_with_Maximum_Gold
121_Best_Time_to_Buy_and_Sell_Stock		121_Best_Time_to_Buy_and_Sell_Stock
122_Best_Time_to_Buy_and_Sell_Stock_II		122_Best_Time_to_Buy_and_Sell_Stock_II
1231_Divide_Chocolate		1231_Divide_Chocolate
1233_Remove_Sub-Folders_from_the_Filesystem		1233_Remove_Sub-Folders_from_the_Filesystem
1234_Replace_the_Substring_for_Balanced_String		1234_Replace_the_Substring_for_Balanced_String
1235_Maximum_Profit_in_Job_Scheduling		1235_Maximum_Profit_in_Job_Scheduling
1237_Find_Positive_Integer_Solution_for_a_Given_Equation		1237_Find_Positive_Integer_Solution_for_a_Given_Equation
123_Best_Time_to_Buy_and_Sell_Stock_III		123_Best_Time_to_Buy_and_Sell_Stock_III
1240_Tiling_a_Rectangle_with_the_Fewest_Squares		1240_Tiling_a_Rectangle_with_the_Fewest_Squares
1242_Web_Crawler_Multithreaded		1242_Web_Crawler_Multithreaded
1245_Tree_Diameter		1245_Tree_Diameter
1247_Minimum_Swaps_to_Make_Strings_Equal		1247_Minimum_Swaps_to_Make_Strings_Equal
1248_Count_Number_of_Nice_Subarrays		1248_Count_Number_of_Nice_Subarrays
1249_Minimum_Remove_to_Make_Valid_Parentheses		1249_Minimum_Remove_to_Make_Valid_Parentheses
124_Binary_Tree_Maximum_Path_Sum		124_Binary_Tree_Maximum_Path_Sum
1254_Number_of_Closed_Islands		1254_Number_of_Closed_Islands
125_Valid_Palindrome		125_Valid_Palindrome
1261_Find_Elements_in_a_Contaminated_Binary_Tree		1261_Find_Elements_in_a_Contaminated_Binary_Tree
1265_Print_Immutable_Linked_List_in_Reverse		1265_Print_Immutable_Linked_List_in_Reverse
1267_Count_Servers_that_Communicate		1267_Count_Servers_that_Communicate
126_Word_Ladder_II		126_Word_Ladder_II

Folders and files

Latest commit

History

About

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages