Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/futantan/dir-for-leetcode

Last synced: about 1 month ago
JSON representation
Host: GitHub
URL: https://github.com/futantan/dir-for-leetcode
Owner: futantan
Created: 2015-11-05T06:22:23.000Z (about 9 years ago)
Default Branch: master
Last Pushed: 2015-11-05T06:23:13.000Z (about 9 years ago)
Last Synced: 2024-03-16T06:51:18.112Z (10 months ago)
Size: 195 KB
Stars: 2
Watchers: 3
Forks: 2
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        |Problem|Completed|

| --- | --- |

|[001_Two_Sum](LeetCode/001_Two_Sum)| |

|[002_Add_Two_Numbers](LeetCode/002_Add_Two_Numbers)| |

|[003_Longest_Substring_Without_Repeating_Characters](LeetCode/003_Longest_Substring_Without_Repeating_Characters)| |

|[004_Median_of_Two_Sorted_Arrays](LeetCode/004_Median_of_Two_Sorted_Arrays)| |

|[005_Longest_Palindromic_Substring](LeetCode/005_Longest_Palindromic_Substring)| |

|[006_ZigZag_Conversion](LeetCode/006_ZigZag_Conversion)| |

|[007_Reverse_Integer](LeetCode/007_Reverse_Integer)| |

|[008_String_to_Integer_(atoi)](LeetCode/008_String_to_Integer_(atoi))| |

|[009_Palindrome_Number](LeetCode/009_Palindrome_Number)| |

|[010_Regular_Expression_Matching](LeetCode/010_Regular_Expression_Matching)| |

|[011_Container_With_Most_Water](LeetCode/011_Container_With_Most_Water)| |

|[012_Integer_to_Roman](LeetCode/012_Integer_to_Roman)| |

|[013_Roman_to_Integer](LeetCode/013_Roman_to_Integer)| |

|[014_Longest_Common_Prefix](LeetCode/014_Longest_Common_Prefix)| |

|[015_3Sum](LeetCode/015_3Sum)| |

|[016_3Sum_Closest](LeetCode/016_3Sum_Closest)| |

|[017_Letter_Combinations_of_a_Phone_Number](LeetCode/017_Letter_Combinations_of_a_Phone_Number)| |

|[018_4Sum](LeetCode/018_4Sum)| |

|[019_Remove_Nth_Node_From_End_of_List](LeetCode/019_Remove_Nth_Node_From_End_of_List)| |

|[020_Valid_Parentheses](LeetCode/020_Valid_Parentheses)| |

|[021_Merge_Two_Sorted_Lists](LeetCode/021_Merge_Two_Sorted_Lists)| |

|[022_Generate_Parentheses](LeetCode/022_Generate_Parentheses)| |

|[023_Merge_k_Sorted_Lists](LeetCode/023_Merge_k_Sorted_Lists)| |

|[024_Swap_Nodes_in_Pairs](LeetCode/024_Swap_Nodes_in_Pairs)| |

|[025_Reverse_Nodes_in_k-Group](LeetCode/025_Reverse_Nodes_in_k-Group)| |

|[026_Remove_Duplicates_from_Sorted_Array](LeetCode/026_Remove_Duplicates_from_Sorted_Array)| |

|[027_Remove_Element](LeetCode/027_Remove_Element)| |

|[028_Implement_strStr()](LeetCode/028_Implement_strStr())| |

|[029_Divide_Two_Integers](LeetCode/029_Divide_Two_Integers)| |

|[030_Substring_with_Concatenation_of_All_Words](LeetCode/030_Substring_with_Concatenation_of_All_Words)| |

|[031_Next_Permutation](LeetCode/031_Next_Permutation)| |

|[032_Longest_Valid_Parentheses](LeetCode/032_Longest_Valid_Parentheses)| |

|[033_Search_in_Rotated_Sorted_Array](LeetCode/033_Search_in_Rotated_Sorted_Array)| |

|[034_Search_for_a_Range](LeetCode/034_Search_for_a_Range)| |

