Leetcode in JavaScript & TypeScript

A collection of popular LeetCode problems that I've solved. My LeetCode profile.

Problems / lists

Top 75 LeetCode Problems

Name		Name	Last commit message	Last commit date
Latest commit History 343 Commits
0_jest_test		0_jest_test
1008_Construct_Binary_Search_Tree_from_traversal		1008_Construct_Binary_Search_Tree_from_traversal
100_Same_Tree		100_Same_Tree
1011_Capacity_to_ship_packages_within_D_days		1011_Capacity_to_ship_packages_within_D_days
101_Symmetric_tree		101_Symmetric_tree
102_Binary_Tree_Level_Order_Traversal		102_Binary_Tree_Level_Order_Traversal
103_Binary_Tree_ZigZag_Level_Order_Traversal		103_Binary_Tree_ZigZag_Level_Order_Traversal
1047_remove_all_adjacent_duplicates_in_string		1047_remove_all_adjacent_duplicates_in_string
104_Maximum_Depth_Binary_Tree		104_Maximum_Depth_Binary_Tree
105_Construct_Binary_Tree_from_Preorder_Inorder_traversal		105_Construct_Binary_Tree_from_Preorder_Inorder_traversal
106_Construct_Binary_Tree_From_Inorder_Postorder		106_Construct_Binary_Tree_From_Inorder_Postorder
107_Binary_Tree_Level_Order_Traversal_2		107_Binary_Tree_Level_Order_Traversal_2
108_Convert_Sorted_Array_to_Binary_Search_Tree		108_Convert_Sorted_Array_to_Binary_Search_Tree
110_Balanced_Binary_Tree		110_Balanced_Binary_Tree
111_Minimum_Depth_of_Binary_Tree		111_Minimum_Depth_of_Binary_Tree
112_Path_Sum		112_Path_Sum
113_Path_Sum_2		113_Path_Sum_2
1143_Longest_Common_Subsequence		1143_Longest_Common_Subsequence
114_Flatten_Binary_Tree_to_Linked_List		114_Flatten_Binary_Tree_to_Linked_List
116_Populate_Next_Right_Pointers		116_Populate_Next_Right_Pointers
117_Populating_Next_Right_Pointers_2		117_Populating_Next_Right_Pointers_2
1190_Reverse_SubStr_Between_Parens		1190_Reverse_SubStr_Between_Parens
119_Pascals_Triangle		119_Pascals_Triangle
11_Container_With_Most_Water		11_Container_With_Most_Water
121_Best_Time_To_Buy_Sell_Stock		121_Best_Time_To_Buy_Sell_Stock
1239_Maximum_Length_of_a_Concat_Str_with_Unique_Chars		1239_Maximum_Length_of_a_Concat_Str_with_Unique_Chars
123_Best_Time_to_Buy_and_Sell_Stock_3		123_Best_Time_to_Buy_and_Sell_Stock_3
1249_Minimum_Remove_to_Make_Valid_Parentheses		1249_Minimum_Remove_to_Make_Valid_Parentheses
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
130_Surrounded_Regions		130_Surrounded_Regions
133_Clone_Graph		133_Clone_Graph
136_Single_Number		136_Single_Number
139_Word_Break		139_Word_Break
1400_Construct_K_Palindrome_Strings		1400_Construct_K_Palindrome_Strings
1413_Minimum_Value_to_Get_Positive_Step_by_Step_Sum		1413_Minimum_Value_to_Get_Positive_Step_by_Step_Sum
1419_Minimum_Number_of_Frogs_Croaking		1419_Minimum_Number_of_Frogs_Croaking
141_Linked_List_Cycle		141_Linked_List_Cycle
1423_Maximum_Points_You_Can_Obtain_from_Cards		1423_Maximum_Points_You_Can_Obtain_from_Cards
1428_Leftmost_Column_with_a_Least_a_One		1428_Leftmost_Column_with_a_Least_a_One
143_reorder_list		143_reorder_list
144_binary_tree_preorder_traversal		144_binary_tree_preorder_traversal
145_Binary_Tree_Postorder_Traversal		145_Binary_Tree_Postorder_Traversal
1460_Make_Two_Arrays_Equal_by_Reversing_Sub_Arrays		1460_Make_Two_Arrays_Equal_by_Reversing_Sub_Arrays
146_LRU_Cache		146_LRU_Cache
148_Sort_List		148_Sort_List
14_longest_common_prefix		14_longest_common_prefix
150_Evalutate_Reverse_Polish_Notation		150_Evalutate_Reverse_Polish_Notation
151_Reverse_Words_in_String		151_Reverse_Words_in_String
152_Maximum_Product_Subarray		152_Maximum_Product_Subarray
1539_Kth_Missing_Number		1539_Kth_Missing_Number
154_Find_Minimum_in_Rotated_Sorted_Array_II		154_Find_Minimum_in_Rotated_Sorted_Array_II
155_Min_Stack		155_Min_Stack
1570_Dot_Product_of_Two_Sparse_Vectors		1570_Dot_Product_of_Two_Sparse_Vectors
15_3Sum		15_3Sum
162_Find_Peak_Element		162_Find_Peak_Element
1691_Maximum_Height_Cuboids		1691_Maximum_Height_Cuboids
17_Letter_Combinations_of_a_Number		17_Letter_Combinations_of_a_Number
190_Reverse_Bits		190_Reverse_Bits
191_number_of_1_bits		191_number_of_1_bits
1971_Find_If_Paths_Exist_In_Graph		1971_Find_If_Paths_Exist_In_Graph
198_House_Robber		198_House_Robber
199_Binary_Tree_Right_Side_View		199_Binary_Tree_Right_Side_View
19_Remove_Nth_Node_From_List		19_Remove_Nth_Node_From_List
1_two_sum		1_two_sum
200_Number_of_Islands		200_Number_of_Islands
201_Bitwise_AND_of_range		201_Bitwise_AND_of_range
202_Happy_Number		202_Happy_Number
203_Remove_Linked_List_Elements		203_Remove_Linked_List_Elements
204_Count_Primes		204_Count_Primes
206_reverse_linked_list		206_reverse_linked_list
207_Course_Schedule		207_Course_Schedule
208_Implement_Trie		208_Implement_Trie
20_valid_parentheses		20_valid_parentheses
210_Course_Schedule_2		210_Course_Schedule_2
211_Design_Add_Search_Words_Data_Structure		211_Design_Add_Search_Words_Data_Structure
212_Word_Search_II		212_Word_Search_II
213_House_Robber_2		213_House_Robber_2
215_Kth_Largest_Element_in_Array		215_Kth_Largest_Element_in_Array
216_Combination_Sum_3		216_Combination_Sum_3
217_Contains_Duplicate		217_Contains_Duplicate
21_merge_two_sorted_lists		21_merge_two_sorted_lists
220_Contains_Duplicate_III		220_Contains_Duplicate_III
221_Maximal_Square		221_Maximal_Square
225_Implement_Stack_Using_Queues		225_Implement_Stack_Using_Queues
226_Invert_Binary_Tree		226_Invert_Binary_Tree
227_Basic_Calculator_2		227_Basic_Calculator_2
22_Generate_Parentheses		22_Generate_Parentheses
230_Kth_Smallest_Element_in_a_BST		230_Kth_Smallest_Element_in_a_BST
232_Implement_Queue_Using_Stacks		232_Implement_Queue_Using_Stacks
234_Palindrome_Linked_List		234_Palindrome_Linked_List
235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree		235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree
236_Lowest_Common_Ancestor_of_a_Binary_Tree		236_Lowest_Common_Ancestor_of_a_Binary_Tree
238_product_of_array_except_self		238_product_of_array_except_self
239_Sliding_Window_Maximum		239_Sliding_Window_Maximum
23_Merge_K_Sorted_Lists		23_Merge_K_Sorted_Lists
240_Search_2D_Matrix		240_Search_2D_Matrix
242_Valid_Anagrams		242_Valid_Anagrams

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode in JavaScript & TypeScript

Problems / lists

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

Leetcode in JavaScript & TypeScript

Problems / lists

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages