Dynamic Programming ProblemsThis is arrays page Largest sum continuos subarrayGiven a zero index array find the sum of contiguos subarray which has the largest sum. Time-complexity: O(n) Auxiliary space: O(1) Largest product continuos subarrayGiven a zero index array find the product of contiguos subarray which has the largest product. Time-complexity: O(n) Auxiliary space: O(1)
Largest sum continuos subarrayGiven a zero index array find the sum of contiguos subarray which has the largest sum. Time-complexity: O(n) Auxiliary space: O(1)
Largest product continuos subarrayGiven a zero index array find the product of contiguos subarray which has the largest product. Time-complexity: O(n) Auxiliary space: O(1)