|[035_Search_Insert_Position](LeetCode/035_Search_Insert_Position)| |

|[036_Valid_Sudoku](LeetCode/036_Valid_Sudoku)| |

|[037_Sudoku_Solver](LeetCode/037_Sudoku_Solver)| |

|[038_Count_and_Say](LeetCode/038_Count_and_Say)| |

|[039_Combination_Sum](LeetCode/039_Combination_Sum)| |

|[040_Combination_Sum_II](LeetCode/040_Combination_Sum_II)| |

|[041_First_Missing_Positive](LeetCode/041_First_Missing_Positive)| |

|[042_Trapping_Rain_Water](LeetCode/042_Trapping_Rain_Water)| |

|[043_Multiply_Strings](LeetCode/043_Multiply_Strings)| |

|[044_Wildcard_Matching](LeetCode/044_Wildcard_Matching)| |

|[045_Jump_Game_II](LeetCode/045_Jump_Game_II)| |

|[046_Permutations](LeetCode/046_Permutations)| |

|[047_Permutations_II](LeetCode/047_Permutations_II)| |

|[048_Rotate_Image](LeetCode/048_Rotate_Image)| |

|[049_Group_Anagrams](LeetCode/049_Group_Anagrams)| |

|[050_Pow(x,_n)](LeetCode/050_Pow(x,_n))| |

|[051_N-Queens](LeetCode/051_N-Queens)| |

|[052_N-Queens_II](LeetCode/052_N-Queens_II)| |

|[053_Maximum_Subarray](LeetCode/053_Maximum_Subarray)| |

|[054_Spiral_Matrix](LeetCode/054_Spiral_Matrix)| |

|[055_Jump_Game](LeetCode/055_Jump_Game)| |

|[056_Merge_Intervals](LeetCode/056_Merge_Intervals)| |

|[057_Insert_Interval](LeetCode/057_Insert_Interval)| |

|[058_Length_of_Last_Word](LeetCode/058_Length_of_Last_Word)| |

|[059_Spiral_Matrix_II](LeetCode/059_Spiral_Matrix_II)| |

|[060_Permutation_Sequence](LeetCode/060_Permutation_Sequence)| |

|[061_Rotate_List](LeetCode/061_Rotate_List)| |

|[062_Unique_Paths](LeetCode/062_Unique_Paths)| |

|[063_Unique_Paths_II](LeetCode/063_Unique_Paths_II)| |

|[064_Minimum_Path_Sum](LeetCode/064_Minimum_Path_Sum)| |

|[065_Valid_Number](LeetCode/065_Valid_Number)| |

|[066_Plus_One](LeetCode/066_Plus_One)| |

|[067_Add_Binary](LeetCode/067_Add_Binary)| |

|[068_Text_Justification](LeetCode/068_Text_Justification)| |

|[069_Sqrt(x)](LeetCode/069_Sqrt(x))| |

|[070_Climbing_Stairs](LeetCode/070_Climbing_Stairs)| |

|[071_Simplify_Path](LeetCode/071_Simplify_Path)| |

|[072_Edit_Distance](LeetCode/072_Edit_Distance)| |

|[073_Set_Matrix_Zeroes](LeetCode/073_Set_Matrix_Zeroes)| |

|[074_Search_a_2D_Matrix](LeetCode/074_Search_a_2D_Matrix)| |

|[075_Sort_Colors](LeetCode/075_Sort_Colors)| |

|[076_Minimum_Window_Substring](LeetCode/076_Minimum_Window_Substring)| |

|[077_Combinations](LeetCode/077_Combinations)| |

|[078_Subsets](LeetCode/078_Subsets)| |

|[079_Word_Search](LeetCode/079_Word_Search)| |

|[080_Remove_Duplicates_from_Sorted_Array_II](LeetCode/080_Remove_Duplicates_from_Sorted_Array_II)| |

|[081_Search_in_Rotated_Sorted_Array_II](LeetCode/081_Search_in_Rotated_Sorted_Array_II)| |

