Name		Name	Last commit message	Last commit date
Latest commit History 115 Commits
1.Two Sum.cpp		1.Two Sum.cpp
101. Symmetric Tree.cpp		101. Symmetric Tree.cpp
102. Binary Tree Level Order Traversal.py		102. Binary Tree Level Order Traversal.py
102.Binary Tree Level Order Traversal.cpp		102.Binary Tree Level Order Traversal.cpp
104.Maximum Depth of Binary Tree.cpp		104.Maximum Depth of Binary Tree.cpp
105. Construct Binary Tree from Preorder and Inorder Traversal.cpp		105. Construct Binary Tree from Preorder and Inorder Traversal.cpp
108.convert Sorted array to binary search tree.cpp		108.convert Sorted array to binary search tree.cpp
109.Convert sorted list to BST		109.Convert sorted list to BST
11. Container With Most Water.cpp		11. Container With Most Water.cpp
110. Balance Binary Tree.cpp		110. Balance Binary Tree.cpp
114.Flatten Binary Tree to Linked List.cpp		114.Flatten Binary Tree to Linked List.cpp
120. Triangle.cpp		120. Triangle.cpp
121.BestTimeToBuyAndSellStocks.cpp		121.BestTimeToBuyAndSellStocks.cpp
121.BestTimeToBuyAndSellStocks.py		121.BestTimeToBuyAndSellStocks.py
124.Binary Tree Maximum Path Sum.cpp		124.Binary Tree Maximum Path Sum.cpp
124.Binary Tree Maximum Path Sum.py		124.Binary Tree Maximum Path Sum.py
136. Single Number.cpp		136. Single Number.cpp
139. word break.cpp		139. word break.cpp
140. word break II.cpp		140. word break II.cpp
141.Linked List Cycle.cpp		141.Linked List Cycle.cpp
142. Linked List Cycle II.cpp		142. Linked List Cycle II.cpp
148. Sort List.cpp		148. Sort List.cpp
15. 3sum.cpp		15. 3sum.cpp
15. 3sum.py		15. 3sum.py
152. Maximum Product Subarray.cpp		152. Maximum Product Subarray.cpp
155. Min Stack.cpp		155. Min Stack.cpp
160. Intersection of Two Linked Lists.cpp		160. Intersection of Two Linked Lists.cpp
169.Majority Element.cpp		169.Majority Element.cpp
17. Letter Combinations of a Phone Number.cpp		17. Letter Combinations of a Phone Number.cpp
19. Remove Nth Node From End of List.cpp		19. Remove Nth Node From End of List.cpp
199.Binary Tree Right Side View		199.Binary Tree Right Side View
2. addTwoNumbers.cpp		2. addTwoNumbers.cpp
2.addTwoNumbers.py		2.addTwoNumbers.py
20. Valid Parentheses.cpp		20. Valid Parentheses.cpp
206.Reverse Linked List.cpp		206.Reverse Linked List.cpp
207. Course Schedule.cpp		207. Course Schedule.cpp
208.Implement Trie (Prefix Tree).cpp		208.Implement Trie (Prefix Tree).cpp
21. Merge Two Sorted Lists.cpp		21. Merge Two Sorted Lists.cpp
215. Kth Largest Element in an Array.cpp		215. Kth Largest Element in an Array.cpp
22. Generate Parentheses.cpp		22. Generate Parentheses.cpp
221. Maximal Square		221. Maximal Square
23. Merge K sorted lists.cpp		23. Merge K sorted lists.cpp
257.Binary Tree Path.cpp		257.Binary Tree Path.cpp
263. Ugly number.cpp		263. Ugly number.cpp
264.Ugly number II.cpp		264.Ugly number II.cpp
279 Perfect Squares.cpp		279 Perfect Squares.cpp
3. Longest Substring Without Repeating Characters.cpp		3. Longest Substring Without Repeating Characters.cpp
32. Longest Valid Parentheses.cpp		32. Longest Valid Parentheses.cpp
325 Maximum Size Subarray Sum Equals k.cpp		325 Maximum Size Subarray Sum Equals k.cpp
33. Search in Rotated Sorted Array.cpp		33. Search in Rotated Sorted Array.cpp
34. Search for a Range.cpp		34. Search for a Range.cpp
39. Combination Sum.cpp		39. Combination Sum.cpp
4. Median of Two Sorted Arrays.cpp		4. Median of Two Sorted Arrays.cpp
4. Median of Two Sorted Arrays.py		4. Median of Two Sorted Arrays.py
40. Combination Sum II.cpp		40. Combination Sum II.cpp
42. Trapping Rain Water.cpp		42. Trapping Rain Water.cpp
45. Jump Game II.cpp		45. Jump Game II.cpp
46 Permutations.cpp		46 Permutations.cpp
47. Permutations II.cpp		47. Permutations II.cpp
49. Group Anagrams.cpp		49. Group Anagrams.cpp
53. Maximum Subarray		53. Maximum Subarray
55. Jump Game.cpp		55. Jump Game.cpp
56. Merge Intervals.cpp		56. Merge Intervals.cpp
560. Subarray Sum Equals K.cpp		560. Subarray Sum Equals K.cpp
572 Subtree of Another Tree.cpp		572 Subtree of Another Tree.cpp
581. Shortest Unsorted Continuous Subarray.cpp		581. Shortest Unsorted Continuous Subarray.cpp
583. Delete Operation for Two Strings.cpp		583. Delete Operation for Two Strings.cpp
617. Merge Two Binary Trees.cpp		617. Merge Two Binary Trees.cpp
62.Unique Path.cpp		62.Unique Path.cpp
621. Task Scheduler.cpp		621. Task Scheduler.cpp
632. Smallest Range.cpp		632. Smallest Range.cpp
64. Minimum Path Sum.cpp		64. Minimum Path Sum.cpp
70. Climbing Stairs.cpp		70. Climbing Stairs.cpp
72. Edit Distance.cpp		72. Edit Distance.cpp
75. Sort Colors.cpp		75. Sort Colors.cpp
76. Minimum Window Substring.cpp		76. Minimum Window Substring.cpp
78. subset.cpp		78. subset.cpp
79. word search.cpp		79. word search.cpp
81. Search in Rotated Sorted Array II.cpp		81. Search in Rotated Sorted Array II.cpp
84.Largest Rectangle in Histogram.cpp		84.Largest Rectangle in Histogram.cpp
85. Maximal Rectangle.cpp		85. Maximal Rectangle.cpp
91 Decode ways.cpp		91 Decode ways.cpp
92. Reverse Linked List II.cpp		92. Reverse Linked List II.cpp
96.unique binary search tree.cpp		96.unique binary search tree.cpp
98. Validate Binary Search Tree.cpp		98. Validate Binary Search Tree.cpp
ArrayNesting.cpp		ArrayNesting.cpp
ArrayNesting.py		ArrayNesting.py
README.md		README.md
merge intervals.cpp		merge intervals.cpp
merge k sorted list.py		merge k sorted list.py
unique path II.cpp		unique path II.cpp

Repository files navigation

LeetcodeTop100

Top 100 Algorithm in Leetcode

3 sum
Add two numbers
Array Nesting

Daffy2418/LeetcodeTop100

Folders and files

Latest commit

History