Name	Name	Last commit message	Last commit date
Latest commit History 124 Commits
102. Binary Tree Level Order Traversal	102. Binary Tree Level Order Traversal
104. Maximum Depth of Binary Tree	104. Maximum Depth of Binary Tree
1051. Height Checker	1051. Height Checker
108. Convert Sorted Array to Binary Search Tree	108. Convert Sorted Array to Binary Search Tree
1094-Car Pooling.java	1094-Car Pooling.java
110. Balanced Binary Tree	110. Balanced Binary Tree
1101-The Earliest Moment When Everyone Become Friends.java	1101-The Earliest Moment When Everyone Become Friends.java
112. Path Sum	112. Path Sum
1137. N-th Tribonacci Number	1137. N-th Tribonacci Number
1197. Minimum Knight Moves	1197. Minimum Knight Moves
121-Best Time to Buy and Sell Stock.java	121-Best Time to Buy and Sell Stock.java
1218. Longest Arithmetic Subsequence of Given Difference	1218. Longest Arithmetic Subsequence of Given Difference
1231. Divide Chocolate	1231. Divide Chocolate
1235. Maximum Profit in Job Scheduling	1235. Maximum Profit in Job Scheduling
1257. Smallest Common Region	1257. Smallest Common Region
1265. Print Immutable Linked List in Reverse	1265. Print Immutable Linked List in Reverse
1277. Count Square Submatrices with All Ones	1277. Count Square Submatrices with All Ones
129. Sum Root to Leaf Numbers	129. Sum Root to Leaf Numbers
1304. Find N Unique Integers Sum up to Zero	1304. Find N Unique Integers Sum up to Zero
144. Binary Tree Preorder Traversal	144. Binary Tree Preorder Traversal
145. Binary Tree Postorder Traversal	145. Binary Tree Postorder Traversal
1525. Number of Good Ways to Split a String	1525. Number of Good Ways to Split a String
1578. Minimum Deletion Cost to Avoid Repeating Letters	1578. Minimum Deletion Cost to Avoid Repeating Letters
1584. Min Cost to Connect All Points	1584. Min Cost to Connect All Points
173. Binary Search Tree Iterator	173. Binary Search Tree Iterator
1823. Find the Winner of the Circular Game	1823. Find the Winner of the Circular Game
198. House Robber	198. House Robber
2. Add Two Numbers	2. Add Two Numbers
20. Valid Parentheses	20. Valid Parentheses
206. Reverse Linked List	206. Reverse Linked List
21. Merge Two Sorted Lists	21. Merge Two Sorted Lists
212. Word Search II	212. Word Search II
213. House Robber II	213. House Robber II
22. Generate Parentheses	22. Generate Parentheses
220. Contains Duplicate III	220. Contains Duplicate III
224. Basic Calculator	224. Basic Calculator
231. Power of Two	231. Power of Two
235. Lowest Common Ancestor of a Binary Search Tree	235. Lowest Common Ancestor of a Binary Search Tree
237. Delete Node in a Linked List	237. Delete Node in a Linked List
251. Flatten 2D Vector	251. Flatten 2D Vector
26. Remove Duplicates from Sorted Array	26. Remove Duplicates from Sorted Array
260. Single Number III	260. Single Number III
27. Remove Element	27. Remove Element
326. Power of Three	326. Power of Three
336. Palindrome Pairs	336. Palindrome Pairs
342. Power of Four	342. Power of Four
344. Reverse String	344. Reverse String
346. Moving Average from Data Stream	346. Moving Average from Data Stream
383. Ransom Note	383. Ransom Note
387. First Unique Character in a String	387. First Unique Character in a String
394. Decode String	394. Decode String
404. Sum of Left Leaves	404. Sum of Left Leaves
412. Fizz Buzz	412. Fizz Buzz
414. Third Maximum Number	414. Third Maximum Number
419. Battleships in a Board	419. Battleships in a Board
429. N-ary Tree Level Order Traversal	429. N-ary Tree Level Order Traversal
438-Find All Anagrams in a String.java	438-Find All Anagrams in a String.java
44. Wildcard Matching	44. Wildcard Matching
441. Arranging Coins	441. Arranging Coins
448. Find All Numbers Disappeared in an Array	448. Find All Numbers Disappeared in an Array
450. Delete Node in a BST	450. Delete Node in a BST
487. Max Consecutive Ones II	487. Max Consecutive Ones II
50. Pow(x, n)	50. Pow(x, n)
509. Fibonacci Number	509. Fibonacci Number
55. Jump Game	55. Jump Game
559. Maximum Depth of N-ary Tree	559. Maximum Depth of N-ary Tree
589. N-ary Tree Preorder Traversal	589. N-ary Tree Preorder Traversal
590. N-ary Tree Postorder Traversal	590. N-ary Tree Postorder Traversal
694. Number of Distinct Islands	694. Number of Distinct Islands
700. Search in a Binary Search Tree	700. Search in a Binary Search Tree
703. Kth Largest Element in a Stream	703. Kth Largest Element in a Stream
704. Binary Search	704. Binary Search
746. Min Cost Climbing Stairs	746. Min Cost Climbing Stairs
875. Koko Eating Bananas	875. Koko Eating Bananas
94. Binary Tree Inorder Traversal	94. Binary Tree Inorder Traversal
98. Validate Binary Search Tree	98. Validate Binary Search Tree
Alien Dictionary	Alien Dictionary
Convert Sorted Array to Binary Search Tree	Convert Sorted Array to Binary Search Tree
Count Univalue Subtrees	Count Univalue Subtrees
Course Schedule	Course Schedule
Design Linked List	Design Linked List
Duplicate Zeros	Duplicate Zeros
Encode N-ary Tree to Binary Tree	Encode N-ary Tree to Binary Tree
Find First and Last Position of Element in Sorted Array	Find First and Last Position of Element in Sorted Array
Find Pivot Index	Find Pivot Index
First Bad Version	First Bad Version
Graph Valid Tree	Graph Valid Tree
Guess Number Higher or Lower	Guess Number Higher or Lower
Happy Number	Happy Number
HomeWork	HomeWork
Implement Trie (Prefix Tree)	Implement Trie (Prefix Tree)
Inorder Successor in BST	Inorder Successor in BST
Insert into a Binary Search Tree	Insert into a Binary Search Tree
Intersection of Two Arrays	Intersection of Two Arrays
Isomorphic Strings	Isomorphic Strings
Largest Number At Least Twice of Others	Largest Number At Least Twice of Others
Map Sum Pairs	Map Sum Pairs
Max Consecutive Ones III	Max Consecutive Ones III
Number of Connected Components in an Undirected Graph	Number of Connected Components in an Undirected Graph
Number of Provinces	Number of Provinces

Name

Last commit message

Last commit date

124 Commits

102. Binary Tree Level Order Traversal

104. Maximum Depth of Binary Tree

1051. Height Checker

108. Convert Sorted Array to Binary Search Tree

1094-Car Pooling.java

110. Balanced Binary Tree

1101-The Earliest Moment When Everyone Become Friends.java

112. Path Sum