|[082_Remove_Duplicates_from_Sorted_List_II](LeetCode/082_Remove_Duplicates_from_Sorted_List_II)| |

|[083_Remove_Duplicates_from_Sorted_List](LeetCode/083_Remove_Duplicates_from_Sorted_List)| |

|[084_Largest_Rectangle_in_Histogram](LeetCode/084_Largest_Rectangle_in_Histogram)| |

|[085_Maximal_Rectangle](LeetCode/085_Maximal_Rectangle)| |

|[086_Partition_List](LeetCode/086_Partition_List)| |

|[087_Scramble_String](LeetCode/087_Scramble_String)| |

|[088_Merge_Sorted_Array](LeetCode/088_Merge_Sorted_Array)| |

|[089_Gray_Code](LeetCode/089_Gray_Code)| |

|[090_Subsets_II](LeetCode/090_Subsets_II)| |

|[091_Decode_Ways](LeetCode/091_Decode_Ways)| |

|[092_Reverse_Linked_List_II](LeetCode/092_Reverse_Linked_List_II)| |

|[093_Restore_IP_Addresses](LeetCode/093_Restore_IP_Addresses)| |

|[094_Binary_Tree_Inorder_Traversal](LeetCode/094_Binary_Tree_Inorder_Traversal)| |

|[095_Unique_Binary_Search_Trees_II](LeetCode/095_Unique_Binary_Search_Trees_II)| |

|[096_Unique_Binary_Search_Trees](LeetCode/096_Unique_Binary_Search_Trees)| |

|[097_Interleaving_String](LeetCode/097_Interleaving_String)| |

|[098_Validate_Binary_Search_Tree](LeetCode/098_Validate_Binary_Search_Tree)| |

|[099_Recover_Binary_Search_Tree](LeetCode/099_Recover_Binary_Search_Tree)| |

|[100_Same_Tree](LeetCode/100_Same_Tree)| |

|[101_Symmetric_Tree](LeetCode/101_Symmetric_Tree)| |

|[102_Binary_Tree_Level_Order_Traversal](LeetCode/102_Binary_Tree_Level_Order_Traversal)| |

|[103_Binary_Tree_Zigzag_Level_Order_Traversal](LeetCode/103_Binary_Tree_Zigzag_Level_Order_Traversal)| |

|[104_Maximum_Depth_of_Binary_Tree](LeetCode/104_Maximum_Depth_of_Binary_Tree)| |

|[105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal](LeetCode/105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal)| |

|[106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal](LeetCode/106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal)| |

|[107_Binary_Tree_Level_Order_Traversal_II](LeetCode/107_Binary_Tree_Level_Order_Traversal_II)| |

|[108_Convert_Sorted_Array_to_Binary_Search_Tree](LeetCode/108_Convert_Sorted_Array_to_Binary_Search_Tree)| |

|[109_Convert_Sorted_List_to_Binary_Search_Tree](LeetCode/109_Convert_Sorted_List_to_Binary_Search_Tree)| |

|[110_Balanced_Binary_Tree](LeetCode/110_Balanced_Binary_Tree)| |

|[111_Minimum_Depth_of_Binary_Tree](LeetCode/111_Minimum_Depth_of_Binary_Tree)| |

|[112_Path_Sum](LeetCode/112_Path_Sum)| |

|[113_Path_Sum_II](LeetCode/113_Path_Sum_II)| |

|[114_Flatten_Binary_Tree_to_Linked_List](LeetCode/114_Flatten_Binary_Tree_to_Linked_List)| |

|[115_Distinct_Subsequences](LeetCode/115_Distinct_Subsequences)| |

|[116_Populating_Next_Right_Pointers_in_Each_Node](LeetCode/116_Populating_Next_Right_Pointers_in_Each_Node)| |

|[117_Populating_Next_Right_Pointers_in_Each_Node_II](LeetCode/117_Populating_Next_Right_Pointers_in_Each_Node_II)| |

|[118_Pascal's_Triangle](LeetCode/118_Pascal's_Triangle)| |

