Problema da Mochila:
- https://neps.academy/lesson/162
- https://brilliant.org/wiki/backpack-problem/
- https://medium.com/@fabianterh/how-to-solve-the-knapsack-problem-with-dynamic-programming-eb88c706d3cf
- https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/
- https://b-ok.lat/book/2100405/ed1a67
Maior Subsequência Comum
- https://neps.academy/lesson/164
- https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/
- https://www.geeksforgeeks.org/printing-longest-common-subsequence/
- https://1drv.ms/b/s!AuP7CSPKD7NSiRkE9tm2KX0ORcqi?e=F67M7z
- https://www.cs.usfca.edu/~galles/visualization/DPLCS.html
- https://www.radford.edu/~nokie/classes/360/dp-longest-common-subseq.html
- https://www.ime.usp.br/~pf/analise_de_algoritmos/aulas/sscm.html
Troco
- https://neps.academy/lesson/167
- http://www.ccs.neu.edu/home/jaa/CS7800.12F/Information/Handouts/dyn_prog.pdf
- https://www.geeksforgeeks.org/coin-change-dp-7/
- https://runestone.academy/runestone/books/published/pythonds/Recursion/DynamicProgramming.html
- https://algorithms.tutorialhorizon.com/category/dynamic-programming/
- https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/
- https://www.ime.unicamp.br/~andreani/MS515/capitulo7.pdf
Menor Ancestral Comum
- https://neps.academy/lesson/199
- https://www.linux.ime.usp.br/~cef/mac499-05/monografias/daniel/poster.pdf
- https://www.cin.ufpe.br/~tg/2019-1/TG_CC/tg_dcc4.pdf
- https://cp-algorithms.com/graph/lca.html
- https://www.topcoder.com/community/competitive-programming/tutorials/range-minimum-query-and-lowest-common-ancestor/
- https://www.youtube.com/watch?v=kOfa6t8WnbI
- https://www.youtube.com/watch?v=EKcQt-74bNw
- https://www.geeksforgeeks.org/lca-for-general-or-n-ary-trees-sparse-matrix-dp-approach-onlogn-ologn/
- https://www.geeksforgeeks.org/lca-in-a-tree-using-binary-lifting-technique/
- https://www.hackerrank.com/topics/lowest-common-ancestor