1. Chapter 01 - Small problems
Classic problems of recursivity and memoization and bits manipulation.
Among the issues addressed in this chapter are the following:
- Fibonacci Sequence
- Trivial Compression
- Unbreakable Encryption
- Calculating PI
- Hanoi Towers
2. Chapter 02 - Search problems
This chapter describes the main search problems that all programmers must know about, like as:
- Linear search
- Binary search
- Depth-first search
- Breadth-first search
- A* search
3. Chapter 03 - Satisfaction and restriction problems