Print continuous subarray with maximum sum
Given an integer array, find and print a contiguous subarray with the maximum sum in it.
Category: Array
Check if a subarray with 0 sum exists or not
Given an integer array, check if it contains a subarray having zero-sum.
Find all combinations of elements satisfying given constraints
Given a positive number n, find all combinations of 2×n elements such that every element from 1 to n appears exactly twice and the distance between its two appearances is exactly equal to the value of the element.
Find maximum length sequence of continuous ones
Given a binary array, find the index of 0 to be replaced with 1 to get a maximum length sequence of continuous ones.
Find two duplicate elements in a limited range array (using XOR)
Given an integer array with all its elements between 1 and n except two elements, which occur twice. Find two duplicate elements without using any extra memory in linear time.
Maximum Product Subarray Problem
Given an integer array, find the maximum product subarray. In other words, find a subarray that has the maximum product of its elements.
Longest Increasing Subsequence Problem
The Longest Increasing Subsequence (LIS) problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
Find maximum profit earned by buying and selling shares any number of times
Given a list containing future prediction of share prices, find the maximum profit earned by buying and selling shares any number of times with the constraint, a new transaction can only start after the previous transaction is complete.
Trapping Rain Water Problem
Trapping rainwater problem: Find the maximum amount of water that can be trapped within a given set of bars where each bar’s width is 1 unit.
Find minimum platforms needed to avoid delay in the train arrival
Given a schedule containing the arrival and departure time of trains in a station, find the minimum number of platforms needed to avoid delay in any train’s arrival.
Find the maximum sum of a subsequence with no adjacent elements
Given an integer array, find the maximum sum of subsequence where the subsequence contains no adjacent elements.
Merging Overlapping Intervals
Given a set of intervals, print all non-overlapping intervals after merging the overlapping intervals.