updated README with ch3 and ch18 topics
This commit is contained in:
parent
86d39340d0
commit
1ec270e4aa
16
README.md
16
README.md
|
|
@ -34,6 +34,17 @@ If you can't afford to buy the book, you can find a free pdf [here](https://leon
|
||||||
* List intersection
|
* List intersection
|
||||||
* Loop detection
|
* Loop detection
|
||||||
|
|
||||||
|
## Chapter 3 Stacks and queues
|
||||||
|
|
||||||
|
* 3 stacks in array
|
||||||
|
* Min function in stack
|
||||||
|
* List of stacks
|
||||||
|
* Queue via stack
|
||||||
|
* Sort stack
|
||||||
|
* Animal shelter (enqueue and dequeue with ordering)
|
||||||
|
|
||||||
|
## Chapter 4 Trees and graphs
|
||||||
|
|
||||||
## Chapter 7 Object-oriented design
|
## Chapter 7 Object-oriented design
|
||||||
|
|
||||||
* Hash tables
|
* Hash tables
|
||||||
|
|
@ -51,3 +62,8 @@ If you can't afford to buy the book, you can find a free pdf [here](https://leon
|
||||||
* Write an integer in english
|
* Write an integer in english
|
||||||
* Contiguous sequence or Maximum subarray
|
* Contiguous sequence or Maximum subarray
|
||||||
* Least Recently Used cache
|
* Least Recently Used cache
|
||||||
|
|
||||||
|
## Chapter 18 Advanced topics
|
||||||
|
|
||||||
|
* Hash table collision resolution
|
||||||
|
* Rabin-Karp substring search
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue