Leetcode Note
Introduction
Array
Backtracking
Permutation
Leetcode 46. Permutations
Leetcode 47. Permutations II
Leetcode 78. Subsets
Leetcode 90. Subsets II
Leetcode 51. N-Queens
Combination
Leetcode 77. Combinations
Leetcode 39. Combination Sum
Leetcode 40. Combination Sum II
Leetcode 216. Combination Sum III
Leetcode 17. Letter Combinations of a Phone Number
Leetcode 401. Binary Watch
Tree
Depth Search First of Tree
Leetcode 144. Binary Tree Preorder Traversal
Leetcode 94. Binary Tree Inorder Traversal
Leetcode 145. Binary Tree Postorder Traversal
Breadth Search First of Tree
Leetcode 102. Binary Tree Level Order Traversal
Leetcode 127. Word Ladder
Leetcode 433. Minimum Genetic Mutation
Change the Structure of Tree
Leetcode 156. Binary Tree Upside Down
Leetcode 104. Maximum Depth of Binary Tree
Leetcode 110. Balanced Binary Tree
Leetcode 111. Minimum Depth of Binary Tree
String
Integer to String\/String to Integer
Leetcode 12. Integer to Roman
Leetcode 13. Roman to Integer
Leetcode 273. Integer to English Words
Data Structure
Lintcode 130. Heapify
Lintcode 85. Insert Node in a Binary Search Tree
Lintcode 87. Remove Node in Binary Search Tree
Leetcode 146. LRU Cache
Lintcode 24. LFU Cache
Leetcode 155. Min Stack
Interview Question. Min Queue
LinkedList
Leetcode 377. Combination Sum IV
Dynamic Programming
Binary Search
Bit Manipulation
Leetcode 136. Single Number
Leetcode 137. Single Number II
Leetcode 260. Single Number III
Leetcode 268. Missing Number
Two Pointer
Leetcode 75. Sort Colors
Lintcode 143. Sort Colors II
Sum
Two Sum Problem Analysis 1: Sort and Hash with unique solution
Two Sum Problem Analysis 2: Sort and Hash with Not Unique and No Duplicates
Two Sum Problem Analysis 3: Sort and Hash with not Unique and Duplicates
Matrix
Leetcode 311. Sparse Matrix Multiplication
Leetcode 54. Spiral Matrix
Leetcode 59. Spiral Matrix II
Appendix
Leetcode 341. Flattern Nested List Iterator
Leetcode 229. Majority Element II
Leetcode 169. Majority Element
Leetcode 31. Next Permutation
Leetcode 149. Max Points on a Line
Powered by
GitBook
Data Structure
Data Structure
Basic Operation in BST
Lintcode 85. Insert Node in a Binary Search Tree
Lintcode 87. Remove Node in Binary Search Tree
Cache
Leetcode 146. LRU Cache
Lintcode 24. LFU Cache
results matching "
"
No results matching "
"