Skip to content

UMN-HKC/Facebook_Tag

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

391 Commits
0010. Regular Expression Matching.md
0010. Regular Expression Matching.md
 
 
0079. Word Search.md
0079. Word Search.md
 
 
0227. Basic Calculator II.md
0227. Basic Calculator II.md
 
 
100. Same Tree.md
100. Same Tree.md
 
 
101. Symmetric Tree.md
101. Symmetric Tree.md
 
 
103. Zig-zag Level Traversal.md
103. Zig-zag Level Traversal.md
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal.md
105. Construct Binary Tree from Preorder and Inorder Traversal.md
 
 
106. Construct Binary Tree from Inorder and Postorder Traversal.md
106. Construct Binary Tree from Inorder and Postorder Traversal.md
 
 
107. Binary Tree Level Order Traversal II.md
107. Binary Tree Level Order Traversal II.md
 
 
108. Convert Sorted Array to Binary Search Tree.md
108. Convert Sorted Array to Binary Search Tree.md
 
 
109. Convert Sorted List to Binary Search Tree.md
109. Convert Sorted List to Binary Search Tree.md
 
 
110. Balanced Binary Tree.md
110. Balanced Binary Tree.md
 
 
111. Minimum Depth of Binary Tree.md
111. Minimum Depth of Binary Tree.md
 
 
112. Path Sum.md
112. Path Sum.md
 
 
113. Path Sum II.md
113. Path Sum II.md
 
 
114. Flatten Binary Tree to Linked List.md
114. Flatten Binary Tree to Linked List.md
 
 
116. Populating Next Right Pointers in Each Node.md
116. Populating Next Right Pointers in Each Node.md
 
 
118. Pascal's Triangle.md
118. Pascal's Triangle.md
 
 
12. Integer to Roman.md
12. Integer to Roman.md
 
 
121. Best Time to Buy and Sell Stock.md
121. Best Time to Buy and Sell Stock.md
 
 
122. Best Time to Buy and Sell Stock II.md
122. Best Time to Buy and Sell Stock II.md
 
 
123. Best Time to Buy and Sell Stock III.md
123. Best Time to Buy and Sell Stock III.md
 
 
124. Binary Tree Maximum Path Sum.md
124. Binary Tree Maximum Path Sum.md
 
 
125. Valid Palindrome.md
125. Valid Palindrome.md
 
 
126. Word Ladder II.md
126. Word Ladder II.md
 
 
127. Word Ladder.md
127. Word Ladder.md
 
 
128. Longest Consecutive Sequence.md
128. Longest Consecutive Sequence.md
 
 
129. Sum Root to Leaf Numbers.md
129. Sum Root to Leaf Numbers.md
 
 
13. Roman to Integer.md
13. Roman to Integer.md
 
 
130. Surrounded Regions.md
130. Surrounded Regions.md
 
 
133. Clone Graph.md
133. Clone Graph.md
 
 
136. Single Number.md
136. Single Number.md
 
 
137. Single Number II.md
137. Single Number II.md
 
 
138. Copy List with Random Pointer.md
138. Copy List with Random Pointer.md
 
 
139. Word Break.md
139. Word Break.md
 
 
141. Linked List Cycle.md
141. Linked List Cycle.md
 
 
142. Linked List Cycle II.md
142. Linked List Cycle II.md
 
 
143. Reorder List.md
143. Reorder List.md
 
 
144. Binary Tree Preorder Traversal.md
144. Binary Tree Preorder Traversal.md
 
 
145. Binary Tree Postorder Traversal.md
145. Binary Tree Postorder Traversal.md
 
 
146. LRU Cache.md
146. LRU Cache.md
 
 
15. 3Sum.md
15. 3Sum.md
 
 
150. Evaluate Reverse Polish Notation.md
150. Evaluate Reverse Polish Notation.md
 
 
152. Maximum Product Subarray.md
152. Maximum Product Subarray.md
 
 
153. Find Minimum in Rotated Sorted Array.md
153. Find Minimum in Rotated Sorted Array.md
 
 
157. Read N Characters Given Read4.md
157. Read N Characters Given Read4.md
 
 
158. Read N Characters Given Read4 II - Call multiple times.md
158. Read N Characters Given Read4 II - Call multiple times.md
 
 
160. Intersection of Two Linked List.md
160. Intersection of Two Linked List.md
 
 
161. One Edit Distance.md
161. One Edit Distance.md
 
 
162. Find Peak Element.md
162. Find Peak Element.md
 
 
167. Two Sum II - Input array is sorted.md
167. Two Sum II - Input array is sorted.md
 
 
17. Letter Combinations of a Phone Number.md
17. Letter Combinations of a Phone Number.md
 
 
170. Two Sum III - Data structure design.md
170. Two Sum III - Data structure design.md
 
 
173. Binary Search Tree Iterator.md
173. Binary Search Tree Iterator.md
 
 
18. 4Sum.md
18. 4Sum.md
 
 
189. Rotate Array.md
189. Rotate Array.md
 
 
19. Remove Nth Node From End of List.md
19. Remove Nth Node From End of List.md
 
 
198. House Robber.md
198. House Robber.md
 
 
199. Binary Tree Right Side View.md
199. Binary Tree Right Side View.md
 
 
2. Add Two Numbers.md
2. Add Two Numbers.md
 
 
20. Valid Parentheses.md
20. Valid Parentheses.md
 
 
200. Number of Islands.md
200. Number of Islands.md
 
 
206. Reverse Linked List.md
206. Reverse Linked List.md
 
 
207. Course Schedule.md
207. Course Schedule.md
 
 
208. Implement Trie (Prefix Tree).md
208. Implement Trie (Prefix Tree).md
 
 
209. Minimum Size Subarray Sum.md
209. Minimum Size Subarray Sum.md
 
 
210. Course Schedule II.md
210. Course Schedule II.md
 
 
211. Add and Search Word - Data structure design.md
211. Add and Search Word - Data structure design.md
 
 
212. Word Search II.md
212. Word Search II.md
 
 
213. House Robber II.md
213. House Robber II.md
 
 
215. Kth Largest Element in an Array.md
215. Kth Largest Element in an Array.md
 
 
216. Combination Sum III.md
216. Combination Sum III.md
 
 
217. Contains Duplicate.md
217. Contains Duplicate.md
 
 
219. Contains Duplicate II.md
219. Contains Duplicate II.md
 
 
221. Maximal Square.md
221. Maximal Square.md
 
 
222. Count Complete Tree Nodes.md
222. Count Complete Tree Nodes.md
 
 
224. Basic Calculator.md
224. Basic Calculator.md
 
 
23. Merge K Sorted Lists.md
23. Merge K Sorted Lists.md
 
 
234. Palindrome Linked List.md
234. Palindrome Linked List.md
 
 
236. Lowest Common Ancestor of a Binary Tree Given.md
236. Lowest Common Ancestor of a Binary Tree Given.md
 
 
238. Product of Array Except Self.md
238. Product of Array Except Self.md
 
 
239. Sliding Window Maximum.md
239. Sliding Window Maximum.md
 
 
241. Different Ways to Add Parentheses.md
241. Different Ways to Add Parentheses.md
 
 
246. Strobogrammatic Number.md
246. Strobogrammatic Number.md
 
 
247. Strobogrammatic Number II.md
247. Strobogrammatic Number II.md
 
 
250. Count Univalue Subtrees.md
250. Count Univalue Subtrees.md
 
 
251. Flatten 2D Vector.md
251. Flatten 2D Vector.md
 
 
253. Meeting Rooms II.md
253. Meeting Rooms II.md
 
 
257. Binary Tree Paths.md
257. Binary Tree Paths.md
 
 
26. Remove Duplicates from Sorted Array.md
26. Remove Duplicates from Sorted Array.md
 
 
260. Single Number III.md
260. Single Number III.md
 
 
261. Graph Valid Tree.md
261. Graph Valid Tree.md
 
 
266. Palindrome Permutation.md
266. Palindrome Permutation.md
 
 
268. Missing Number.md
268. Missing Number.md
 
 
269. Alien Dictionary.md
269. Alien Dictionary.md
 
 
270. Closest Binary Search Tree Value.md
270. Closest Binary Search Tree Value.md
 
 
273. Integer to English Words.md
273. Integer to English Words.md
 
 
277. Find the Celebrity.md
277. Find the Celebrity.md
 
 
278. First Bad Version.md
278. First Bad Version.md
 
 
28. Implement strStr().md
28. Implement strStr().md
 
 

Repository files navigation

Leetcode-problems

Solving coding problems to prepare for Facebook Technical Interviews

About

No description or website provided.

Topics

untag

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages