Skip to content

Latest commit

 

History

History
129 lines (94 loc) · 8.72 KB

unknown.md

File metadata and controls

129 lines (94 loc) · 8.72 KB
Raw

LintCode

Data Structure

Linear

Martrix

  1. 1170. Reshape the Matrix [Solution]

Stack

  1. 40. Implement Queue by Two Stacks [Solution]
  2. 224. Implement Three Stacks by Single Array [Solution]
  3. 494. Implement Stack by Two Queues [Solution]
  4. 495. Implement Stack [Solution]
  5. 901. Closest Binary Search Tree Value II [Solution]

Queue/Deque

  1. 40. Implement Queue by Two Stacks [Solution]
  2. 69. Binary Tree Level Order Traversal [Solution]
  3. 494. Implement Stack by Two Queues [Solution]
  4. 642. Moving Average from Data Stream [Solution]
  5. 955. Implement Queue by Circular Array [Solution]

Linked List

  1. 102. Linked List Cycle [Solution]
  2. 103. Linked List Cycle II [Solution]
  3. 104. Merge K Sorted Lists [Solution]
  4. 225. Find Node in Linked List [Solution]
  5. 228. Middle of Linked List [Solution]
  6. 466. Count Linked List Nodes [Solution]
  7. 483. Convert Linked List to Array List [Solution]

Tree

Binary Search Tree

  1. 86. Binary Search Tree Iterator [Solution]
  2. 95. Validate Binary Search Tree [Solution]
  3. 900. Closest Binary Search Tree Value [Solution]
  4. 901. Closest Binary Search Tree Value II [Solution]
  5. 902. Kth Smallest Element in a BST [Solution]

Heap

  1. 104. Merge K Sorted Lists [Solution]
  2. 130. Heapify [Solution]
  3. 544. Top k Largest Numbers [Solution]
  4. 612. K Closest Points [Solution]

Algorithm:

Math

  1. 141. Sqrt(x) [Solution]
  2. 366. Fibonacci [Solution]
  3. 428. Pow(x, n) [Solution]
  4. 765. Valid Triangle [Solution]
  5. 845. Greatest Common Divisor [Solution]
  6. 977. Base 7 [Solution]
  7. 1314. Power of Two [Solution]

Search

Recusion

  1. 15. Permutations [Solution] [Review]
  2. 17. Subsets [Solution]
  3. 18. Subsets II [Solution]
  4. 33. N-Queens [Solution] [Review]
  5. 66. Binary Tree Preorder Traversal [Solution]
  6. 67. Binary Tree Inorder Traversal [Solution]
  7. 68. Binary Tree Postorder Traversal [Solution]
  8. 93. Balanced Binary Tree [Solution]
  9. 95. Validate Binary Search Tree [Solution]
  10. 97. Maximum Depth of Binary Tree [Solution]
  11. 425. Letter Combinations of a Phone Number [Solution]

Non Recursion

  1. 66. Binary Tree Preorder Traversal [Solution]
  2. 86. Binary Search Tree Iterator [Solution]
  3. 366. Fibonacci [Solution]

Divide and Conquer

  1. 93. Balanced Binary Tree [Solution]
  2. 95. Validate Binary Search Tree [Solution]
  3. 97. Maximum Depth of Binary Tree [Solution]
  4. 104. Merge K Sorted Lists [Solution]
  5. 140. Fast Power [Solution]
  6. 428. Pow(x, n) [Solution]

Binary Tree Traversal

  1. 66. Binary Tree Preorder Traversal [Solution]
  2. 67. Binary Tree Inorder Traversal [Solution]
  3. 68. Binary Tree Postorder Traversal [Solution]
  4. 69. Binary Tree Level Order Traversal [Solution]
  5. 480. Binary Tree Paths [Solution]
  6. 1126. Merge Two Binary Trees [Solution]

Backtracking

  1. 18. Subsets II [Solution]
  2. 121. Word Ladder II [Solution]
  3. 135. Combination Sum [Solution]
  4. 153. Combination Sum II [Solution]
  5. 425. Letter Combinations of a Phone Number [Solution]
  6. 680. Split String [Solution]
  7. 829. Word Pattern II [Solution]

DP

  1. 114. Unique Paths [Solution]
  2. 115. Unique Paths II [Solution]

Other

Greedy

  1. 41. Maximum Subarray [Solution]
  2. 1163. Distribute Candies [Solution]

Bit Manipulation

  1. 1. A + B Problem [Solution] [Solution]