Name		Name	Last commit message	Last commit date
*121. Best Time to Buy and Sell Stock		*121. Best Time to Buy and Sell Stock
*124. Binary Tree Maximum Path Sum		*124. Binary Tree Maximum Path Sum
*130. Surrounded Regions		*130. Surrounded Regions
*173. Binary Search Tree Iterator		*173. Binary Search Tree Iterator
*215. Kth Largest Element in an Array		*215. Kth Largest Element in an Array
*22. Generate Parentheses		*22. Generate Parentheses
*241. Different Ways to Add Parentheses		*241. Different Ways to Add Parentheses
*312. Burst Balloons		*312. Burst Balloons
*313. Super Ugly Number		*313. Super Ugly Number
*330. Patching Array		*330. Patching Array
*371. Sum of Two Integers		*371. Sum of Two Integers
*4. Median of Two Sorted Arrays		*4. Median of Two Sorted Arrays
*41. First Missing Positive		*41. First Missing Positive
*437. Path Sum III		*437. Path Sum III
*44. Wildcard Matching		*44. Wildcard Matching
*45. Jump Game II		*45. Jump Game II
*53. Maximum Subarray		*53. Maximum Subarray
*69. Sqrt(x)		*69. Sqrt(x)
*89. Gray Code		*89. Gray Code
*94. Binary Tree Inorder Traversal		*94. Binary Tree Inorder Traversal
*98. Validate Binary Search Tree		*98. Validate Binary Search Tree
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
101. Symmetric Tree		101. Symmetric Tree
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
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
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
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
11. Container With Most Water		11. Container With Most Water
110. Balanced Binary Tree		110. Balanced Binary Tree
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
112. Path Sum		112. Path Sum
113. Path Sum II		113. Path Sum II
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
115. Distinct Subsequences		115. Distinct Subsequences
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
118. Pascal's Triangle		118. Pascal's Triangle
119. Pascal's Triangle II		119. Pascal's Triangle II
120. Triangle		120. Triangle
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
125. Valid Palindrome		125. Valid Palindrome
127. Word Ladder		127. Word Ladder
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
13. Roman to Integer		13. Roman to Integer
131. Palindrome Partitioning		131. Palindrome Partitioning
132. Palindrome Partitioning II		132. Palindrome Partitioning II
133. Clone Graph		133. Clone Graph
134. Gas Station		134. Gas Station
135. Candy		135. Candy
136. Single Number		136. Single Number
138. Copy List with Random Pointer		138. Copy List with Random Pointer
139. Word Break		139. Word Break
14. Longest Common Prefix		14. Longest Common Prefix
140. Word Break II		140. Word Break II
141. Linked List Cycle		141. Linked List Cycle
142. Linked List Cycle II		142. Linked List Cycle II
143. Reorder List		143. Reorder List
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
145. Binary Tree Postorder Traversal		145. Binary Tree Postorder Traversal
146. LRU Cache		146. LRU Cache
147. Insertion Sort List		147. Insertion Sort List
148. Sort List		148. Sort List
149. Max Points on a Line		149. Max Points on a Line
15. 3Sum		15. 3Sum
150. Evaluate Reverse Polish Notation		150. Evaluate Reverse Polish Notation
151. Reverse Words in a String		151. Reverse Words in a String
152. Maximum Product Subarray		152. Maximum Product Subarray
153. Find Minimum in Rotated Sorted Array		153. Find Minimum in Rotated Sorted Array
155. Min Stack		155. Min Stack
157. Read N Characters Given Read4		157. Read N Characters Given Read4
158. Read N Characters Given Read4 II - Call multiple times		158. Read N Characters Given Read4 II - Call multiple times
16. 3Sum Closest		16. 3Sum Closest
160. Intersection of Two Linked Lists		160. Intersection of Two Linked Lists
161. One Edit Distance		161. One Edit Distance
162. Find Peak Element		162. Find Peak Element
165. Compare Version Numbers		165. Compare Version Numbers
166. Fraction to Recurring Decimal		166. Fraction to Recurring Decimal
167. Two Sum II - Input array is sorted		167. Two Sum II - Input array is sorted
168. Excel Sheet Column Title My Submissions Question		168. Excel Sheet Column Title My Submissions Question
169. Majority Element		169. Majority Element
17. Letter Combinations of a Phone Number		17. Letter Combinations of a Phone Number
170. Two Sum III - Data structure design		170. Two Sum III - Data structure design
171. Excel Sheet Column Number		171. Excel Sheet Column Number
172. Factorial Trailing Zeroes		172. Factorial Trailing Zeroes
175. Combine Two Tables		175. Combine Two Tables
176. Second Highest Salary		176. Second Highest Salary
179. Largest Number		179. Largest Number
18. 4Sum		18. 4Sum
180. Consecutive Numbers		180. Consecutive Numbers
181. Employees Earning More Than Their Managers		181. Employees Earning More Than Their Managers
182. Duplicate Emails		182. Duplicate Emails
183. Customers Who Never Order		183. Customers Who Never Order
186. Reverse Words in a String II		186. Reverse Words in a String II
187. Repeated DNA Sequences		187. Repeated DNA Sequences
189. Rotate Array		189. Rotate Array

Repository files navigation

MyLeetCodePractice

。。。

About

Some solutions of LeetCode problems. Hope I could do it better!

0 stars

1 watching

Report repository

Releases

Packages

Contributors