|[119_Pascal's_Triangle_II](LeetCode/119_Pascal's_Triangle_II)| |

|[120_Triangle](LeetCode/120_Triangle)| |

|[121_Best_Time_to_Buy_and_Sell_Stock](LeetCode/121_Best_Time_to_Buy_and_Sell_Stock)| |

|[122_Best_Time_to_Buy_and_Sell_Stock_II](LeetCode/122_Best_Time_to_Buy_and_Sell_Stock_II)| |

|[123_Best_Time_to_Buy_and_Sell_Stock_III](LeetCode/123_Best_Time_to_Buy_and_Sell_Stock_III)| |

|[124_Binary_Tree_Maximum_Path_Sum](LeetCode/124_Binary_Tree_Maximum_Path_Sum)| |

|[125_Valid_Palindrome](LeetCode/125_Valid_Palindrome)| |

|[126_Word_Ladder_II](LeetCode/126_Word_Ladder_II)| |

|[127_Word_Ladder](LeetCode/127_Word_Ladder)| |

|[128_Longest_Consecutive_Sequence](LeetCode/128_Longest_Consecutive_Sequence)| |

|[129_Sum_Root_to_Leaf_Numbers](LeetCode/129_Sum_Root_to_Leaf_Numbers)| |

|[130_Surrounded_Regions](LeetCode/130_Surrounded_Regions)| |

|[131_Palindrome_Partitioning](LeetCode/131_Palindrome_Partitioning)| |

|[132_Palindrome_Partitioning_II](LeetCode/132_Palindrome_Partitioning_II)| |

|[133_Clone_Graph](LeetCode/133_Clone_Graph)| |

|[134_Gas_Station](LeetCode/134_Gas_Station)| |

|[135_Candy](LeetCode/135_Candy)| |

|[136_Single_Number](LeetCode/136_Single_Number)| |

|[137_Single_Number_II](LeetCode/137_Single_Number_II)| |

|[138_Copy_List_with_Random_Pointer](LeetCode/138_Copy_List_with_Random_Pointer)| |

|[139_Word_Break](LeetCode/139_Word_Break)| |

|[140_Word_Break_II](LeetCode/140_Word_Break_II)| |

|[141_Linked_List_Cycle](LeetCode/141_Linked_List_Cycle)| |

|[142_Linked_List_Cycle_II](LeetCode/142_Linked_List_Cycle_II)| |

|[143_Reorder_List](LeetCode/143_Reorder_List)| |

|[144_Binary_Tree_Preorder_Traversal](LeetCode/144_Binary_Tree_Preorder_Traversal)| |

|[145_Binary_Tree_Postorder_Traversal](LeetCode/145_Binary_Tree_Postorder_Traversal)| |

|[146_LRU_Cache](LeetCode/146_LRU_Cache)| |

|[147_Insertion_Sort_List](LeetCode/147_Insertion_Sort_List)| |

|[148_Sort_List](LeetCode/148_Sort_List)| |

|[149_Max_Points_on_a_Line](LeetCode/149_Max_Points_on_a_Line)| |

|[150_Evaluate_Reverse_Polish_Notation](LeetCode/150_Evaluate_Reverse_Polish_Notation)| |

|[151_Reverse_Words_in_a_String](LeetCode/151_Reverse_Words_in_a_String)| |

|[152_Maximum_Product_Subarray](LeetCode/152_Maximum_Product_Subarray)| |

|[153_Find_Minimum_in_Rotated_Sorted_Array](LeetCode/153_Find_Minimum_in_Rotated_Sorted_Array)| |

|[154_Find_Minimum_in_Rotated_Sorted_Array_II](LeetCode/154_Find_Minimum_in_Rotated_Sorted_Array_II)| |

|[155_Min_Stack](LeetCode/155_Min_Stack)| |

|[160_Intersection_of_Two_Linked_Lists](LeetCode/160_Intersection_of_Two_Linked_Lists)| |

|[162_Find_Peak_Element](LeetCode/162_Find_Peak_Element)| |

