We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e0fa2ce commit 011ebebCopy full SHA for 011ebeb
Lecture_Notes/README.md
@@ -10,9 +10,9 @@ Day 02 - [Decompositions of graphs](https://docs.google.com/presentation/d/18KED
10
11
Day 03 - [Paths in graphs](https://docs.google.com/presentation/d/1huX1BkcAbzKjbGMzHpWGfaDpt8aHky5kDqCSztVlQqg/edit?usp=sharing)
12
13
-Day 04 - Greedy algorithms
+Day 04 - [Greedy algorithms](https://docs.google.com/presentation/d/12N8leHLGuWSPYcdQlFUdjcXjm5rl0oIoWvPM_KMTU4c/edit?usp=sharing)
14
15
-Day 05 - Dynamic programming
+Day 05 - [Dynamic programming](https://docs.google.com/presentation/d/13Y4Z5RVfHEE7rh1cOF14EYILA1TKN00YIkZYdgaYyh0/edit?usp=sharing)
16
17
Day 06 - Linear programming and reductions
18
0 commit comments