Name	Name	Last commit message	Last commit date
Latest commit History 29 Commits
0001.TwoSum	0001.TwoSum
0094.BinaryTreeInorderTraversal	0094.BinaryTreeInorderTraversal
0100.SameTree	0100.SameTree
0111.MinimumDepthOfBinaryTree	0111.MinimumDepthOfBinaryTree
0112.PathSum	0112.PathSum
101.SymmetricTree	101.SymmetricTree
102. Binary Tree Level Order Traversal	102. Binary Tree Level Order Traversal
1022. Sum of Root To Leaf Binary Numbers	1022. Sum of Root To Leaf Binary Numbers
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
1051. Height Checker	1051. Height Checker
106. Construct Binary Tree from Inorder and Postorder Traversal	106. Construct Binary Tree from Inorder and Postorder Traversal
107. Binary Tree Level Order Traversal II	107. Binary Tree Level Order Traversal II
108. Convert Sorted Array to Binary Search Tree	108. Convert Sorted Array to Binary Search Tree
1089. Duplicate Zeros	1089. Duplicate Zeros
11. Container With Most Water	11. Container With Most Water
110. Balanced Binary Tree	110. Balanced Binary Tree
116. Populating Next Right Pointers in Each Node	116. Populating Next Right Pointers in Each Node
117. Populating Next Right Pointers in Each Node II	117. Populating Next Right Pointers in Each Node II
12. Integer to Roman	12. Integer to Roman
1295. Find Numbers with Even Number of Digits	1295. Find Numbers with Even Number of Digits
1299. Replace Elements with Greatest Element on Right Side	1299. Replace Elements with Greatest Element on Right Side
13. Roman to Integer	13. Roman to Integer
1346. Check If N and Its Double Exist	1346. Check If N and Its Double Exist
14. Longest Common Prefix	14. Longest Common Prefix
15. 3Sum	15. 3Sum
2. Add Two Numbers	2. Add Two Numbers
226. Invert Binary Tree	226. Invert Binary Tree
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
257. Binary Tree Paths	257. Binary Tree Paths
26. Remove Duplicates from Sorted Array	26. Remove Duplicates from Sorted Array
27. Remove Element	27. Remove Element
283. Move Zeroes	283. Move Zeroes
297. Serialize and Deserialize Binary Tree	297. Serialize and Deserialize Binary Tree
3. Longest Substring Without Repeating Characters	3. Longest Substring Without Repeating Characters
4. Median of Two Sorted Arrays	4. Median of Two Sorted Arrays
404. Sum of Left Leaves	404. Sum of Left Leaves
414. Third Maximum Number	414. Third Maximum Number
448. Find All Numbers Disappeared in an Array	448. Find All Numbers Disappeared in an Array
485. Max Consecutive Ones	485. Max Consecutive Ones
5. Longest Palindromic Substring	5. Longest Palindromic Substring
501. Find Mode in Binary Search Tree	501. Find Mode in Binary Search Tree
530. Minimum Absolute Difference in BST	530. Minimum Absolute Difference in BST
543. Diameter of Binary Tree	543. Diameter of Binary Tree
559. Maximum Depth of N-ary Tree	559. Maximum Depth of N-ary Tree
563. Binary Tree Tilt	563. Binary Tree Tilt
572. Subtree of Another Tree	572. Subtree of Another 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
6. ZigZag Conversion	6. ZigZag Conversion
606. Construct String from Binary Tree	606. Construct String from Binary Tree
617. Merge Two Binary Trees	617. Merge Two Binary Trees
637. Average of Levels in Binary Tree	637. Average of Levels in Binary Tree
653. Two Sum IV - Input is a BST	653. Two Sum IV - Input is a BST
669. Trim a Binary Search Tree	669. Trim a Binary Search Tree
671. Second Minimum Node In a Binary Tree	671. Second Minimum Node In a Binary Tree
7. Reverse Integer	7. Reverse Integer
700. Search in a Binary Search Tree	700. Search in a Binary Search Tree
707. Design Linked List	707. Design Linked List
783. Minimum Distance Between BST Nodes	783. Minimum Distance Between BST Nodes
8. String to Integer (atoi)	8. String to Integer (atoi)
872. Leaf-Similar Trees	872. Leaf-Similar Trees
88. Merge Sorted Array	88. Merge Sorted Array
897. Increasing Order Search Tree	897. Increasing Order Search Tree
9. Palindrome Number	9. Palindrome Number
905. Sort Array By Parity	905. Sort Array By Parity
938. Range Sum of BST	938. Range Sum of BST
941. Valid Mountain Array	941. Valid Mountain Array
95. Unique Binary Search Trees II	95. Unique Binary Search Trees II
965. Univalued Binary Tree	965. Univalued Binary Tree
977. Squares of a Sorted Array	977. Squares of a Sorted Array
98. Validate Binary Search Tree	98. Validate Binary Search Tree
993. Cousins in Binary Tree	993. Cousins in Binary Tree
.gitignore	.gitignore
LICENSE	LICENSE
README.md	README.md

Name

Last commit message

Last commit date

29 Commits

0001.TwoSum

0094.BinaryTreeInorderTraversal

0100.SameTree

0111.MinimumDepthOfBinaryTree

0112.PathSum

101.SymmetricTree

102. Binary Tree Level Order Traversal

1022. Sum of Root To Leaf Binary Numbers