Count all subsequences having product less than K

The problem “Count all subsequences having product less than K” states that you are given an array of integers. Now find the number of subsequences that have a product less than a given input K. Example a[] = {1, 2, 3, 4, 5} k = 8 Number of subsequences less …

Read moreCount all subsequences having product less than K

Minimum insertions to form a palindrome with permutations allowed

The problem “Minimum insertions to form a palindrome with permutations allowed” states that you are given a String with all letters in lowercase. The problem statement asks to find out the minimum insertion of a character to a string that it can become Palindrome. The position of characters can be …

Read moreMinimum insertions to form a palindrome with permutations allowed

LCS (Longest Common Subsequence) of three strings

The problem “LCS (Longest Common Subsequence) of three strings” states that you are given 3 strings. Find out the longest common subsequence of these 3 strings. LCS is the string that is common among the 3 strings and is made of characters having the same order in all of the …

Read moreLCS (Longest Common Subsequence) of three strings

Sequences of given length where every element is more than or equal to twice of previous

The problem “Sequences of given length where every element is more than or equal to twice of previous” provides us with two integers m and n. Here m is the largest number that can exist in the sequence and n is the number of elements that must be present in the …

Read moreSequences of given length where every element is more than or equal to twice of previous

Find maximum length Snake sequence

The problem “Find maximum length Snake sequence” states that we are provided with a grid containing integers. The task is to find a snake sequence with the maximum length. A sequence having adjacent numbers in the grid with an absolute difference of 1, is known as a Snake sequence. Adjacent …

Read moreFind maximum length Snake sequence

Count ways to reach the nth stair using step 1, 2 or 3

The problem “Count ways to reach the nth stair using step 1, 2, or 3” states that you are standing on the ground. Now you need to reach the end of the staircase. So how many ways are there to reach the end if you can jump only 1, 2, …

Read moreCount ways to reach the nth stair using step 1, 2 or 3

Range Queries for Longest Correct Bracket Subsequence

You are given a sequence of some brackets subsequence, in other words, you are given brackets like ‘(’ and ‘)’ and you are given a query range as a starting point and ending point. The problem “Range Queries for Longest Correct Bracket Subsequence” asks to find out the maximum length …

Read moreRange Queries for Longest Correct Bracket Subsequence

Longest Bitonic Subsequence

Suppose you have an array of integers, the problem statement asks to find out the longest bitonic subsequence. The bitonic sequence of an array is considered as the sequence which first increases and then decreases. Example arr[] = {1,4,2,76,43,78,54,32,1,56,23} 7 Explanation 1 ⇒ 4 ⇒ 76 ⇒ 78 ⇒ 54 …

Read moreLongest Bitonic Subsequence

Difference Array | Range update query in O(1)

You are given an integer array and two types of queries, one is to add a given number in a range and the other to print the whole array. The problem “Difference Array | Range update query in O(1)” requires us to perform the range updates in O(1). Example arr[] …

Read moreDifference Array | Range update query in O(1)