Given array a, find the contiguous subarray with the largest sum.
Compute the nth Fibonacci number efficiently.
You can climb 1 or 2 steps. How many distinct ways to climb n stairs?
Max amount you can rob without robbing two adjacent houses.
Given coin denominations and a target, find minimum coins needed.
Find the length of the longest strictly increasing subsequence.
Maximize value in a knapsack of capacity W, each item used at most once.
Find path from top-left to bottom-right minimizing sum. Move only right or down.
Minimum operations (insert, delete, replace) to convert word1 into word2.
Count ways to decode a digit string into letters (A=1, B=2, ..., Z=26).
Given an m×n grid, count the number of unique paths from top-left to bottom-right (only move right or down).
Given two strings, find the length of their longest common subsequence.
Given two words, find the minimum number of operations (insert, delete, replace) to convert one to the other.
Given strings s1, s2, s3, determine if s3 is formed by interleaving s1 and s2.