Algorithms · Dynamic Programming
Store computed Fibonacci numbers and reuse them for later terms.
Find a longest increasing subsequence while preserving original element order.
