Add References for Dynamic Programming

Author: LyangHiga

dynamic-programming/README.md

@@ -0,0 +1,22 @@
+# References
+
+I used a lot of references for each problem, in this section I will try to point the ones that were the most useful for me.
+
+- Weighted Interval Scheduling
+  - [Algorithm Design 1st Edition](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)
+- Weighted Independent Sets in Path Graphs
+  - [Weighted Independent Sets in Path Graphs Lectures](https://www.coursera.org/learn/algorithms-greedy/lecture/WENc1/introduction-weighted-independent-sets-in-path-graphs)
+- Knapsack Problem
+  - [Introduction to Algorithms, 3rd Edition](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844)
+  - [Knapsack Problem Lectures](https://www.coursera.org/learn/algorithms-greedy/lecture/LIgLJ/the-knapsack-problem)
+- Sequence Alignment
+  - [Sequence Alignment Lectures](https://www.coursera.org/learn/algorithms-greedy/lecture/QJkyp/optimal-substructure)
+  - [Algorithm Design 1st Edition](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)
+- Bellman-Ford
+  - [Bellman-Ford Lectures](https://www.coursera.org/learn/algorithms-npcomplete/lecture/g8N36/optimal-substructure)
+  - [Algorithm Design 1st Edition](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)
+  - [Introduction to Algorithms, 3rd Edition](https://en.wikipedia.org/wiki/Introduction_to_Algorithms)
+- Floyd-Warshall
+  - [Floyd-Warshall Lectures](https://www.coursera.org/learn/algorithms-npcomplete/lecture/3BBkw/optimal-substructure)
+  - [Algorithm Design 1st Edition](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)
+  - [Introduction to Algorithms, 3rd Edition](https://en.wikipedia.org/wiki/Introduction_to_Algorithms)