[MEDIUM] Subset Sum [Recursion][Dynamic Programing] - YouTube Objective: The maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum. Dynamic Programming Extremely general algorithm design technique Similar to divide & conquer: I Build up the answer from smaller subproblems I More general than \simple" divide & conquer I Also more powerful Generally applies to algorithms where the brute force … Dynamic programming can solve this problem by saving subproblem solutions in memory rather than computing them again and again. int partition3(vector
