master

BranchesTags

Go to file

Code

Open more actions menu

Latest commit

 

History

354 Commits

354 Commits

Folders and files

Name		Name	Last commit message	Last commit date
lc1		lc1
lc100_Same_Tree		lc100_Same_Tree
lc1011_Capacity_To_Ship_Packages_Within_D_Days/ac1		lc1011_Capacity_To_Ship_Packages_Within_D_Days/ac1
lc1014_Best_Sightseeing_Pair		lc1014_Best_Sightseeing_Pair
lc101_Symmetric_Tree		lc101_Symmetric_Tree
lc1022_Sum_of_Root_To_Leaf_Binary_Numbers		lc1022_Sum_of_Root_To_Leaf_Binary_Numbers
lc102_Binary_Tree_Level_Order_Traversal/ac1		lc102_Binary_Tree_Level_Order_Traversal/ac1
lc103_Binary_Tree_Zigzag_Level_Order_Traversal/ac1		lc103_Binary_Tree_Zigzag_Level_Order_Traversal/ac1
lc104_Maximum_Depth_of_Binary_Tree		lc104_Maximum_Depth_of_Binary_Tree
lc105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal		lc105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
lc106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal		lc106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
lc107_Binary_Tree_Level_Order_Traversal_II/ac1		lc107_Binary_Tree_Level_Order_Traversal_II/ac1
lc108_Convert_Sorted_Array_to_Binary_Search_Tree/ac1		lc108_Convert_Sorted_Array_to_Binary_Search_Tree/ac1
lc109_Convert_Sorted_List_to_Binary_Search_Tree		lc109_Convert_Sorted_List_to_Binary_Search_Tree
lc110_Balanced_Binary_Tree		lc110_Balanced_Binary_Tree
lc111_Minimum_Depth_of_Binary_Tree		lc111_Minimum_Depth_of_Binary_Tree
lc112_Path_Sum		lc112_Path_Sum
lc1137_N-th_Tribonacci_Number/ac1		lc1137_N-th_Tribonacci_Number/ac1
lc113_Path_Sum_II		lc113_Path_Sum_II
lc1143_Longest_Common_Subsequence/ac1		lc1143_Longest_Common_Subsequence/ac1
lc1146_Snapshot_Array/ac1		lc1146_Snapshot_Array/ac1
lc114_Flatten_Binary_Tree_to_Linked_List		lc114_Flatten_Binary_Tree_to_Linked_List
lc116_Populating_Next_Right_Pointers_in_Each_Node/ac1		lc116_Populating_Next_Right_Pointers_in_Each_Node/ac1
lc1170_Compare_Strings_by_Frequency_of_the_Smallest_Character/ac1		lc1170_Compare_Strings_by_Frequency_of_the_Smallest_Character/ac1
lc117_Populating_Next_Right_Pointers_in_Each_Node_II/ac1		lc117_Populating_Next_Right_Pointers_in_Each_Node_II/ac1
lc118_Pascals_Triangle/ac1		lc118_Pascals_Triangle/ac1
lc119_Pascals_Triangle_II/ac1		lc119_Pascals_Triangle_II/ac1
lc11_Container_With_Most_Water/ac1		lc11_Container_With_Most_Water/ac1
lc1201_Ugly_Number_III/ac1		lc1201_Ugly_Number_III/ac1
lc120_Triangle/ac1		lc120_Triangle/ac1
lc121_Best_Time_to_Buy_and_Sell_Stock/ac1		lc121_Best_Time_to_Buy_and_Sell_Stock/ac1
lc122_Best_Time_to_Buy_and_Sell_Stock_II		lc122_Best_Time_to_Buy_and_Sell_Stock_II
lc1237_Find_Positive_Integer_Solution_for_a_Given_Equation/ac1		lc1237_Find_Positive_Integer_Solution_for_a_Given_Equation/ac1
lc123_Best_Time_to_Buy_and_Sell_Stock_III/ac1		lc123_Best_Time_to_Buy_and_Sell_Stock_III/ac1
lc1249_Minimum_Remove_to_Make_Valid_Parentheses/ac1		lc1249_Minimum_Remove_to_Make_Valid_Parentheses/ac1
lc124_Binary_Tree_Maximum_Path_Sum/ac1		lc124_Binary_Tree_Maximum_Path_Sum/ac1
lc125_Valid_Palindrome/ac1		lc125_Valid_Palindrome/ac1
lc1283_Find_the_Smallest_Divisor_Given_a_Threshold/ac1		lc1283_Find_the_Smallest_Divisor_Given_a_Threshold/ac1
lc128_Longest_Consecutive_Sequence		lc128_Longest_Consecutive_Sequence
lc1292_Maximum_Side_Length_of_a_Square_with_Sum_Less_than_or_Equal_to_Threshold/ac1		lc1292_Maximum_Side_Length_of_a_Square_with_Sum_Less_than_or_Equal_to_Threshold/ac1
lc129_Sum_Root_to_Leaf_Numbers		lc129_Sum_Root_to_Leaf_Numbers
lc12_Integer_to_Roman		lc12_Integer_to_Roman
lc1300_Sum_of_Mutated_Array_Closest_to_Target/ac1		lc1300_Sum_of_Mutated_Array_Closest_to_Target/ac1
lc1314_Matrix_Block_Sum/ac1		lc1314_Matrix_Block_Sum/ac1
lc1337_The_K_Weakest_Rows_in_a_Matrix/ac1		lc1337_The_K_Weakest_Rows_in_a_Matrix/ac1
lc134_Gas_Station/ac1		lc134_Gas_Station/ac1
lc1351_Count_Negative_Numbers_in_a_Sorted_Matrix		lc1351_Count_Negative_Numbers_in_a_Sorted_Matrix
lc135_Candy		lc135_Candy
lc136_Single_Number/ac1		lc136_Single_Number/ac1
lc137_Single_Number_II/ac1		lc137_Single_Number_II/ac1
lc138_Copy_List_with_Random_Pointer		lc138_Copy_List_with_Random_Pointer
lc139_Word_Break/ac1		lc139_Word_Break/ac1
lc13_Roman_to_Integer/ac1		lc13_Roman_to_Integer/ac1
lc141_Linked_List_Cycle/ac1		lc141_Linked_List_Cycle/ac1
lc142_Linked_List_Cycle_II		lc142_Linked_List_Cycle_II
lc143_Reorder_List		lc143_Reorder_List
lc1449_Form_Largest_Integer_With_Digits_That_Add_up_to_Target/ac1		lc1449_Form_Largest_Integer_With_Digits_That_Add_up_to_Target/ac1
lc144_Binary_Tree_Preorder_Traversal		lc144_Binary_Tree_Preorder_Traversal
lc145_Binary_Tree_Postorder_Traversal		lc145_Binary_Tree_Postorder_Traversal
lc146_LRU_Cache/ac1		lc146_LRU_Cache/ac1
lc147_insertion_sort_list/ac1		lc147_insertion_sort_list/ac1
lc1482_Minimum_Number_of_Days_to_Make_m_Bouquets/ac1		lc1482_Minimum_Number_of_Days_to_Make_m_Bouquets/ac1
lc1488_Avoid_Flood_in_The_City/ac1		lc1488_Avoid_Flood_in_The_City/ac1
lc148_sort_list		lc148_sort_list
lc1498_Number_of_Subsequences_That_Satisfy_the_Given_Sum_Condition/ac1		lc1498_Number_of_Subsequences_That_Satisfy_the_Given_Sum_Condition/ac1
lc14_Longest_Common_Prefix		lc14_Longest_Common_Prefix
lc1508_Range_Sum_of_Sorted_Subarray_Sums/ac1		lc1508_Range_Sum_of_Sorted_Subarray_Sums/ac1
lc150_Evaluate_Reverse_Polish_Notation/ac1		lc150_Evaluate_Reverse_Polish_Notation/ac1
lc151_Reverse_Words_in_a_String/ac1		lc151_Reverse_Words_in_a_String/ac1
lc152_Maximum_Product_Subarray/ac1		lc152_Maximum_Product_Subarray/ac1
lc153_Find_Minimum_in_Rotated_Sorted_Array/ac1		lc153_Find_Minimum_in_Rotated_Sorted_Array/ac1
lc154/ac1		lc154/ac1
lc1552_Magnetic_Force_Between_Two_Balls/ac1		lc1552_Magnetic_Force_Between_Two_Balls/ac1
lc1557_Minimum_Number_of_Vertices_to_Reach_All_Nodes/ac1		lc1557_Minimum_Number_of_Vertices_to_Reach_All_Nodes/ac1
lc155_Min_Stack		lc155_Min_Stack
lc1562_Find_Latest_Group_of_Size_M/ac1		lc1562_Find_Latest_Group_of_Size_M/ac1
lc1567_Maximum_Length_of_Subarray_With_Positive_Product/ac1		lc1567_Maximum_Length_of_Subarray_With_Positive_Product/ac1
lc1574_Shortest_Subarray_to_be_Removed_to_Make_Array_Sorted/ac1		lc1574_Shortest_Subarray_to_be_Removed_to_Make_Array_Sorted/ac1
lc15_3Sum/ac1		lc15_3Sum/ac1
lc160_Intersection_of_Two_Linked_Lists/ac1		lc160_Intersection_of_Two_Linked_Lists/ac1
lc162_Find_Peak_Element/ac1		lc162_Find_Peak_Element/ac1
lc1648_Sell_Diminishing-Valued_Colored_Balls/ac1		lc1648_Sell_Diminishing-Valued_Colored_Balls/ac1
lc165_compare_version_numbers		lc165_compare_version_numbers
lc167_Two_Sum_II-Input_array_is_sorted/ac1		lc167_Two_Sum_II-Input_array_is_sorted/ac1
lc169_Majority_Element		lc169_Majority_Element
lc1712_Ways_to_Split_Array_Into_Three_Subarrays/ac1		lc1712_Ways_to_Split_Array_Into_Three_Subarrays/ac1
lc173_Binary_Search_Tree_Iterator/ac1		lc173_Binary_Search_Tree_Iterator/ac1
lc175_Combine_Two_Tables/ac1		lc175_Combine_Two_Tables/ac1
lc1760_Minimum_Limit_of_Balls_in_a_Bag/ac1		lc1760_Minimum_Limit_of_Balls_in_a_Bag/ac1
lc176_Second_Highest_Salary		lc176_Second_Highest_Salary
lc177_ Nth_Highest_Salary/ac1		lc177_ Nth_Highest_Salary/ac1
lc178_Rank_Scores		lc178_Rank_Scores
lc1802_Maximum_Value_at_a_Given_Index_in_a_Bounded_Array/ac1		lc1802_Maximum_Value_at_a_Given_Index_in_a_Bounded_Array/ac1
lc180_Consecutive_Numbers/ac1		lc180_Consecutive_Numbers/ac1
lc1818_Minimum_Absolute_Sum_Difference/ac1		lc1818_Minimum_Absolute_Sum_Difference/ac1
lc181_Employees_Earning_More_Than_Their_Managers		lc181_Employees_Earning_More_Than_Their_Managers
lc1823_Find_the_Winner_of_the_Circular_Game		lc1823_Find_the_Winner_of_the_Circular_Game
lc182_Duplicate_Emails		lc182_Duplicate_Emails
lc1838_Frequency_of_the_Most_Frequent_Element/ac1		lc1838_Frequency_of_the_Most_Frequent_Element/ac1
lc183_Customers_Who_Never_Order		lc183_Customers_Who_Never_Order
View all files

About

No description, website, or topics provided.

Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Used by

Contributors

Languages