CSE201, Winter 2025, Lec 14: More divide and conquer, the maximum subarray product problem
C. Seshadhri · 89:35
This lecture walks through the classic "maximum product subarray" problem as a live demonstration of algorithmic method: start with a brute-force solution, then improve it step by step using dynamic-programming-style...