25:31

Subsequência Comum Mais Longa (2 Strings) - Programação Dinâmica e Subproblemas Concorrentes

17:20

The Ultimate Big O Notation Tutorial (Time & Space Complexity For Algorithms)

20:30

The 0/1 Knapsack Problem (Demystifying Dynamic Programming)

19:38

Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)

23:12

The Change Making Problem - Fewest Coins To Make Change Dynamic Programming