Kadane’s Algorithm: Maximum Product Subarray
Problem Statement: You are given a array with -ve integers. You need to find the subarray with largest product and return the result Example:…
Kadane’s Algorithm: Largest sum increasing contiguous subarray
Problem Statement: You are given a positive integer array. You need to find the largest sum of continuous increasing Example: Input: arr[] =…
Kadane’s Algorithm: minimum size subarray sum
Problem Statement: You are given an array. You need to find the subarray which has the smallest possible sum. Example: Input: arr[] = {1, -2,…
Kadane’s Algorithm: Maximum Product Subarray
Problem Statement: You are given an array with +ve, 0 ad -ve integers. You need to find the maximum product subarray. Example: Input: arr[] =…
Kadane’s Algorithm: Maximum Sum Rectangle In A 2D Matrix
Problem Statement: You are given a 2D matrix, you need to find the maximum sum among all the possible submatrix. Solution Explanation: We can…
Kadane’s Algorithm: Maximum Subarray Sum after removing at most one element
Problem Statement: You are given an array, you need to return the maximum sum of a non empty subarray by removing at most one element.…
Kadane’s Algorithm: Maximum Product Subarray
Problem Statement: Given an array with +ve, -ve and 0, you need to find the maximum product of continuous subarray. Example: Input: arr = [1,…
Kadane’s Algorithm: Maximum Circular Subarray Sum
Problem Statement: You are given a circular array, you need to find the Maximum sum. A circular array allows wrapping from the end to the…
Kadane’s Algorithm: Maximum Subarray Sum
Kadane algorithm introduction Kadane algorithm was introduced by Jay Kadane in 1984. Kadane algorithm uses Dynamic Programming to solve the…
Prefix sum problems: Given bianry array and a value k, return the count of subarray sum
Problem Statement: Given a bianry array and a value k, you need to find the count of sub array sum whose sum is equal to k. Example: Input:…