GitHub - genov/leetcode: My LeetCode Problems solutions in JS. · GitHub

Repository navigation

leetcode

Public

About

My LeetCode Problems solutions in JS.

1 star

1 watching

Report repository

Name		Name	Last commit message	Last commit date
.vscode		.vscode
.gitignore		.gitignore
1. Two Sum.js		1. Two Sum.js
10. Regular Expression Matching.js		10. Regular Expression Matching.js
100. Same Tree.js		100. Same Tree.js
101.Symmetric Tree.js		101.Symmetric Tree.js
102.Binary Tree Level Order Traversal.js		102.Binary Tree Level Order Traversal.js
104.Maximum Depth of Binary Tree.js		104.Maximum Depth of Binary Tree.js
1041. Robot Bounded In Circle.js		1041. Robot Bounded In Circle.js
1047. Remove All Adjacent Duplicates In String.js		1047. Remove All Adjacent Duplicates In String.js
105. Construct Binary Tree from Preorder and Inorder Traversal.js		105. Construct Binary Tree from Preorder and Inorder Traversal.js
1051. Height Checker.js		1051. Height Checker.js
106. Construct Binary Tree from Inorder and Postorder Traversal.js		106. Construct Binary Tree from Inorder and Postorder Traversal.js
1060. Missing Element in Sorted Array.js		1060. Missing Element in Sorted Array.js
108. Convert Sorted Array to Binary Search Tree.js		108. Convert Sorted Array to Binary Search Tree.js
1081. Smallest Subsequence of Distinct Characters.js		1081. Smallest Subsequence of Distinct Characters.js
1089. Duplicate Zeros.js		1089. Duplicate Zeros.js
112.path-sum.js		112.path-sum.js
1123. Lowest Common Ancestor of Deepest Leaves.js		1123. Lowest Common Ancestor of Deepest Leaves.js
116. Populating Next Right Pointers in Each Node.js		116. Populating Next Right Pointers in Each Node.js
117. Populating Next Right Pointers in Each Node II.js		117. Populating Next Right Pointers in Each Node II.js
1189. Maximum Number of Balloons.js		1189. Maximum Number of Balloons.js
12. Integer to Roman.js		12. Integer to Roman.js
121. Best Time to Buy and Sell Stock.js		121. Best Time to Buy and Sell Stock.js
1239. Maximum Length of a Concatenated String with Unique Characters.js		1239. Maximum Length of a Concatenated String with Unique Characters.js
124. Word Laddder.js		124. Word Laddder.js
125. Valid Palindrome.js		125. Valid Palindrome.js
128. Longest Consecutive Sequence.js		128. Longest Consecutive Sequence.js
1299. Replace Elements with Greatest Element on Right Side.js		1299. Replace Elements with Greatest Element on Right Side.js
13. Roman to Integer.js		13. Roman to Integer.js
132.132-sequence.js		132.132-sequence.js
133. Clone Graph.js		133. Clone Graph.js
1346. Check If N and Its Double Exist.js		1346. Check If N and Its Double Exist.js
1365. How Many Numbers Are Smaller Than the Current Number.js		1365. How Many Numbers Are Smaller Than the Current Number.js
139. Word Break.js		139. Word Break.js
14. Longest Common Prefix.js		14. Longest Common Prefix.js
1423. Maximum Points You Can Obtain from Cards.js		1423. Maximum Points You Can Obtain from Cards.js
146. LRU Cache.js		146. LRU Cache.js
1499. Max Value of Equation.js		1499. Max Value of Equation.js
15. 3Sum.js		15. 3Sum.js
150. Evaluate Reverse Polish Notation.js		150. Evaluate Reverse Polish Notation.js
151. Reverse Words in a String.js		151. Reverse Words in a String.js
1522. Diameter of N-Ary Tree.js		1522. Diameter of N-Ary Tree.js
1539. Kth Missing Positive Number.js		1539. Kth Missing Positive Number.js
155. Min Stack.js		155. Min Stack.js
1576. Replace All ?'s to Avoid Consecutive Repeating Characters.js		1576. Replace All ?'s to Avoid Consecutive Repeating Characters.js
1578. Minimum Deletion Cost to Avoid Repeating Letters.js		1578. Minimum Deletion Cost to Avoid Repeating Letters.js
159. Longest Substring with At Most Two Distinct Characters.js		159. Longest Substring with At Most Two Distinct Characters.js
16. 3Sum Closest.js		16. 3Sum Closest.js
1644. Lowest Common Ancestor of a Binary Tree II.js		1644. Lowest Common Ancestor of a Binary Tree II.js
1650. Lowest Common Ancestor of a Binary Tree III.js		1650. Lowest Common Ancestor of a Binary Tree III.js
167. Two Sum II - Input Array Is Sorted.js		167. Two Sum II - Input Array Is Sorted.js
1676. Lowest Common Ancestor of a Binary Tree IV.js		1676. Lowest Common Ancestor of a Binary Tree IV.js
1685. Sum of Absolute Differences in a Sorted Array.js		1685. Sum of Absolute Differences in a Sorted Array.js
1776. Car Fleet II.js		1776. Car Fleet II.js
1804. Implement Trie II (Prefix Tree).js		1804. Implement Trie II (Prefix Tree).js
199. Binary Tree Right Side View.js		199. Binary Tree Right Side View.js
2. Add Two Numbers.js		2. Add Two Numbers.js
20.valid-parentheses.js		20.valid-parentheses.js
200. Number of Islands.js		200. Number of Islands.js
206. Reverse Linked List.js		206. Reverse Linked List.js
208. Implement Trie (Prefix Tree).js		208. Implement Trie (Prefix Tree).js
21.merge-two-sorted-lists.js		21.merge-two-sorted-lists.js
211. Design Add and Search Words Data Structure.js		211. Design Add and Search Words Data Structure.js
215. Kth Largest Element in an Array.js		215. Kth Largest Element in an Array.js
217.contains-duplicate.js		217.contains-duplicate.js
227. Basic Calculator II.js		227. Basic Calculator II.js
23. Merge k Sorted Lists.js		23. Merge k Sorted Lists.js
230. Kth Smallest Element in a BST.js		230. Kth Smallest Element in a BST.js
235. Lowest Common Ancestor of a Binary Search Tree.js		235. Lowest Common Ancestor of a Binary Search Tree.js
236. Lowest Common Ancestor of a Binary Tree.js		236. Lowest Common Ancestor of a Binary Tree.js
238. Product of Array Except Self.js		238. Product of Array Except Self.js
242. Valid Anagram.js		242. Valid Anagram.js
25.reverse-nodes-in-Kth-group.js		25.reverse-nodes-in-Kth-group.js
250. Count Univalue Subtrees.js		250. Count Univalue Subtrees.js
252. Meeting Rooms.js		252. Meeting Rooms.js
256. Paint House.js		256. Paint House.js
259. 3Sum Smaller.js		259. 3Sum Smaller.js
26. Remove Duplicates from Sorted Array.js		26. Remove Duplicates from Sorted Array.js
265. Paint House II.js		265. Paint House II.js
266. Palindrome Permutation.js		266. Palindrome Permutation.js
268. Missing Number.js		268. Missing Number.js
273. Integer to English Words.js		273. Integer to English Words.js
276. Paint Fence.js		276. Paint Fence.js
278. First Bad Version.js		278. First Bad Version.js
279. Perfect Squares.js		279. Perfect Squares.js
285. Inorder Successor in BST.js		285. Inorder Successor in BST.js
286. Walls and Gates.js		286. Walls and Gates.js
295. Find Median from Data Stream.js		295. Find Median from Data Stream.js
297. Serialize and Deserialize Binary Tree.js		297. Serialize and Deserialize Binary Tree.js
3. Longest Substring Without Repeating Characters.js		3. Longest Substring Without Repeating Characters.js
302 Smallest Rectangle Enclosing Black Pixels.js		302 Smallest Rectangle Enclosing Black Pixels.js
304. Range Sum Query 2D - Immutable.js		304. Range Sum Query 2D - Immutable.js
312. Burst Balloons.js		312. Burst Balloons.js
315. Count of Smaller Numbers After Self.js		315. Count of Smaller Numbers After Self.js
316. Remove Duplicate Letters.js		316. Remove Duplicate Letters.js
32. Longest Valid Parentheses.js		32. Longest Valid Parentheses.js
329. Longest Increasing Path in a Matrix.js		329. Longest Increasing Path in a Matrix.js
33.search-in-rotated-array.js		33.search-in-rotated-array.js
34. Find First and Last Position of Element in Sorted Array.js		34. Find First and Last Position of Element in Sorted Array.js

Repository files navigation

LeetCode problems in JS.

About

My LeetCode Problems solutions in JS.

1 star

1 watching

Report repository

Releases

Packages

Contributors

Languages