Maximum Product Subset Problem
Given an integer array, find a subset in it having the maximum product of its elements.
Category: Array
Find pairs with difference `k` in an array | Constant Space Solution
Given an unsorted integer array, find all pairs with a given difference k in it without using any extra space.
Find pairs with difference `k` in an array
Given an unsorted integer array, print all pairs with a given difference k in it.
Find the frequency of each element in a sorted array containing duplicates
Given a sorted array containing duplicates, efficiently find each element’s frequency without traversing the whole array.
Determine the index of an element that satisfies given constraints in an array
Given an integer array, determine the index of an element before which all elements are smaller and after which all are greater.
Find the odd occurring element in an array in a single traversal
Given an integer array, duplicates are present in it in a way that all duplicates appear an even number of times except one which appears an odd number of times. Find that odd appearing element in linear time and without using any extra memory.
Quickselect Algorithm
Quickselect is a selection algorithm to find the k’th smallest element in an unordered list. It is closely related to the Quicksort sorting algorithm. Like Quicksort, it is efficient traditionally and offers good average-case performance, but has a poor worst-case performance.
Longest Decreasing Subsequence Problem
The longest decreasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, highest to lowest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
Find maximum profit earned from at most two stock transactions
Given a list containing future predictions of share prices, find the maximum profit earned by buying and selling shares at most twice with a constraint that a new transaction can only start after the previous transaction complete, i.e., we can only hold at most one share at a time.
Find maximum profit earned from at most `k` stock transactions
Given a list containing future predictions of share prices, find the maximum profit earned by buying and selling shares at most k times with a constraint that a new transaction can only start after the previous transaction is complete, i.e., we can only hold at most one share at a time.
Print all quadruplets with a given sum | 4 sum problem extended
Given an unsorted integer array, print all distinct four elements tuple (quadruplets) in it, having a given sum.
4–Sum Problem | Quadruplets with a given sum
4-sum problem: Given an unsorted integer array, check if it contains four elements tuple (quadruplets) having a given sum.