You are given two strings X and Y with lengths m and n. You need to find the length of the longest common substring. Sample

# Category: DP

## Rod cutting problem (DP-02)

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

## 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: [