|[164_Maximum_Gap](LeetCode/164_Maximum_Gap)| |

|[165_Compare_Version_Numbers](LeetCode/165_Compare_Version_Numbers)| |

|[166_Fraction_to_Recurring_Decimal](LeetCode/166_Fraction_to_Recurring_Decimal)| |

|[168_Excel_Sheet_Column_Title](LeetCode/168_Excel_Sheet_Column_Title)| |

|[169_Majority_Element](LeetCode/169_Majority_Element)| |

|[171_Excel_Sheet_Column_Number](LeetCode/171_Excel_Sheet_Column_Number)| |

|[172_Factorial_Trailing_Zeroes](LeetCode/172_Factorial_Trailing_Zeroes)| |

|[173_Binary_Search_Tree_Iterator](LeetCode/173_Binary_Search_Tree_Iterator)| |

|[174_Dungeon_Game](LeetCode/174_Dungeon_Game)| |

|[179_Largest_Number](LeetCode/179_Largest_Number)| |

|[187_Repeated_DNA_Sequences](LeetCode/187_Repeated_DNA_Sequences)| |

|[188_Best_Time_to_Buy_and_Sell_Stock_IV](LeetCode/188_Best_Time_to_Buy_and_Sell_Stock_IV)| |

|[189_Rotate_Array](LeetCode/189_Rotate_Array)| |

|[190_Reverse_Bits](LeetCode/190_Reverse_Bits)| |

|[191_Number_of_1_Bits](LeetCode/191_Number_of_1_Bits)| |

|[198_House_Robber](LeetCode/198_House_Robber)| |

|[199_Binary_Tree_Right_Side_View](LeetCode/199_Binary_Tree_Right_Side_View)| |

|[200_Number_of_Islands](LeetCode/200_Number_of_Islands)| |

|[201_Bitwise_AND_of_Numbers_Range](LeetCode/201_Bitwise_AND_of_Numbers_Range)| |

|[202_Happy_Number](LeetCode/202_Happy_Number)| |

|[203_Remove_Linked_List_Elements](LeetCode/203_Remove_Linked_List_Elements)| |

|[204_Count_Primes](LeetCode/204_Count_Primes)| |

|[205_Isomorphic_Strings](LeetCode/205_Isomorphic_Strings)| |

|[206_Reverse_Linked_List](LeetCode/206_Reverse_Linked_List)| |

|[207_Course_Schedule](LeetCode/207_Course_Schedule)| |

|[208_Implement_Trie_(Prefix_Tree)](LeetCode/208_Implement_Trie_(Prefix_Tree))| |

|[209_Minimum_Size_Subarray_Sum](LeetCode/209_Minimum_Size_Subarray_Sum)| |

|[210_Course_Schedule_II](LeetCode/210_Course_Schedule_II)| |

|[211_Add_and_Search_Word_-_Data_structure_design](LeetCode/211_Add_and_Search_Word_-_Data_structure_design)| |

|[212_Word_Search_II](LeetCode/212_Word_Search_II)| |

|[213_House_Robber_II](LeetCode/213_House_Robber_II)| |

|[214_Shortest_Palindrome](LeetCode/214_Shortest_Palindrome)| |

|[215_Kth_Largest_Element_in_an_Array](LeetCode/215_Kth_Largest_Element_in_an_Array)| |

|[216_Combination_Sum_III](LeetCode/216_Combination_Sum_III)| |

|[217_Contains_Duplicate](LeetCode/217_Contains_Duplicate)| |

|[218_The_Skyline_Problem](LeetCode/218_The_Skyline_Problem)| |

|[219_Contains_Duplicate_II](LeetCode/219_Contains_Duplicate_II)| |

|[220_Contains_Duplicate_III](LeetCode/220_Contains_Duplicate_III)| |

|[221_Maximal_Square](LeetCode/221_Maximal_Square)| |

|[222_Count_Complete_Tree_Nodes](LeetCode/222_Count_Complete_Tree_Nodes)| |

|[223_Rectangle_Area](LeetCode/223_Rectangle_Area)| |

