My Awesome Book

Introduction

• 1 Dynamic Programing
  • 1.1 Expression Matching
  • 1.2 Distinct Subsequence
  • 1.3 Maximal Square
  • 1.4 Perfect Squares
  • 1.5 Coin Change
  • 1.6 Integer Break
  • 1.7 Ones and Zeros
• 2. DFS
  • 2.1 Word Break
  • 2.2 Binary Tree Paths
  • 2.3 Frog Jump
  • 2.4 Split Array Largest Sum
  • 2.5 Matchsticks to Square
  • 2.6 Increasing Subsequence
• 3. Tree
  • 3.1 Binary Tree
  • 3.2 Binary Tree Traversal
  • 3.3 Binary Search Tree
  • 3.4 Path Sum
• 4. Design
  • 4.1 Min Stack
  • 4.2 Binary Search Tree Iterator
• 5. Geometry
  • 5.1 Max Points on a Line
• 6. Sort
  • 6.1 Bucket Sort
  • 6.2 Sort Problem
• 7. QuickSelect
• 8. Jump Game
• 9. Operation
• 10. Accumulation
• 11. Best Time To Buy and Sell Stock
• 12. Palindrome
• 13. House Robber
• 14. Prime
• 15. Trie Tree
• 16. Caculator
• 17. Majority Element
• 18. Find the Duplicate Number
• 19. Lexicographical Numbers
• 20. Count xxxx After Self