Contents
Preliminary
Part I Data Structures
- Chapter 1 Feature of Charactors
-
Chapter 2 Array's Mystery
- 2.1 - Find Smallest K Numbers
- 2.4 - Maximum Subarray Problem
-
Chapter 3 Trees
- 3.1: Binary Search
Part II Inspirations on Algorithm
-
Chapter 4 Match Searching
-
Chapter 5 Dynamic Programming
- 5.1 - Longest Common Subsequence
- 5.1 - Largest Product Continuous Substring
Part III Comprehensive Training
- Chapter 6 Massive Data Processing
- Chapter 7 Machine Learning
- Appendix More Questions