GitHub

My solutions to the Leetcode online judge problems. https://oj.leetcode.com/problems/

More explanation for each question will come soon. I will categorizes them as well.

General idea for the solution.
Covered data structure and algorithm.
Pattern for the algorithm.

Name		Name	Last commit message	Last commit date
Latest commit History 24 Commits
Add_Two_Numbers.cpp		Add_Two_Numbers.cpp
Anagrams.cpp		Anagrams.cpp
Balanced_Binary_Tree.cpp		Balanced_Binary_Tree.cpp
Best_Time_to_Buy_and_Sell_Stock.cpp		Best_Time_to_Buy_and_Sell_Stock.cpp
Best_Time_to_Buy_and_Sell_Stock_2.cpp		Best_Time_to_Buy_and_Sell_Stock_2.cpp
Best_Time_to_Buy_and_Sell_Stock_3.cpp		Best_Time_to_Buy_and_Sell_Stock_3.cpp
Binary_Tree_Inorder_Traversal.cpp		Binary_Tree_Inorder_Traversal.cpp
Binary_Tree_Level_Order_Traversal.cpp		Binary_Tree_Level_Order_Traversal.cpp
Binary_Tree_Level_Order_Traversal_2.cpp		Binary_Tree_Level_Order_Traversal_2.cpp
Binary_Tree_Maximum_Path_Sum.cpp		Binary_Tree_Maximum_Path_Sum.cpp
Binary_Tree_Postorder_Traversal.cpp		Binary_Tree_Postorder_Traversal.cpp
Binary_Tree_Preorder_Traversal.cpp		Binary_Tree_Preorder_Traversal.cpp
Binary_Tree_Zigzag_Order_Traversal.cpp		Binary_Tree_Zigzag_Order_Traversal.cpp
Candy.cpp		Candy.cpp
Climbing_Stairs.cpp		Climbing_Stairs.cpp
Clone_Graph.cpp		Clone_Graph.cpp
Combination_Sum.cpp		Combination_Sum.cpp
Combination_Sum_2.cpp		Combination_Sum_2.cpp
Combinations.cpp		Combinations.cpp
Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp		Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp
Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp		Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp
Container_With_Most_Water.cpp		Container_With_Most_Water.cpp
Convert_Sorted_Array_to_Binary_Search_Tree.cpp		Convert_Sorted_Array_to_Binary_Search_Tree.cpp
Convert_Sorted_List_to_Binary_Search_Tree.cpp		Convert_Sorted_List_to_Binary_Search_Tree.cpp
Count_and_Say.cpp		Count_and_Say.cpp
Decode_Ways.cpp		Decode_Ways.cpp
Distinct_Subsequences.cpp		Distinct_Subsequences.cpp
Edit_Distance.cpp		Edit_Distance.cpp
Evaluate_Reverse_Polish_Notation.cpp		Evaluate_Reverse_Polish_Notation.cpp
First_Missing_Positive.cpp		First_Missing_Positive.cpp
Flatten_Binary_Tree_to_Linked_List.cpp		Flatten_Binary_Tree_to_Linked_List.cpp
Four_Sum.cpp		Four_Sum.cpp
Gas_Station.cpp		Gas_Station.cpp
Generate_Parentheses.cpp		Generate_Parentheses.cpp
Gray_Code.cpp		Gray_Code.cpp
Implement_strStr.cpp		Implement_strStr.cpp
Insert_Interval.cpp		Insert_Interval.cpp
Insertion_Sort_List.cpp		Insertion_Sort_List.cpp
Integer_to_Roman.cpp		Integer_to_Roman.cpp
Interleaving_String.cpp		Interleaving_String.cpp
Jump_Game.cpp		Jump_Game.cpp
Jump_Game_2.cpp		Jump_Game_2.cpp
LRU_Cache.cpp		LRU_Cache.cpp
Length_of_Last_Word.cpp		Length_of_Last_Word.cpp
Longest_Common_Prefix.cpp		Longest_Common_Prefix.cpp
Longest_Consecutive_Sequence.cpp		Longest_Consecutive_Sequence.cpp
Longest_Palindromic_Substring.cpp		Longest_Palindromic_Substring.cpp
Longest_Valid_Parentheses.cpp		Longest_Valid_Parentheses.cpp
Max_Points_on_a_Line.cpp		Max_Points_on_a_Line.cpp
Maximum_Depth_of_Binary_Tree.cpp		Maximum_Depth_of_Binary_Tree.cpp
Maximum_Subarray.cpp		Maximum_Subarray.cpp
Merge_Intervals.cpp		Merge_Intervals.cpp
Merge_Sorted_Array.cpp		Merge_Sorted_Array.cpp
Merge_Two_Sorted_Lists.cpp		Merge_Two_Sorted_Lists.cpp
Minimum_Depth_of_Binary_Tree.cpp		Minimum_Depth_of_Binary_Tree.cpp
Minimum_Path_Sum.cpp		Minimum_Path_Sum.cpp
N-Queens.cpp		N-Queens.cpp
N-Queens_2.cpp		N-Queens_2.cpp
Next_Permutation.cpp		Next_Permutation.cpp
Palindrome_Number.cpp		Palindrome_Number.cpp
Palindrome_Partitioning.cpp		Palindrome_Partitioning.cpp
Partition_List.cpp		Partition_List.cpp
Pascal_Triangle.cpp		Pascal_Triangle.cpp
Pascal_Triangle_2.cpp		Pascal_Triangle_2.cpp
Path_Sum.cpp		Path_Sum.cpp
Path_Sum_2.cpp		Path_Sum_2.cpp
Permutation_Sequence.cpp		Permutation_Sequence.cpp
Permutations.cpp		Permutations.cpp
Permutations_2.cpp		Permutations_2.cpp
Plus_One.cpp		Plus_One.cpp
Populating_Next_Right_Pointers_in_Each_Node.cpp		Populating_Next_Right_Pointers_in_Each_Node.cpp
Populating_Next_Right_Pointers_in_Each_Node_2.cpp		Populating_Next_Right_Pointers_in_Each_Node_2.cpp
Pow.cpp		Pow.cpp
README.md		README.md
Recover_Binary_Search_Tree.cpp		Recover_Binary_Search_Tree.cpp
Remove_Duplicates_from_Sorted_Array.cpp		Remove_Duplicates_from_Sorted_Array.cpp
Remove_Duplicates_from_Sorted_Array_2.cpp		Remove_Duplicates_from_Sorted_Array_2.cpp
Remove_Duplicates_from_Sorted_List.cpp		Remove_Duplicates_from_Sorted_List.cpp
Remove_Duplicates_from_Sorted_List_2.cpp		Remove_Duplicates_from_Sorted_List_2.cpp
Remove_Element.cpp		Remove_Element.cpp
Remove_Nth_Node_From_End_of_List.cpp		Remove_Nth_Node_From_End_of_List.cpp
Reorder_List.cpp		Reorder_List.cpp
Reverse_Integer.cpp		Reverse_Integer.cpp
Reverse_Linked_List_2.cpp		Reverse_Linked_List_2.cpp
Reverse_Nodes_in_k-Group.cpp		Reverse_Nodes_in_k-Group.cpp
Reverse_Words_in_a_String.cpp		Reverse_Words_in_a_String.cpp
Roman_to_Integer.cpp		Roman_to_Integer.cpp
Rotate_Image.cpp		Rotate_Image.cpp
Same_Tree.cpp		Same_Tree.cpp
Search_Insert_Position.cpp		Search_Insert_Position.cpp
Search_a_2D_Matrix.cpp		Search_a_2D_Matrix.cpp
Search_for_a_Range.cpp		Search_for_a_Range.cpp
Search_in_Rotated_Sorted_Array.cpp		Search_in_Rotated_Sorted_Array.cpp
Search_in_Rotated_Sorted_Array_2.cpp		Search_in_Rotated_Sorted_Array_2.cpp
Set_Matrix_Zeroes.cpp		Set_Matrix_Zeroes.cpp
Simplify_Path.cpp		Simplify_Path.cpp
Single_Number.cpp		Single_Number.cpp
Single_Number_2.cpp		Single_Number_2.cpp
Sort_Colors.cpp		Sort_Colors.cpp
Spiral_Matrix.cpp		Spiral_Matrix.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Languages

andy2git/Leetcode

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages