# Homework 12 - Greedy algorithms and Dynamic Programming

Lägg alla problem i ett github repository som heter kth-id-hw12

# Kattisproblem
[Bank](https://open.kattis.com/problems/bank)
[Train sorting](https://open.kattis.com/problems/trainsorting)

Lös **minst ett** av:
[Change making problem](https://open.kattis.com/problems/exactchange2)
[Classrooms](https://open.kattis.com/problems/classrooms)
[Jimmy Bond](https://open.kattis.com/problems/bond)
[Entertainment box](https://open.kattis.com/problems/entertainmentbox)

Och **minst ett** av:
[Orders](https://open.kattis.com/problems/orders)
[Joggers](https://open.kattis.com/problems/joggers)
[Ambush](https://open.kattis.com/problems/ambush) *svår*
[Nested dolls](https://open.kattis.com/problems/nesteddolls) *svår*

## Rekomenderad läsning
* [Slides](https://docs.google.com/presentation/d/1Ig6Is5iWSYx9WZhYXIHSZt5NPvGND-N2WtpFeAJNogA/edit?usp=sharing)
* [Principles of Algorithmic Problem Solving (kapitel 9)](https://www.csc.kth.se/~jsannemo/slask/main.pdf)