Directories ¶
Path | Synopsis |
---|---|
0000_Base_Algo_And_DataStruct
|
|
0001_Two_Sum
|
|
0002_Add_Two_Numbers
|
|
0003_Longest_Substring_Without_Repeating_Characters
|
|
0004_Median_of_Two_Sorted_Arrays
|
|
0005_Longest_Palindromic_Substring
|
|
0006_ZigZag_Conversion
|
|
0007_Reverse_Integer
|
|
0008_String_to_Integer
|
|
0009_Palindrome_Number
|
|
0011_Container_With_Most_Water
|
|
0013_Roman_to_Integer
|
|
0014_Longest_Commom_Prefix
|
|
0015_3Sum
|
|
0016_3Sum_Closest
|
|
0017_Letter_Combinations_of_a_Phone_Number
|
|
0018_4Sum
|
|
0019_Remove_Nth_Node_From_End_of_List
|
|
0020_Valid_Parentheses
|
|
0021_Merge_Two_Sorted_Lists
|
|
0022_Generate_Parentheses
|
|
0023_Merge_K_Sorted_List
|
|
0024_Swap_Nodes_in_Pairs
|
|
0025_Reverse_Node_in_k_Group
|
|
0026_Remove_Duplicates_from_Sorted_Array
|
|
0027_Remove_Element
|
|
0031_Next_Permutation
|
|
0033_Search_in_Rotated_Sorted_Array
|
|
0036_Valid_Sudoku
|
|
0037_Sudoku_Solver
|
|
0039_Combination_Sum
|
|
0040_Combination_Sum_II
|
|
0042_Trapping_Rain_Water
|
|
0043_Multiply_Strings
|
|
0045_Jump_Game_II
|
|
0046_Permutations
|
|
0047_Permutations_II
|
|
0049_Group_Anagrams
|
|
0051_N-Queens
|
|
0053_Maximum_Subarray
|
|
0055_Jump_Game
|
|
0056_Merge_Intervals
|
|
0060_Permutation_Sequence
|
|
0062_Unique_Paths
|
|
0064_Minimum_Path_Sum
|
|
0069_Sqrt_x
|
|
0070_Climbing_Stairs
|
|
0071_Simplify_Path
|
|
0075_Sort_Colors
|
|
0076_Minimum_Window_Substring
|
|
0077_Combinations
|
|
0078_Subsets
|
|
0079_Word_Search
|
|
0080_Remove_Duplicates_from_Sorted_Array_II
|
|
0084_Largest_Rectangle_in_Histogram
|
|
0085_Maximal_Rectangle
|
|
0086_Partition_List
|
|
0088_Merge_Sorted_Array
|
|
0090_Subsets_II
|
|
0092_Reverse_Linked_List_II
|
|
0093_Restore_IP_Addresses
|
|
0094_Binary_Tree_Inorder_Traversal
|
|
0096_Unique_Binary_Search_Trees
|
|
0098_Validate_Binary_Search_Tree
|
|
0100_Same_Tree
|
|
0101_Symmetric_Tree
|
|
0102_Binary_Tree_Level_Order_Traversal
|
|
0104_Maximum_Depth_of_Binary_Tree
|
|
0105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
|
|
0108_Convert_Sorted_Array_to_Binary_Search_Tree
|
|
0110_Balanced_Binary_Tree
|
|
0111_Minimum_Depth_of_Binary_Tree
|
|
0114_Flatten_Binary_Tree_to_Linked_List
|
|
0120_Triangle
|
|
0121_Beat_Time_to_Buy_and_Sell_Stock
|
|
0122_Bast_Time_to_Buy_and_Sell_Stock_II
|
|
0124_Binary_Tree_Max_Path_Sum
|
|
0125_Valid_Palindrome
|
|
0128_Longest_Consecutive_Sequence
|
|
0131_Palindroma_Partitioning
|
|
0136_Single_Number
|
|
0138_Copy_List_with_Random_Pointer
|
|
0139_Word_Break
|
|
0141_Linked_List_Cycle
|
|
0142_Linked_List_Cycle_II
|
|
0144_Binary_Tree_Preorder_Traversal
|
|
0145_Binary_Tree_Postorder_Traversal
|
|
0146_LRU_Cache
|
|
0148_Sort_List
|
|
0151_Reverse_Words_in_a_String
|
|
0152_Maximum_Product_Subarray
|
|
0155_Min_Stack
|
|
0160_Intersection_of_Two_Linked_List
|
|
0167_Two_Sum_II_Input_array_is_sorted
|
|
0169_Majority_Element
|
|
0199_Binary_Tree_Right_Side_View
|
|
0203_Remove_Linked_List_Elements
|
|
0205_Isomorphic_Strings
|
|
0206_Reverse_Linked_List
|
|
0209_Minimum_Size_Subarray_Sum
|
|
0215_Kth_Largest_Element_in_an_Array
|
|
0216_Combination_Sum_III
|
|
0221_Maximal_Square
|
|
0225_Implement_Stack_using_Queues
|
|
0226_Invert_Binary_Tree
|
|
0230_Kth_Smallest_Element_in_a_BST
|
|
0234_Palindrome_Linked_List
|
|
0236_Lowset_Common_Ancestor_of_a_Binary_Tree
|
|
0237_Delete_Node_in_a_Linked_List
|
|
0242_Valid_Anagram
|
|
0257_Binary_Tree_Paths
|
|
0283_Move_Zeroes
|
|
0290_Word_Pattern
|
|
0297_Serialize_and_Deserialize_Binary_Tree
|
|
0300_Longest_Increasing_SubSequence
|
|
0312_Burst_Balloons
|
|
0322_Coin_Change
|
|
0338_Counting_Bits
|
|
0344_Reverse_String
|
|
0345_Reverse_Vowels_of_a_String
|
|
0354_Russian_Doll_Envelopes
|
|
0393_UTF8_Validation
|
|
0401_Binary_Watch
|
|
0409_Longest_Palindrome
|
|
0410_Split_Array_Largest_Sum
|
|
0416_Partition_Equal_Subset_Sum
|
|
0432_All_O_One_Data_Structure
|
|
0437_Path_Sum_III
|
|
0438_Find_All_Anagrams_in_a_String
|
|
0496_Next_Greater_Element_I
|
|
0503_Next_Greater_Element_II
|
|
0509_Fibonacci_Number
|
|
0514_Freedom_Trail
|
|
0538_Convert_BST_to_Greater_Tree
|
|
0543_Diameter_of_Binary_Tree
|
|
0547_Number_of_Province
|
|
0567_Permutation_in_String
|
|
0617_Merge_Two_Binary_Trees
|
|
0647_Palindromic_Substrings
|
|
0674_Longest_Continuous_Increasing_Subsequence
|
|
0692_Top_K_Frequent_Words
|
|
0695_Max_Area_of_Island
|
|
0696_Count_Binary_Substrings
|
|
0714_Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee
|
|
0739_Daily_Temperatures
|
|
0810_Chalkboard_XOR_Game
|
|
0836_Rectangle_Overlap
|
|
0887_Super_Egg_Drop
|
|
0896_Monotonic_Array
|
|
0962_Maximum_Width_Ramp
|
|
0994_Rotting_Oranges
|
|
1013_Partition_Array_Into_Three_Part_With_Equal_Sum
|
|
1014_Best_Sightseeing_Pair
|
|
1019_Next_Greater_Node_In_Linked_List
|
|
1025_Divisor_Game
|
|
1103_Distribute_Candies_to_People
|
|
1124_Longest_Well-Performing_Interval
|
|
1160_Find_Words_That_Can_Be_Formed_by_Characters
|
|
1208_Get_Equal_Substrings_Within_Budet
|
|
1300_Sum_of_Mutated_Array_Closest_to_Target
|
|
1422_Maximun_Score_After_Splitting_a_String
|
|
1423_Maximum_Points_You_Can_Option_from_Cards
|
|
1738_Find_Kth_Largest_XOR_Coordinate_Value
|
|
1962_Remove_Stones_to_Minimize_the_Total
|
|
1967_Number_of_Strings_That_Appear_as_Substring_in_Word
|
|
1968_Array_With_Element_Not_Equal_to_Average_of_Neighbors
|
|
InterviewQuestions_01.06_Compress_String_LCCI
|
|
InterviewQuestions_046_Translate_Numbers_Into_Strings
|
|
InterviewQuestions_057.II_Continuous_Positive_Sequence_Whose_Sum_Is_S
|
|
InterviewQuestions_059.II_The_Max_Value_of_Queue
|
|
InterviewQuestions_10.01_Sorted_Merge_LCCI
|
|
JianzhiOffer_32_III_Print_Binary_Tree_III
|
|
JianzhiOffer_36_Binary_Search_Tree_and_Linked_List
|
|
JianzhiOffer_51_Reverse_Pairs_in_Array
|
|
JianzhiOffer_II_077_Sort_Linked_List
|
|
Click to show internal directories.
Click to hide internal directories.