Find all increasing subsequences of an array
Given an integer array, find all distinct increasing subsequences of length two or more.
Category: Array
Insert an interval by merging overlapping intervals
Insert the specified interval into a collection of non-overlapping intervals that has been organized by the start time of each interval. If the new interval causes intervals to overlap, merge the overlapped intervals.
Find all duplicate elements in a limited range array
Find the duplicate numbers in an integer array of size n that contains elements between 1 and n, at least one of which repeats.
Count distinct permutations of an array that sums to a target
Given an array of distinct positive integers, find the total number of distinct permutations that add up to a given target, where each array element may be used any number of times.
Count quadruplets with a zero sum
Given four integer arrays, count the number of quadruplets with a zero sum, including exactly one element from each array.
Find all distinct combinations of a given length that sum to a target
Given a positive integer n and a target, find all combinations of distinct numbers in the interval [1,9] of length n that add up to the target.
Longest Alternating Subsequence Problem – II
Given an integer array, find the length of the longest subsequence with alternate low and high elements in the array.
Shrink an array by removing triplets that satisfy given constraints
Given an integer array, shrink it by removing adjacent triplets that satisfy the given constraints and return the total number of elements in the resultant array.
Find the minimum number of merge operations to make an array palindrome
Given a list of non-negative integers, find the minimum number of merge operations to make it a palindrome. A merge operation can only be performed on two adjacent elements and replace them with their sum.
Find read-write conflicts among given database transactions
Given a list of database transactions, find all read-write conflicts among them. Assume that there is no strict two-phase locking (Strict 2PL) protocol to prevent read-write conflicts.
Find height of a binary tree represented by the parent array
Given an array representing the parent-child relationship in a binary tree, find the tree’s height without building it. The parent-child relationship is defined by (A[i], i) for every index i in array A.
Determine whether a BST is skewed from its preorder traversal
Given an array representing the preorder traversal of a BST, determine whether it represents a skewed BST or not. In a skewed BST, each node’s descendants are either smaller or larger than the node itself.