|[224_Basic_Calculator](LeetCode/224_Basic_Calculator)| |

|[225_Implement_Stack_using_Queues](LeetCode/225_Implement_Stack_using_Queues)| |

|[226_Invert_Binary_Tree](LeetCode/226_Invert_Binary_Tree)| |

|[227_Basic_Calculator_II](LeetCode/227_Basic_Calculator_II)| |

|[228_Summary_Ranges](LeetCode/228_Summary_Ranges)| |

|[229_Majority_Element_II](LeetCode/229_Majority_Element_II)| |

|[230_Kth_Smallest_Element_in_a_BST](LeetCode/230_Kth_Smallest_Element_in_a_BST)| |

|[231_Power_of_Two](LeetCode/231_Power_of_Two)| |

|[232_Implement_Queue_using_Stacks](LeetCode/232_Implement_Queue_using_Stacks)| |

|[233_Number_of_Digit_One](LeetCode/233_Number_of_Digit_One)| |

|[234_Palindrome_Linked_List](LeetCode/234_Palindrome_Linked_List)| |

|[235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree](LeetCode/235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree)| |

|[236_Lowest_Common_Ancestor_of_a_Binary_Tree](LeetCode/236_Lowest_Common_Ancestor_of_a_Binary_Tree)| |

|[237_Delete_Node_in_a_Linked_List](LeetCode/237_Delete_Node_in_a_Linked_List)| |

|[238_Product_of_Array_Except_Self](LeetCode/238_Product_of_Array_Except_Self)| |

|[239_Sliding_Window_Maximum](LeetCode/239_Sliding_Window_Maximum)| |

|[240_Search_a_2D_Matrix_II](LeetCode/240_Search_a_2D_Matrix_II)| |

|[241_Different_Ways_to_Add_Parentheses](LeetCode/241_Different_Ways_to_Add_Parentheses)| |

|[242_Valid_Anagram](LeetCode/242_Valid_Anagram)| |

|[257_Binary_Tree_Paths](LeetCode/257_Binary_Tree_Paths)| |

|[258_Add_Digits](LeetCode/258_Add_Digits)| |

|[260_Single_Number_III](LeetCode/260_Single_Number_III)| |

|[263_Ugly_Number](LeetCode/263_Ugly_Number)| |

|[264_Ugly_Number_II](LeetCode/264_Ugly_Number_II)| |

|[268_Missing_Number](LeetCode/268_Missing_Number)| |

|[273_Integer_to_English_Words](LeetCode/273_Integer_to_English_Words)| |

|[274_H-Index](LeetCode/274_H-Index)| |

|[275_H-Index_II](LeetCode/275_H-Index_II)| |

|[278_First_Bad_Version](LeetCode/278_First_Bad_Version)| |

|[279_Perfect_Squares](LeetCode/279_Perfect_Squares)| |

|[282_Expression_Add_Operators](LeetCode/282_Expression_Add_Operators)| |

|[283_Move_Zeroes](LeetCode/283_Move_Zeroes)| |

|[284_Peeking_Iterator](LeetCode/284_Peeking_Iterator)| |

|[287_Find_the_Duplicate_Number](LeetCode/287_Find_the_Duplicate_Number)| |

|[289_Game_of_Life](LeetCode/289_Game_of_Life)| |

|[290_Word_Pattern](LeetCode/290_Word_Pattern)| |

|[292_Nim_Game](LeetCode/292_Nim_Game)| |

|[295_Find_Median_from_Data_Stream](LeetCode/295_Find_Median_from_Data_Stream)| |

|[297_Serialize_and_Deserialize_Binary_Tree](LeetCode/297_Serialize_and_Deserialize_Binary_Tree)| |

|[299_Bulls_and_Cows](LeetCode/299_Bulls_and_Cows)| |

|[300_Longest_Increasing_Subsequence](LeetCode/300_Longest_Increasing_Subsequence)| |

|[301_Remove_Invalid_Parentheses](LeetCode/301_Remove_Invalid_Parentheses)| |