Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
1. two sum
1. two sum
 
 
127. Word Ladder_files
127. Word Ladder_files
 
 
136. single number
136. single number
 
 
137.Single Number II
137.Single Number II
 
 
142. Linked List Cycle II_files
142. Linked List Cycle II_files
 
 
144. Binary Tree Preorder Traversal
144. Binary Tree Preorder Traversal
 
 
15. 3 Sum_files
15. 3 Sum_files
 
 
15. three sum
15. three sum
 
 
169. Majority Element
169. Majority Element
 
 
200. Number of Islands
200. Number of Islands
 
 
208. Implement Trie (Prefix Tree)_files
208. Implement Trie (Prefix Tree)_files
 
 
229. Majority Element II
229. Majority Element II
 
 
240. Search a 2D Matrix II_files
240. Search a 2D Matrix II_files
 
 
260. Single Number III
260. Single Number III
 
 
72. Edit Distance_files
72. Edit Distance_files
 
 
78. Subsets_files
78. Subsets_files
 
 
deletion of BST_files
deletion of BST_files
 
 
lintcode - Longest Common Substring_files
lintcode - Longest Common Substring_files
 
 
lintcode - Majority number III
lintcode - Majority number III
 
 
lintcode - Minimum Adjustment Cost_files
lintcode - Minimum Adjustment Cost_files
 
 
lintcode - Search Range in Binary Search Tree_files
lintcode - Search Range in Binary Search Tree_files
 
 
lintcode - Topological Sorting_files
lintcode - Topological Sorting_files
 
 
scala-note (慕课网)_files
scala-note (慕课网)_files
 
 
.gitattributes
.gitattributes
 
 
.gitignore
.gitignore
 
 
1. Two Sum.html
1. Two Sum.html
 
 
100. Same Tree.html
100. Same Tree.html
 
 
101. Symmetric Tree.html
101. Symmetric Tree.html
 
 
102. Binary Tree Level Order Traversal.html
102. Binary Tree Level Order Traversal.html
 
 
103. Binary Tree Zigzag Level Order Traversal.html
103. Binary Tree Zigzag Level Order Traversal.html
 
 
104. Maximum Depth of Binary Tree.html
104. Maximum Depth of Binary Tree.html
 
 
107. Binary Tree Level Order Traversal II.html
107. Binary Tree Level Order Traversal II.html
 
 
108. Convert Sorted Array to Binary Search Tr.html
108. Convert Sorted Array to Binary Search Tr.html
 
 
109. Convert Sorted List to Binary Search Tre.html
109. Convert Sorted List to Binary Search Tre.html
 
 
110. Balanced Binary Tree.html
110. Balanced Binary Tree.html
 
 
111. Minimum Depth of Binary Tree.html
111. Minimum Depth of Binary Tree.html
 
 
112. Path Sum.html
112. Path Sum.html
 
 
115. Distinct Subsequences.html
115. Distinct Subsequences.html
 
 
118. Pascal's Triangle.html
118. Pascal's Triangle.html
 
 
119. Pascal's Triangle II.html
119. Pascal's Triangle II.html
 
 
120. Triangle.html
120. Triangle.html
 
 
121. Best Time to Buy and Sell Stock [2].html
121. Best Time to Buy and Sell Stock [2].html
 
 
121. Best Time to Buy and Sell Stock.html
121. Best Time to Buy and Sell Stock.html
 
 
122. Best Time to Buy and Sell Stock II.html
122. Best Time to Buy and Sell Stock II.html
 
 
123. Best Time to Buy and Sell Stock III.html
123. Best Time to Buy and Sell Stock III.html
 
 
124. Binary Tree Maximum Path Sum.html
124. Binary Tree Maximum Path Sum.html
 
 
125. Valid Palindrome.html
125. Valid Palindrome.html
 
 
126. Word Ladder II.html
126. Word Ladder II.html
 
 
127. Word Ladder.html
127. Word Ladder.html
 
 
128. Longest Consecutive Sequence.html
128. Longest Consecutive Sequence.html
 
 
13. Roman to Integer.html
13. Roman to Integer.html
 
 
131. Palindrome Partitioning.html
131. Palindrome Partitioning.html
 
 
132. Palindrome Partitioning II.html
132. Palindrome Partitioning II.html
 
 
133. Clone Graph.html
133. Clone Graph.html
 
 
136. Single Number.html
136. Single Number.html
 
 
137. Single Number II.html
137. Single Number II.html
 
 
138. Copy List with Random Pointer.html
138. Copy List with Random Pointer.html
 
 
139. Word Break.html
139. Word Break.html
 
 
14. Longest Common Prefix.html
14. Longest Common Prefix.html
 
 
140. Word Break II.html
140. Word Break II.html
 
 
141. Linked List Cycle.html
141. Linked List Cycle.html
 
 
142. Linked List Cycle II.html
142. Linked List Cycle II.html
 
 
143. Reorder List.html
143. Reorder List.html
 
 
144. Binary Tree Preorder Traversal.html
144. Binary Tree Preorder Traversal.html
 
 
146. LRU Cache.html
146. LRU Cache.html
 
 
148. Sort List.html
148. Sort List.html
 
 
15. 3 Sum.html
15. 3 Sum.html
 
 
152. Maximum Product Subarray.html
152. Maximum Product Subarray.html
 
 
155. Min Stack.html
155. Min Stack.html
 
 
156. Binary Tree Upside Down.html
156. Binary Tree Upside Down.html
 
 
157. Read N Characters Given Read4.html
157. Read N Characters Given Read4.html
 
 
158. Read N Characters Given Read4 II - Call .html
158. Read N Characters Given Read4 II - Call .html
 
 
16. 3 Sum Closest.html
16. 3 Sum Closest.html
 
 
160. Intersection of Two Linked Lists.html
160. Intersection of Two Linked Lists.html
 
 
161. One Edit Distance.html
161. One Edit Distance.html
 
 
162. Find Peak Element.html
162. Find Peak Element.html
 
 
165. Compare Version Numbers.html
165. Compare Version Numbers.html
 
 
167. Two Sum II - Input array is sorted.html
167. Two Sum II - Input array is sorted.html
 
 
168. Excel Sheet Column Title.html
168. Excel Sheet Column Title.html
 
 
169. Majority Element.html
169. Majority Element.html
 
 
17. Letter Combinations of a Phone Number.html
17. Letter Combinations of a Phone Number.html
 
 
171. Excel Sheet Column Number.html
171. Excel Sheet Column Number.html
 
 
172. Factorial Trailing Zeroes.html
172. Factorial Trailing Zeroes.html
 
 
173. Binary Search Tree Iterator.html
173. Binary Search Tree Iterator.html
 
 
18. 4 Sum.html
18. 4 Sum.html
 
 
188. Best Time to Buy and Sell Stock IV.html
188. Best Time to Buy and Sell Stock IV.html
 
 
19. Remove Nth Node From End of List [2].html
19. Remove Nth Node From End of List [2].html
 
 
19. Remove Nth Node From End of List.html
19. Remove Nth Node From End of List.html
 
 
190. Reverse Bits.html
190. Reverse Bits.html
 
 
191. Number of 1 Bits.html
191. Number of 1 Bits.html
 
 
198. House Robber.html
198. House Robber.html
 
 
2. Add Two Numbers.html
2. Add Two Numbers.html
 
 
20. Valid Parentheses.html
20. Valid Parentheses.html
 
 
200. Number of Islands.html
200. Number of Islands.html
 
 
202. Happy Number.html
202. Happy Number.html
 
 
203. Remove Linked List Elements.html
203. Remove Linked List Elements.html
 
 
204. Count Primes.html
204. Count Primes.html
 
 
206. Reverse Linked List.html
206. Reverse Linked List.html
 
 
208. Implement Trie (Prefix Tree).html
208. Implement Trie (Prefix Tree).html
 
 
209. Minimum Size Subarray Sum.html
209. Minimum Size Subarray Sum.html
 
 

Repository files navigation

leetcode

Leetcode is a Online Judge platform. I improved my coding skill and solidified my knowledge of data structures and algorithms. I use Java, have solved 234/520 problems now.

About

update

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages