IOTLeetCoder Notes
复习大纲
要做的题目
要了解的知识
Frequent Bugs
Template
2d Matrix Binary Search
[System Design]
[System Design]Database
[System Design]Design a Twitter
[System Design]Web System
[System Design]Distribute System
[System Design]Big Table
[System Design]Map Reduce
[System Design]Message System & Whatsapp
[System Design]Location Based Service
[基础]Questions/Topics to be reviewed
[基础] Binary Search
[基础] Graph
[基础]Java syntax
[基础]Sorting
[基础] Heap
[基础] Binary Search Tree
[基础]Backtracking/DFS
[LintCode] Connecting Graph
[LintCode] Connecting Graph II
[LintCode] Connecting Graph III
[LintCode] Number of islands
[LintCode] Number of islands II
Implement comparator
Implement Iterator
Implement a Trie
[LintCode] Flatten Nested List Iterator
LC 417 Pacific Atlantic Water Flow
LC 207 Course Schedule
LC 210 Course Schedule II
LC 200 Number of islands
LC 103 Binary Tree Zigzag Level Order Traversal
LC 515 Find Largest Value in Each Tree Row
LC 513 Find Bottom Left Tree Value
LC 130. Surrounded Regions
LC 542 01 Matrix
LC 451. Sort Characters By Frequency
LC 313. Super Ugly Number
LC 215. Kth Largest Element in an Array
LC 378. Kth Smallest Element in a Sorted Matrix
LC 373. Find K Pairs with Smallest Sums
LC 264. Ugly Number II
LC 347. Top K Frequent Elements
LC 355. Design Twitter
LC 239. Sliding Window Maximum
LC 218. The Skyline Problem
LC 407. Trapping Rain Water II
LC 502. IPO
LC 563. Binary Tree Tilt
LC 501. Find Mode in Binary Search Tree
LC 437. Path Sum III
LC 404. Sum of Left Leaves
LC 257. Binary Tree Paths
LC 112. Path Sum
LC 110. Balanced Binary Tree
LC 543. Diameter of Binary Tree
LC 107. Binary Tree Level Order Traversal II
LC 226. Invert Binary Tree
LC 235. Lowest Common Ancestor of a Binary Search Tree
LC 104. Maximum Depth of Binary Tree
LC 111. Minimum Depth of Binary Tree
LC 101. Symmetric Tree
LC 100. Same Tree
LC 95. Unique Binary Search Trees II
LC 102. Binary Tree Level Order Traversal
LC 236. Lowest Common Ancestor of a Binary Tree
LC 105. Construct Binary Tree from Preorder and Inorder Traversal
LC 230. Kth Smallest Element in a BST
LC 106. Construct Binary Tree from Inorder and Postorder Traversal
LC 199. Binary Tree Right Side View
LC 173. Binary Search Tree Iterator
LC 538. Convert BST to Greater Tree
LC 144. Binary Tree Preorder Traversal
LC 129. Sum Root to Leaf Numbers
LC 116. Populating Next Right Pointers in Each Node
LC 117. Populating Next Right Pointers in Each Node II
LC 114. Flatten Binary Tree to Linked List
LC 113. Path Sum II
LC 222. Count Complete Tree Nodes
LC 515. Find Largest Value in Each Tree Row
LC 508. Most Frequent Subtree Sum
LC 96. Unique Binary Search Trees
LC 450. Delete Node in a BST
LC 449. Serialize and Deserialize BST
LC 98. Validate Binary Search Tree
LC 337. House Robber III
LC 99. Recover Binary Search Tree
LC 124. Binary Tree Maximum Path Sum
LC 297. Serialize and Deserialize Binary Tree
LC 399. Evaluate Division
LC 332. Reconstruct Itinerary
LC 310. Minimum Height Trees
LC 133. Clone Graph
[LintCode] Convert Sorted Array to Binary Search Tree With Minimal Height
[LintCode] Flatten List
[LintCode] Nested List Weight Sum
[LintCode] Subtree
LC 547. Friend Circles
LC 494. Target Sum
LC 491. Increasing Subsequences
GoogleMock Keep Distance for identical elements
LC 401. Binary Watch
LC 473. Matchsticks to Square
LC 93. Restore IP Addresses
LC 22. Generate Parentheses
LC 39. Combination Sum
LC 40. Combination Sum II
LC 46. Permutations
LC 47. Permutations II
LC 526. Beautiful Arrangement
LC 216. Combination Sum III
LC 17. Letter Combinations of a Phone Number
LC 211. Add and Search Word - Data structure design
LC 357. Count Numbers with Unique Digits
LC 131. Palindrome Partitioning
LC 90. Subsets II
LC 89. Gray Code
LC 79. Word Search
LC 78. Subsets
LC 77. Combinations
LC 44. Wildcard Matching
LC 51. N-Queens
LC 148. Sort List
LC 179. Largest Number
LC 242. Valid Anagram
LC 56. Merge Intervals
LC 253. Meeting Rooms II
LC 524. Longest Word in Dictionary through Deleting
Powered by
GitBook
[System Design]Database
results matching "
"
No results matching "
"