GitHub - randomwalk10/my_leetcode

Name		Name	Last commit message	Last commit date
Latest commit History 496 Commits
.gitignore		.gitignore
1003_Check_If_Word_Is_Valid_After_Substitutions.cpp		1003_Check_If_Word_Is_Valid_After_Substitutions.cpp
1005_Maximize_Sum_Of_Array_After_K_Negations.cpp		1005_Maximize_Sum_Of_Array_After_K_Negations.cpp
1007_Minimum_Domino_Rotations_For_Equal_Row.cpp		1007_Minimum_Domino_Rotations_For_Equal_Row.cpp
1008_Construct_Binary_Search_Tree_from_Preorder_Traversal.cpp		1008_Construct_Binary_Search_Tree_from_Preorder_Traversal.cpp
100_Same_Tree.cpp		100_Same_Tree.cpp
1019_Next_Greater_Node_In_Linked_List.cpp		1019_Next_Greater_Node_In_Linked_List.cpp
101_Symmetric_Tree.cpp		101_Symmetric_Tree.cpp
1021_Remove_Outermost_Parentheses.cpp		1021_Remove_Outermost_Parentheses.cpp
1022_Sum_of_Root_To_Leaf_Binary_Numbers.cpp		1022_Sum_of_Root_To_Leaf_Binary_Numbers.cpp
1026_Maximum_Difference_Between_Node_and_Ancestor.cpp		1026_Maximum_Difference_Between_Node_and_Ancestor.cpp
1026_Maximum_Difference_Between_Node_and_Ancestor_2nd.cpp		1026_Maximum_Difference_Between_Node_and_Ancestor_2nd.cpp
1028_Recover_a_Tree_From_Preorder_Traversal.cpp		1028_Recover_a_Tree_From_Preorder_Traversal.cpp
1029_Two_City_Scheduling.cpp		1029_Two_City_Scheduling.cpp
102_Binary_Tree_Level_Order_Traversal.cpp		102_Binary_Tree_Level_Order_Traversal.cpp
102_Binary_Tree_Level_Order_Traversal_2nd.cpp		102_Binary_Tree_Level_Order_Traversal_2nd.cpp
1038_Binary_Search_Tree_to_Greater_Sum_Tree.cpp		1038_Binary_Search_Tree_to_Greater_Sum_Tree.cpp
103_Binary_Tree_Zigzag_Level_Order_Traversal.cpp		103_Binary_Tree_Zigzag_Level_Order_Traversal.cpp
1046_Last_Stone_Weight.cpp		1046_Last_Stone_Weight.cpp
1047_Remove_All_Adjacent_Duplicates_In_String.cpp		1047_Remove_All_Adjacent_Duplicates_In_String.cpp
104_Maximum_Depth_of_Binary_Tree.cpp		104_Maximum_Depth_of_Binary_Tree.cpp
1053_Previous_Permutation_With_One_Swap.cpp		1053_Previous_Permutation_With_One_Swap.cpp
1054_Distant_Barcodes.cpp		1054_Distant_Barcodes.cpp
105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp		105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp
105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal_2nd.cpp		105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal_2nd.cpp
106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp		106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp
106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal_2nd.cpp		106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal_2nd.cpp
107_Binary_Tree_Level_Order_Traversal_II.cpp		107_Binary_Tree_Level_Order_Traversal_II.cpp
107_Binary_Tree_Level_Order_Traversal_II_2nd.cpp		107_Binary_Tree_Level_Order_Traversal_II_2nd.cpp
1081_Smallest_Subsequence_of_Distinct_Characters.cpp		1081_Smallest_Subsequence_of_Distinct_Characters.cpp
108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp		108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp
108_Convert_Sorted_Array_to_Binary_Search_Tree_2nd.cpp		108_Convert_Sorted_Array_to_Binary_Search_Tree_2nd.cpp
1090_Largest_Values_From_Labels.cpp		1090_Largest_Values_From_Labels.cpp
1094_Car_Pooling.cpp		1094_Car_Pooling.cpp
109_Convert_Sorted_List_to_Binary_Search_Tree.cpp		109_Convert_Sorted_List_to_Binary_Search_Tree.cpp
10_Regular_Expression_Matching.cpp		10_Regular_Expression_Matching.cpp
1104_Path_In_Zigzag_Labelled_Binary_Tree.cpp		1104_Path_In_Zigzag_Labelled_Binary_Tree.cpp
1110_Delete_Nodes_And_Return_Forest.cpp		1110_Delete_Nodes_And_Return_Forest.cpp
1111_Maximum_Nesting_Depth_of_Two_Valid_Parentheses_Strings.cpp		1111_Maximum_Nesting_Depth_of_Two_Valid_Parentheses_Strings.cpp
111_Minimum_Depth_of_Binary_Tree.cpp		111_Minimum_Depth_of_Binary_Tree.cpp
1123_Lowest_Common_Ancestor_of_Deepest_Leaves.cpp		1123_Lowest_Common_Ancestor_of_Deepest_Leaves.cpp
1124_Longest_Well-Performing_Interval.cpp		1124_Longest_Well-Performing_Interval.cpp
1125_Smallest_Sufficient_Team.cpp		1125_Smallest_Sufficient_Team.cpp
112_Path_Sum.cpp		112_Path_Sum.cpp
112_Path_Sum_2nd.cpp		112_Path_Sum_2nd.cpp
1130_Minimum_Cost_Tree_From_Leaf_Values.cpp		1130_Minimum_Cost_Tree_From_Leaf_Values.cpp
1130_XOR_Queries_of_a_Subarray.cpp		1130_XOR_Queries_of_a_Subarray.cpp
1131_Maximum_of_Absolute_Value_Expression.cpp		1131_Maximum_of_Absolute_Value_Expression.cpp
113_Path_Sum_II.cpp		113_Path_Sum_II.cpp
114_Flatten_Binary_Tree_to_Linked_List.cpp		114_Flatten_Binary_Tree_to_Linked_List.cpp
114_Flatten_Binary_Tree_to_Linked_List_2nd.cpp		114_Flatten_Binary_Tree_to_Linked_List_2nd.cpp
1161_Maximum_Level_Sum_of_a_Binary_Tree.cpp		1161_Maximum_Level_Sum_of_a_Binary_Tree.cpp
116_Populating_Next_Right_Pointers_in_Each_Node.cpp		116_Populating_Next_Right_Pointers_in_Each_Node.cpp
117_Populating_Next_Right_Pointers_in_Each_Node_II.cpp		117_Populating_Next_Right_Pointers_in_Each_Node_II.cpp
117_Populating_Next_Right_Pointers_in_Each_Node_II_2nd.cpp		117_Populating_Next_Right_Pointers_in_Each_Node_II_2nd.cpp
1190_Reverse_Substrings_Between_Each_Pair_of_Parentheses.cpp		1190_Reverse_Substrings_Between_Each_Pair_of_Parentheses.cpp
11_Container_With_Most_Water.cpp		11_Container_With_Most_Water.cpp
1209_Remove_All_Adjacent_Duplicates_in_String_II.cpp		1209_Remove_All_Adjacent_Duplicates_in_String_II.cpp
1217_Minimum_Cost_to_Move_Chips_to_The_Same_Position.cpp		1217_Minimum_Cost_to_Move_Chips_to_The_Same_Position.cpp
1221_Split_a_String_in_Balanced_Strings.cpp		1221_Split_a_String_in_Balanced_Strings.cpp
122_Best_Time_to_Buy_and_Sell_Stock_II.cpp		122_Best_Time_to_Buy_and_Sell_Stock_II.cpp
1239_Maximum_Length_of_a_Concatenated_String_with_Unique_Characters.cpp		1239_Maximum_Length_of_a_Concatenated_String_with_Unique_Characters.cpp
1247_Minimum_Swaps_to_Make_Strings_Equal.cpp		1247_Minimum_Swaps_to_Make_Strings_Equal.cpp
1249_Minimum_Remove_to_Make_Valid_Parentheses.cpp		1249_Minimum_Remove_to_Make_Valid_Parentheses.cpp
124_Binary_Tree_Maximum_Path_Sum.cpp		124_Binary_Tree_Maximum_Path_Sum.cpp
1255_Maximum_Score_Words_Formed_by_Letters.cpp		1255_Maximum_Score_Words_Formed_by_Letters.cpp
1261_Find_Elements_in_a_Contaminated_Binary_Tree.cpp		1261_Find_Elements_in_a_Contaminated_Binary_Tree.cpp
1276_Number_of_Burgers_with_No_Waste_of_Ingredients.cpp		1276_Number_of_Burgers_with_No_Waste_of_Ingredients.cpp
1282_Group_the_People_Given_the_Group_Size_They_Belong_To.cpp		1282_Group_the_People_Given_the_Group_Size_They_Belong_To.cpp
1288_Remove_Covered_Intervals.cpp		1288_Remove_Covered_Intervals.cpp
128_Longest_Consecutive_Sequence.cpp		128_Longest_Consecutive_Sequence.cpp
1290_Convert_Binary_Number_in_a_Linked_List_to_Integer.cpp		1290_Convert_Binary_Number_in_a_Linked_List_to_Integer.cpp
1296_Divide_Array_in_Sets_of_K_Consecutive_Numbers.cpp		1296_Divide_Array_in_Sets_of_K_Consecutive_Numbers.cpp
1297_Maximum_Number_of_Occurrences_of_a_Substring.cpp		1297_Maximum_Number_of_Occurrences_of_a_Substring.cpp
129_Sum_Root_to_Leaf_Numbers.cpp		129_Sum_Root_to_Leaf_Numbers.cpp
129_Sum_Root_to_Leaf_Numbers_2nd.cpp		129_Sum_Root_to_Leaf_Numbers_2nd.cpp
12_integer2roman.cpp		12_integer2roman.cpp
1302_Deepest_Leaves_Sum.cpp		1302_Deepest_Leaves_Sum.cpp
1305_All_Elements_in_Two_Binary_Search_Trees.cpp		1305_All_Elements_in_Two_Binary_Search_Trees.cpp
1315_Sum_of_Nodes_with_Even_Valued_Grandparent.cpp		1315_Sum_of_Nodes_with_Even_Valued_Grandparent.cpp
1318_Minimum_Flips_to_Make_a_OR_b_Equal_to_c.cpp		1318_Minimum_Flips_to_Make_a_OR_b_Equal_to_c.cpp
131_Palindrome_Partitioning.cpp		131_Palindrome_Partitioning.cpp
1325_Delete_Leaves_With_a_Given_Value.cpp		1325_Delete_Leaves_With_a_Given_Value.cpp
1338_Reduce_Array_Size_to_The_Half.cpp		1338_Reduce_Array_Size_to_The_Half.cpp
1339_Maximum_Product_of_Splitted_Binary_Tree.cpp		1339_Maximum_Product_of_Splitted_Binary_Tree.cpp
133_Clone_Graph.cpp		133_Clone_Graph.cpp
1342_Number_of_Steps_to_Reduce_a_Number_to_Zero.cpp		1342_Number_of_Steps_to_Reduce_a_Number_to_Zero.cpp
134_Gas_Station.cpp		134_Gas_Station.cpp
1356_Sort_Integers_by_The_Number_of_1_Bits.cpp		1356_Sort_Integers_by_The_Number_of_1_Bits.cpp
1367_Linked_List_in_Binary_Tree.cpp		1367_Linked_List_in_Binary_Tree.cpp
136_Single_Number.cpp		136_Single_Number.cpp
1372_Longest_ZigZag_Path_in_a_Binary_Tree.cpp		1372_Longest_ZigZag_Path_in_a_Binary_Tree.cpp
1379_Find_a_Corresponding_Node_of_a_Binary_Tree_in_a_Clone_of_That_Tree.cpp		1379_Find_a_Corresponding_Node_of_a_Binary_Tree_in_a_Clone_of_That_Tree.cpp
137_Single_Number_II.cpp		137_Single_Number_II.cpp
1381_Design_a_Stack_With_Increment_Operation.cpp		1381_Design_a_Stack_With_Increment_Operation.cpp
138_Copy_List_with_Random_Pointer.cpp		138_Copy_List_with_Random_Pointer.cpp
139_Word_Break.cpp		139_Word_Break.cpp
13_roman2integer.cpp		13_roman2integer.cpp
1400_Construct_K_Palindrome_Strings.cpp		1400_Construct_K_Palindrome_Strings.cpp
1403_Minimum_Subsequence_in_Non-Increasing_Order.cpp		1403_Minimum_Subsequence_in_Non-Increasing_Order.cpp

randomwalk10/my_leetcode_solutions

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages