You are given a rod of length N units along with an array that contains the prices of all pieces of size smaller than N

# Category: Practice Problems

Practice Problems related to technical Interviews

## Maximum Sum SubArray – Kadane’s Algorithm (DP-01)

Given an array which can contain both positive and negative integers, find the length of the subarray which has the maximum sum. Sample Input: [