Directories
¶
| Path | Synopsis |
|---|---|
|
lc1
|
|
|
lc100_Same_Tree
|
|
|
lc1011_Capacity_To_Ship_Packages_Within_D_Days
|
|
|
lc1014_Best_Sightseeing_Pair
|
|
|
lc101_Symmetric_Tree
|
|
|
lc1022_Sum_of_Root_To_Leaf_Binary_Numbers
|
|
|
lc102_Binary_Tree_Level_Order_Traversal
|
|
|
lc103_Binary_Tree_Zigzag_Level_Order_Traversal
|
|
|
lc104_Maximum_Depth_of_Binary_Tree
|
|
|
lc105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
|
|
|
lc106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
|
|
|
lc107_Binary_Tree_Level_Order_Traversal_II
|
|
|
lc108_Convert_Sorted_Array_to_Binary_Search_Tree
|
|
|
lc109_Convert_Sorted_List_to_Binary_Search_Tree
|
|
|
lc110_Balanced_Binary_Tree
|
|
|
lc111_Minimum_Depth_of_Binary_Tree
|
|
|
lc112_Path_Sum
|
|
|
lc1137_N-th_Tribonacci_Number
|
|
|
lc113_Path_Sum_II
|
|
|
lc1143_Longest_Common_Subsequence
|
|
|
lc1146_Snapshot_Array
|
|
|
lc114_Flatten_Binary_Tree_to_Linked_List
|
|
|
lc116_Populating_Next_Right_Pointers_in_Each_Node
|
|
|
lc1170_Compare_Strings_by_Frequency_of_the_Smallest_Character
|
|
|
lc117_Populating_Next_Right_Pointers_in_Each_Node_II
|
|
|
lc118_Pascals_Triangle
|
|
|
lc119_Pascals_Triangle_II
|
|
|
lc11_Container_With_Most_Water
|
|
|
lc1201_Ugly_Number_III
|
|
|
lc120_Triangle
|
|
|
lc121_Best_Time_to_Buy_and_Sell_Stock
|
|
|
lc122_Best_Time_to_Buy_and_Sell_Stock_II
|
|
|
lc1237_Find_Positive_Integer_Solution_for_a_Given_Equation
|
|
|
lc1249_Minimum_Remove_to_Make_Valid_Parentheses
|
|
|
lc125_Valid_Palindrome
|
|
|
lc1283_Find_the_Smallest_Divisor_Given_a_Threshold
|
|
|
lc1292_Maximum_Side_Length_of_a_Square_with_Sum_Less_than_or_Equal_to_Threshold
|
|
|
lc129_Sum_Root_to_Leaf_Numbers
|
|
|
lc12_Integer_to_Roman
|
|
|
lc1300_Sum_of_Mutated_Array_Closest_to_Target
|
|
|
lc1314_Matrix_Block_Sum
|
|
|
lc1337_The_K_Weakest_Rows_in_a_Matrix
|
|
|
lc134_Gas_Station
|
|
|
lc1351_Count_Negative_Numbers_in_a_Sorted_Matrix
|
|
|
lc135_Candy
|
|
|
lc136_Single_Number
|
|
|
lc139_Word_Break
|
|
|
lc13_Roman_to_Integer
|
|
|
lc142_Linked_List_Cycle_II
|
|
|
lc143_Reorder_List
|
|
|
lc144_Binary_Tree_Preorder_Traversal
|
|
|
lc145_Binary_Tree_Postorder_Traversal
|
|
|
lc1482_Minimum_Number_of_Days_to_Make_m_Bouquets
|
|
|
lc1488_Avoid_Flood_in_The_City
|
|
|
lc1498_Number_of_Subsequences_That_Satisfy_the_Given_Sum_Condition
|
|
|
lc14_Longest_Common_Prefix
|
|
|
lc1508_Range_Sum_of_Sorted_Subarray_Sums
|
|
|
lc151_Reverse_Words_in_a_String
|
|
|
lc152_Maximum_Product_Subarray
|
|
|
lc153_Find_Minimum_in_Rotated_Sorted_Array
|
|
|
lc154
|
|
|
lc1552_Magnetic_Force_Between_Two_Balls
|
|
|
lc1557_Minimum_Number_of_Vertices_to_Reach_All_Nodes
|
|
|
lc155_Min_Stack
|
|
|
lc1562_Find_Latest_Group_of_Size_M
|
|
|
lc1567_Maximum_Length_of_Subarray_With_Positive_Product
|
|
|
lc1574_Shortest_Subarray_to_be_Removed_to_Make_Array_Sorted
|
|
|
lc15_3Sum
|
|
|
lc160_Intersection_of_Two_Linked_Lists
|
|
|
lc162_Find_Peak_Element
|
|
|
lc1648_Sell_Diminishing-Valued_Colored_Balls
|
|
|
lc167_Two_Sum_II-Input_array_is_sorted
|
|
|
lc169_Majority_Element
|
|
|
lc1712_Ways_to_Split_Array_Into_Three_Subarrays
|
|
|
lc173_Binary_Search_Tree_Iterator
|
|
|
lc1760_Minimum_Limit_of_Balls_in_a_Bag
|
|
|
lc1802_Maximum_Value_at_a_Given_Index_in_a_Bounded_Array
|
|
|
lc1818_Minimum_Absolute_Sum_Difference
|
|
|
lc1823_Find_the_Winner_of_the_Circular_Game
|
|
|
lc1838_Frequency_of_the_Most_Frequent_Element
|
|
|
lc1870_Minimum_Speed_to_Arrive_on_Time
|
|
|
lc187_Repeated_DNA_Sequences
|
|
|
lc1894_Find_the_Student_that_Will_Replace_the_Chalk
|
|
|
lc1898_Maximum_Number_of_Removable_Characters
|
|
|
lc189_Rotate_Array
|
|
|
lc1901_Find_a_Peak_Element_II
|
|
|
lc198_House_Robber
|
|
|
lc199_Binary_Tree_Right_Side_View
|
|
|
lc2
|
|
|
lc2096_Step-By-Step_Directions_From_a_Binary_Tree_Node_to_Another
|
|
|
lc209_Minimum_Size_Subarray_Sum
|
|
|
lc21
|
|
|
lc213_House_Robber_II
|
|
|
lc215_Kth_Largest_Element_in_an_Array
|
|
|
lc221_Maximal_Square
|
|
|
lc222_Count_Complete_Tree_Nodes
|
|
|
lc226_Invert_Binary_Tree
|
|
|
lc230_Kth_Smallest_Element_in_a_BST
|
|
|
lc235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree
|
|
|
lc236_Lowest_Common_Ancestor_of_a_Binary_Tree
|
|
|
lc238_Product_of_Array_Except_Self
|
|
|
lc23_Merge_k_Sorted_Lists
|
|
|
lc240_Search_a_2D_Matrix_II
|
|
|
lc24_Swap_Nodes_in_Pairs
|
|
|
lc257_Binary_Tree_Paths
|
|
|
lc25_Reverse_Nodes_in_k-Group
|
|
|
lc264_Ugly_Number_II
|
|
|
lc26_Remove_Duplicates_from_Sorted_Array
|
|
|
lc274_H-Index
|
|
|
lc275_H-Index_II
|
|
|
lc279_Perfect_Squares
|
|
|
lc27_Remove_Element
|
|
|
lc287_Find_the_Duplicate_Number
|
|
|
lc28_Find_the_Index_of_the_First_Occurrence_in_a_String
|
|
|
lc290_Word_Pattern
|
|
|
lc297_Serialize_and_Deserialize_Binary_Tree
|
|
|
lc29_Divide_Two_Integers
|
|
|
lc300_Longest_Increasing_Subsequence
|
|
|
lc304_Range_Sum_Query_2D_Immutable
|
|
|
lc309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown
|
|
|
lc30_Substring_with_Concatenation_of_All_Words
|
|
|
lc314_Flatten_Nested_List_Iterator
|
|
|
lc322_Coin_Change
|
|
|
lc331
|
|
|
lc334_Increasing_Triplet_Subsequence
|
|
|
lc337_House_Robber_III
|
|
|
lc33_Search_in_Rotated_Sorted_Array
|
|
|
lc343_Integer_Break
|
|
|
lc347_Top_K_Frequent_Elements
|
|
|
lc349_Intersection_of_Two_Arrays
|
|
|
lc34_Find_First_and_Last_Position_of_Element_in_Sorted_Array
|
|
|
lc350_Intersection_of_Two_Arrays_II
|
|
|
lc354_Russian_Doll_Envelopes
|
|
|
lc35_Search_Insert_Position
|
|
|
lc367_Valid_Perfect_Square
|
|
|
lc36_Valid_Sudoku
|
|
|
lc374_Guess_Number_Higher_or_Lower
|
|
|
lc376_Wiggle_Subsequence
|
|
|
lc377_Combination_Sum_IV
|
|
|
lc378_Kth_Smallest_Element_in_a_Sorted_Matrix
|
|
|
lc383_Ransom_Note
|
|
|
lc392_Is_Subsequence
|
|
|
lc3_Longest_Substring_Without_Repeating_Characters
|
|
|
lc404_Sum_of_Left_Leaves
|
|
|
lc409_Longest_Palindrome
|
|
|
lc413_Arithmetic_Slices
|
|
|
lc415_Add_Strings
|
|
|
lc42_Trapping_Rain_Water
|
|
|
lc435_Non-overlapping_Intervals
|
|
|
lc436_Find_Right_Interval
|
|
|
lc437_Path_Sum_III
|
|
|
lc438_Find_All_Anagrams_in_a_String
|
|
|
lc43_Multiply_Strings
|
|
|
lc441_Arranging_Coins
|
|
|
lc449_Serialize_and_Deserialize_BST
|
|
|
lc450_Delete_Node_in_a_BST
|
|
|
lc451_Sort_Characters_By_Frequency
|
|
|
lc454_4Sum_II
|
|
|
lc459_Repeated_Substring_Pattern
|
|
|
lc45_Jump_Game_II
|
|
|
lc475_Heaters
|
|
|
lc497_Random_Point_in_Non_overlapping_Rectangles
|
|
|
lc49_Group_Anagrams
|
|
|
lc5
|
|
|
lc501_Find_Mode_in_Binary_Search_Tree
|
|
|
lc508_Most_Frequent_Subtree_Sum
|
|
|
lc509_Fibonacci_Number
|
|
|
lc50_Pow_x_n
|
|
|
lc513_Find_Bottom_Left_Tree_Value
|
|
|
lc515_Find_Largest_Value_in_Each_Tree_Row
|
|
|
lc516_Longest_Palindromic_Subsequence
|
|
|
lc518_Coin_Change_2
|
|
|
lc528_Random_Pick_with_Weight
|
|
|
lc530_Minimum_Absolute_Difference_in_BST
|
|
|
lc538_Convert_BST_to_Greater_Tree
|
|
|
lc53_Maximum_Subarray
|
|
|
lc54
|
|
|
lc540_Single_Element_in_a_Sorted_Array
|
|
|
lc543_Diameter_of_Binary_Tree
|
|
|
lc559_Maximum_Depth_of_N-ary_Tree
|
|
|
lc55_Jump_Game
|
|
|
lc560_Subarray_Sum_Equals_K
|
|
|
lc563_Binary_Tree_Tilt
|
|
|
lc56_Merge_Intervals
|
|
|
lc589_N-ary_Tree_Preorder_Traversal
|
|
|
lc58_Length_of_Last_Word
|
|
|
lc590_N-ary_Tree_Postorder_Traversal
|
|
|
lc59_Spiral_Matrix_II
|
|
|
lc6
|
|
|
lc606_Construct_String_from_Binary_Tree
|
|
|
lc611_Valid_Triangle_Number
|
|
|
lc617_Merge_Two_Binary_Trees
|
|
|
lc623_Add_One_Row_Tree
|
|
|
lc62_Unique_Paths
|
|
|
lc637_Average_of_Levels_in_Binary_Tree
|
|
|
lc63_Unique_Paths_II
|
|
|
lc64_Minimum_Path_Sum
|
|
|
lc652_Find_Duplicate_Subtrees
|
|
|
lc653_Two_Sum_IV_Input_is_a_BST
|
|
|
lc654_Maximum_Binary_Tree
|
|
|
lc655_Print_Binary_Tree
|
|
|
lc658_Find_K_Closest_Elements
|
|
|
lc662_Maximum_Width_of_Binary_Tree
|
|
|
lc671_Second_Minimum_Node_In_a_Binary_Tree
|
|
|
lc68_Text_Justification
|
|
|
lc69_Sqrt_x
|
|
|
lc7
|
|
|
lc700_Search_in_a_Binary_Search_Tree
|
|
|
lc704_Binary_Search
|
|
|
lc706_Design_HashMap
|
|
|
lc707_Design_Linked_List
|
|
|
lc70_Climbing_Stairs
|
|
|
lc714_Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee
|
|
|
lc718_Maximum_Length_of_Repeated_Subarray
|
|
|
lc72_Edit_Distance
|
|
|
lc740_Delete_and_Earn
|
|
|
lc744_Find_Smallest_Letter_Greater_Than_Target
|
|
|
lc746_Min_Cost_Climbing_Stairs
|
|
|
lc74_Search_a_2D_Matrix
|
|
|
lc75_Sort_Colors
|
|
|
lc763_Partition_Labels
|
|
|
lc76_Minimum_Window_Substring
|
|
|
lc783_Minimum_Distance_Between_BST_Nodes
|
|
|
lc8
|
|
|
lc80_Remove_Duplicates_from_Sorted_Array_II
|
|
|
lc81_Search_in_Rotated_Sorted_Array_II
|
|
|
lc826_Most_Profit_Assigning_Work
|
|
|
lc82_Remove_Duplicates_from_Sorted_List_II
|
|
|
lc841_Keys_and_Rooms
|
|
|
lc852_Peak_Index_in_a_Mountain_Array
|
|
|
lc867
|
|
|
lc872_Leaf-Similar_Trees
|
|
|
lc875_Koko_Eating_Bananas
|
|
|
lc888_Fair_Candy_Swap
|
|
|
lc88_Merge_Sorted_Array
|
|
|
lc897_Increasing_Order_Search_Tree
|
|
|
lc9
|
|
|
lc911_Online_Election
|
|
|
lc912_Sort_an_Array
|
|
|
lc918_Maximum_Sum_Circular_Subarray
|
|
|
lc91_Decode_Ways
|
|
|
lc931_Minimum_Falling_Path_Sum
|
|
|
lc938_Range_Sum_BST
|
|
|
lc94_Binary_Tree_Inorder_Traversal
|
|
|
lc95_Unique_Binary_Search_Trees_II
|
|
|
lc965_Univalued_Binary_Tree
|
|
|
lc96_Unique_Binary_Search_Trees
|
|
|
lc973_K_Closest_Points_to_Origin
|
|
|
lc981_Time_Based_Key-Value_Store
|
|
|
lc98_Validate_Binary_Search_Tree
|
|
|
lc993_Cousins_in_Binary_Tree
|
|
|
lc997_Find_the_Town_Judge
|
|
|
lc99_Recover_Binary_Search_Tree
|
|
|
offer26
|
|
Click to show internal directories.
Click to hide internal directories.