5:41

Increment An Integer Represented As An Array ("Plus One" on LeetCode)

27:05

Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)

23:12

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

25:31

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

40:18

Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.