README
¶
The Algorithm Design Manual
Hi 😁 this is one of my learning repositories. I go through some of the exercises from the Algorithm Design Manual book https://www.algorist.com. It is a great book you can go through together with the lectures.
Note that some the design decisions are optimized for convenience in testing and actually implementing a solution. Most of the time the naive assumption that user input is valid is made. The book has so many exercises that I cannot put in the same effort as I would for production code 😅. So there is often plenty of room for refactoring which I did not spend much if any time on.
Thanks to
https://www.algorist.com has a solutions wiki which did not help me with the exercises that were difficult for me. This one did though
Thank you 🤩
Directories
¶
| Path | Synopsis |
|---|---|
|
chapter-four
|
|
|
color
Package set solves exercise 4.9 4-4.
|
Package set solves exercise 4.9 4-4. |
|
frequencies
Package set solves exercise 4.9 4-11.
|
Package set solves exercise 4.9 4-11. |
|
grinch
Package set solves exercise 4.9 4-1.
|
Package set solves exercise 4.9 4-1. |
|
hindex
Package set solves exercise 4.9 4-7.
|
Package set solves exercise 4.9 4-7. |
|
minmax
Package set solves exercise 4.9 4-2.
|
Package set solves exercise 4.9 4-2. |
|
minmaxpair
Package set solves exercise 4.9 4-3.
|
Package set solves exercise 4.9 4-3. |
|
mode
Package set solves exercise 4.9 4-5.
|
Package set solves exercise 4.9 4-5. |
|
nsum
Package set solves exercise 4.9 4-9.
|
Package set solves exercise 4.9 4-9. |
|
party
Package set solves exercise 4.9 4-13.
|
Package set solves exercise 4.9 4-13. |
|
twosum
Package set solves exercise 4.9 4-6.
|
Package set solves exercise 4.9 4-6. |
|
twosumsingle
Package set solves exercise 4.9 4-10.
|
Package set solves exercise 4.9 4-10. |
|
union
Package set solves exercise 4.9 4-12.
|
Package set solves exercise 4.9 4-12. |
|
chapter-three
|
|
|
3-31
Package problem_331 solves exercise 3.10 3-31.
|
Package problem_331 solves exercise 3.10 3-31. |
|
balanced-parens
Package parens checks if parenthesis in a given input are balanced.
|
Package parens checks if parenthesis in a given input are balanced. |
|
binpacking
Package binpacking solves exercise 3.10 3-25.
|
Package binpacking solves exercise 3.10 3-25. |
|
dynamic-array
Package dynamic implements a dynamic array growing and shrinking depending on the length and capacity.
|
Package dynamic implements a dynamic array growing and shrinking depending on the length and capacity. |
|
hotel
Package rangeminimum solves exercise 3.10 3-30.
|
Package rangeminimum solves exercise 3.10 3-30. |
|
kunique
Package kunique solves exercise 3.10 3-24.
|
Package kunique solves exercise 3.10 3-24. |
|
list
Package implements a singly linked list.
|
Package implements a singly linked list. |
|
median
Package set solves exercise 3.10 3-22.
|
Package set solves exercise 3.10 3-22. |
|
rangeminimum
Package rangeminimum solves exercise 3.10 3-26.
|
Package rangeminimum solves exercise 3.10 3-26. |
|
reverse
Package implements a singly linked list.
|
Package implements a singly linked list. |
|
set
Package set solves exercise 3.10 3-20.
|
Package set solves exercise 3.10 3-20. |
|
stack
Package implements a stack with push, pop and findmin operating in O(1).
|
Package implements a stack with push, pop and findmin operating in O(1). |
|
tree-balance
Package treebalance solves exercise 3.10 3-15.
|
Package treebalance solves exercise 3.10 3-15. |
|
tree-merge
Package treemerge solves exercise 3.10 3-14.
|
Package treemerge solves exercise 3.10 3-14. |
Click to show internal directories.
Click to hide internal directories.