Find the lexicographical next balanced bracket sequence
Given a balanced bracket sequence as a string str containing character ‘(‘ or ‘)’, the task is to find the next lexicographical order balanced sequence… Read More »
Category Archives: Greedy
Maximum possible sub-array sum after at most X swaps
Given an array arr[] of N integers and an integer X, the task is to find the maximum possible sub-array sum after applying at most… Read More »
Greedy approach vs Dynamic programming
A Greedy algorithm is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious… Read More »
Minimum number of pairs required to make two strings same
Given two strings s1 and s2 of same length, the task is to count the minimum number of pairs of characters (c1, c2) such that… Read More »
Find the largest interval that contains exactly one of the given N integers.
Given an array arr[] of N distinct integers, the task is to find the maximum elements in an interval [L, R] such that the interval… Read More »
Maximize the size of array by deleting exactly k sub-arrays to make array prime
Given an array arr[] of N positive integers and a non negative integer K. The task is to delete exactly K sub-arrays from the array… Read More »
Generate an array of K elements such that sum of elements is N and the condition a[i] < a[i+1] <= 2*a[i] is met | Set 2
Given two integers N and K, the task is to generate an array arr[] of length K such that: arr[0] + arr[1] + … +… Read More »
Maximum number that can be display on Seven Segment Display using N segments
Given a positive integer N. The task is to find the maximum number that can be displayed on seven segment display using N segments. Seven… Read More »
Generate an array of size K which satisfies the given conditions
Given two integers N and K, the task is to generate an array arr[] of length K such that: arr[0] + arr[1] + … +… Read More »
Check if it is possible to make two martices strictly increasing by swapping corresponding values only
Given two n * m matrices A[][] and B[][], the task is to make both the matrices strictly increasing (both rows and columns) only by… Read More »
Minimum number of given operations required to reduce the array to 0 element
Given an array arr[] of N integers. The task is to find the minimum number of given operations required to reduce the array to 0… Read More »
Smallest multiple of N formed using the given set of digits
Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »
Count number of subsets whose median is also present in the same subset
Given an array arr[] of size N, the task is to count the number of ways we can select a subset from the given array… Read More »
Maximize the given number by replacing a segment of digits with the alternate digits given
Given a large number of N digits. We are also given with 10 numbers which represents the alternate number for all the one-digit numbers from… Read More »
Minimizing array sum by applying XOR operation on all elements of the array
Given an array arr[] of N integer elements, the task is to choose an element X and apply XOR operation on every element of the… Read More »
