GitHub - BruceWeng/Leetcode-JavaScript: Practicing CS Fundamentals with Leetcode in JavaScript

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 455 Commits
Hackerrank		Hackerrank
Interview Question Example		Interview Question Example
Interviewing		Interviewing
JS read file example		JS read file example
Pramp		Pramp
1. Two Sum.js		1. Two Sum.js
10. Regular Expression Matching.js		10. Regular Expression Matching.js
1008. Construct Binary Search Tree from Preorder Traversal.js		1008. Construct Binary Search Tree from Preorder Traversal.js
101. Symmetric Tree.js		101. Symmetric Tree.js
102. Binary Tree Level Order Traversal.js		102. Binary Tree Level Order Traversal.js
1021. Remove Outermost Parentheses.js		1021. Remove Outermost Parentheses.js
1022. Sum of Root To Leaf Binary Numbers.js		1022. Sum of Root To Leaf Binary Numbers.js
1026. Maximum Difference Between Node and Ancestor.js		1026. Maximum Difference Between Node and Ancestor.js
104. Maximum Depth of Binary Tree.js		104. Maximum Depth of Binary Tree.js
107. Binary Tree Level Order Traversal II.js		107. Binary Tree Level Order Traversal II.js
110. Balanced Binary Tree.js		110. Balanced Binary Tree.js
1108. Defanging an IP Address.js		1108. Defanging an IP Address.js
111. Minimum Depth of Binary Tree.js		111. Minimum Depth of Binary Tree.js
112. Path Sum.js		112. Path Sum.js
118. Pascal's Triangle.js		118. Pascal's Triangle.js
120. Triangle.js		120. Triangle.js
121. Best Time to Buy and Sell Stock .js		121. Best Time to Buy and Sell Stock .js
121. Best Time to Buy and Sell Stock.js		121. Best Time to Buy and Sell Stock.js
122. Best Time to Buy and Sell Stock II.js		122. Best Time to Buy and Sell Stock II.js
1220. Count Vowels Permutation.js		1220. Count Vowels Permutation.js
1221. Split a String in Balanced Strings.js		1221. Split a String in Balanced Strings.js
123. Best Time to Buy and Sell Stock III.js		123. Best Time to Buy and Sell Stock III.js
126. Word Ladder II.js		126. Word Ladder II.js
127. Word Ladder.js		127. Word Ladder.js
130. Surrounded Regions.js		130. Surrounded Regions.js
131. Palindrome Partitioning.js		131. Palindrome Partitioning.js
132. Palindrome Partitioning II.js		132. Palindrome Partitioning II.js
133. Clone Graph.js		133. Clone Graph.js
136. Single Number.js		136. Single Number.js
137. Single Number II.js		137. Single Number II.js
139. Word Break.js		139. Word Break.js
140. Word Break II.js		140. Word Break II.js
141. Linked List Cycle.js		141. Linked List Cycle.js
143. Reorder List.js		143. Reorder List.js
144. Binary Tree Preorder Transversal.js		144. Binary Tree Preorder Transversal.js
146. LRUCache.js		146. LRUCache.js
147. Insertion Sort List.js		147. Insertion Sort List.js
148. Sort List.js		148. Sort List.js
149. Max Points on a Line.js		149. Max Points on a Line.js
15. 3 Sum.js		15. 3 Sum.js
150. Evaluate Reverse Polish Notation.js		150. Evaluate Reverse Polish Notation.js
152. Maximum Product Subarray.js		152. Maximum Product Subarray.js
153. Minimum in Rotated Sorted Array.js		153. Minimum in Rotated Sorted Array.js
154. Minimum in Rotated Sorted Array II.js		154. Minimum in Rotated Sorted Array II.js
155. Min Stack.js		155. Min Stack.js
159. Longest Substring with At Most Two Distinct Characters.js		159. Longest Substring with At Most Two Distinct Characters.js
160. Intersection of Two Linked Lists.js		160. Intersection of Two Linked Lists.js
162. Find Peak Element.js		162. Find Peak Element.js
1636. Sort Array by Increasing Frequency .js		1636. Sort Array by Increasing Frequency .js
166. Fraction to Recurring Decimal.js		166. Fraction to Recurring Decimal.js
167. Two Sum II - Input array is sorted.js		167. Two Sum II - Input array is sorted.js
17. Letter Combinations of a Phone Number.js		17. Letter Combinations of a Phone Number.js
170. Two Sum III - Data structure design.js		170. Two Sum III - Data structure design.js
172. Factorial Trailing Zeroes.js		172. Factorial Trailing Zeroes.js
174. Dungeon Game.js		174. Dungeon Game.js
179. Largest Number.js		179. Largest Number.js
188. Best Time to Buy and Sell Stock IV.js		188. Best Time to Buy and Sell Stock IV.js
189. Rotate Array.js		189. Rotate Array.js
19. Remove Nth Node From End of List.js		19. Remove Nth Node From End of List.js
190. Reverse Bits.js		190. Reverse Bits.js
198. House Robber.js		198. House Robber.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
202. Happy Number.js		202. Happy Number.js
203. Remove Linked List Elements.js		203. Remove Linked List Elements.js
205. Isomorphic Strings.js		205. Isomorphic Strings.js
206 Reverse Linked List.js		206 Reverse Linked List.js
206. Reverse Linked List.js		206. Reverse Linked List.js
207. Course Schedule(BFS).js		207. Course Schedule(BFS).js
207. Course Schedule(DFS).js		207. Course Schedule(DFS).js
208. Implement Trie (Prefix Tree).js		208. Implement Trie (Prefix Tree).js
209. Minimum Size Subarray Sum.js		209. Minimum Size Subarray Sum.js
21. Merge Two Sorted Lists.js		21. Merge Two Sorted Lists.js
210. Course Schedule II(BFS).js		210. Course Schedule II(BFS).js
210. Course Schedule II(DFS).js		210. Course Schedule II(DFS).js
211. Add and Search Word - Data structure design.js		211. Add and Search Word - Data structure design.js
212. Word Search II(DFS).js		212. Word Search II(DFS).js
213. House Robber II.js		213. House Robber II.js
215. Kth Largest Element in an Array.js		215. Kth Largest Element in an Array.js
216. Combination Sum III.js		216. Combination Sum III.js
217. Contains Duplicate.js		217. Contains Duplicate.js
218. The Skyline Problem.js		218. The Skyline Problem.js
219. COntains Duplicate II.js		219. COntains Duplicate II.js
221. Maximal Square.js		221. Maximal Square.js
226. Invert Binary Tree.js		226. Invert Binary Tree.js
23. Merge k Sorted Lists.js		23. Merge k Sorted Lists.js
231. Power of Two.js		231. Power of Two.js
232. Implement Queue using Stacks.js		232. Implement Queue using Stacks.js
234. Palindrome Linked List.js		234. Palindrome Linked List.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
237. Delete Node in a Linked List.js		237. Delete Node in a Linked List.js
24. Swap Nodes in Pairs.js		24. Swap Nodes in Pairs.js
240. Search a 2D Matrix II .js		240. Search a 2D Matrix II .js