GitHub - willnjohnson/leetcode: Leetcode problems for practice

Doing leetcode challenges every day to help prep for coding interviews.

Name		Name	Last commit message	Last commit date
100_Same_Tree		100_Same_Tree
101_Symmetric_Tree		101_Symmetric_Tree
104_Maximum_Depth_of_Binary_Tree		104_Maximum_Depth_of_Binary_Tree
105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal		105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal		106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
112_Path_Sum		112_Path_Sum
114_Flatten_Binary_Tree_to_Linked_List		114_Flatten_Binary_Tree_to_Linked_List
117_Populating_Next_Right_Pointers_in_Each_Node_II		117_Populating_Next_Right_Pointers_in_Each_Node_II
11_Container_With_Most_Water		11_Container_With_Most_Water
121_Best_Time_to_Buy_and_Sell_Stock		121_Best_Time_to_Buy_and_Sell_Stock
122_Best_Time_to_Buy_and_Sell_Stock_II		122_Best_Time_to_Buy_and_Sell_Stock_II
124_Binary_Tree_Maximum_Path_Sum		124_Binary_Tree_Maximum_Path_Sum
125_Valid_Palindrome		125_Valid_Palindrome
128_Longest_Consecutive_Sequence		128_Longest_Consecutive_Sequence
129_Sum_Root_to_Leaf_Numbers		129_Sum_Root_to_Leaf_Numbers
12_Integer_to_Roman		12_Integer_to_Roman
134_Gas_Station		134_Gas_Station
135_Candy		135_Candy
138_Copy_List_with_Random_Pointer		138_Copy_List_with_Random_Pointer
13_Roman_to_Integer		13_Roman_to_Integer
141_Linked_List_Cycle		141_Linked_List_Cycle
146_LRU_Cache		146_LRU_Cache
14_Longest_Common_Prefix		14_Longest_Common_Prefix
150_Evaluate_Reverse_Polish_Notation		150_Evaluate_Reverse_Polish_Notation
151_Reverse_Words_in_a_String		151_Reverse_Words_in_a_String
155_Min_Stack		155_Min_Stack
15_3Sum		15_3Sum
167_Two_Sum_II_Input_Array_Is_Sorted		167_Two_Sum_II_Input_Array_Is_Sorted
169_Majority_Element		169_Majority_Element
173_Binary_Search_Tree_Iterator		173_Binary_Search_Tree_Iterator
189_Rotate_Array		189_Rotate_Array
199_Binary_Tree_Right_Side_View		199_Binary_Tree_Right_Side_View
19_Remove_Nth_Node_From_End_of_List		19_Remove_Nth_Node_From_End_of_List
1_Two_Sum		1_Two_Sum
202_Happy_Number		202_Happy_Number
205_Isomorphic_Strings		205_Isomorphic_Strings
209_Minimum_Size_Subarray_Sum		209_Minimum_Size_Subarray_Sum
20_Valid_Parentheses		20_Valid_Parentheses
219_Contains_Duplicate_II		219_Contains_Duplicate_II
21_Merge_Two_Sorted_Lists		21_Merge_Two_Sorted_Lists
222_Count_Complete_Tree_Nodes		222_Count_Complete_Tree_Nodes
224_Basic_Calculator		224_Basic_Calculator
226_Invert_Binary_Tree		226_Invert_Binary_Tree
228_Summary_Ranges		228_Summary_Ranges
236_Lowest_Common_Ancestor_of_a_Binary_Tree		236_Lowest_Common_Ancestor_of_a_Binary_Tree
237_Delete_Node_in_a_Linked_List		237_Delete_Node_in_a_Linked_List
238_Product_of_Array_Except_Self		238_Product_of_Array_Except_Self
239_Sliding_Window_Maximum		239_Sliding_Window_Maximum
240_Search_a_2D_Matrix_II		240_Search_a_2D_Matrix_II
241_Different_Ways_to_Add_Parentheses		241_Different_Ways_to_Add_Parentheses
242_Valid_Anagram		242_Valid_Anagram
25_Reverse_Nodes_in_k-Group		25_Reverse_Nodes_in_k-Group
274_H_Index		274_H_Index
27_Remove_Element		27_Remove_Element
289_Game_of_Life		289_Game_of_Life
28_Find_the_Index_of_the_First_Occurence_in_a_String		28_Find_the_Index_of_the_First_Occurence_in_a_String
290_Word_Pattern		290_Word_Pattern
29_Remove_Duplicates_from_Sorted_Array		29_Remove_Duplicates_from_Sorted_Array
2_Add_Two_Numbers		2_Add_Two_Numbers
30_Substring_with_Concatenation_of_All_Words		30_Substring_with_Concatenation_of_All_Words
36_Valid_Sudoku		36_Valid_Sudoku
380_Insert_Delete_GetRandom_O(1)		380_Insert_Delete_GetRandom_O(1)
383_Ransom_Note		383_Ransom_Note
392_Is_Subsequence		392_Is_Subsequence
3_Longest_Substring_Without_Repeating_Characters		3_Longest_Substring_Without_Repeating_Characters
42_Trapping_Rain_Water		42_Trapping_Rain_Water
452_Minimum_Number_of_Arrows_to_Burst_Balloons		452_Minimum_Number_of_Arrows_to_Burst_Balloons
45_Jump_Game_II		45_Jump_Game_II
48_Rotate_Image		48_Rotate_Image
49_Group_Anagrams		49_Group_Anagrams
50_Pow(x_n)		50_Pow(x_n)
51_N_Queens		51_N_Queens
52_N_Queens_II		52_N_Queens_II
53_Maximum_Subarray		53_Maximum_Subarray
54_Spiral_Matrix		54_Spiral_Matrix
55_Jump_Game		55_Jump_Game
56_Merge_Intervals		56_Merge_Intervals
57_Insert_Interval		57_Insert_Interval
58_Length_of_Last_Word		58_Length_of_Last_Word
59_Spiral_Matrix_II		59_Spiral_Matrix_II
60_Permutation_Sequence		60_Permutation_Sequence
61_Rotate_List		61_Rotate_List
62_Unique_Paths		62_Unique_Paths
68_Text_Justification		68_Text_Justification
6_Zigzag_Conversion		6_Zigzag_Conversion
71_Simplify_Path		71_Simplify_Path
73_Set_Matrix_Zeroes		73_Set_Matrix_Zeroes
76_Minimum_Window_Substring		76_Minimum_Window_Substring
80_Remove_Duplicates_from_Sorted_Array_II		80_Remove_Duplicates_from_Sorted_Array_II
82_Remove_Duplicates_from_Sorted_List_II		82_Remove_Duplicates_from_Sorted_List_II
86_Partition_List		86_Partition_List
88_Merge_Sorted_Array		88_Merge_Sorted_Array
92_Reverse_Linked_List_II		92_Reverse_Linked_List_II
README.md		README.md

Navigation Menu

Repository files navigation

About

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

About

Resources

Stars

Watchers

Forks

Contributors

Languages