Greedy: Check for Increasing triplet subsequence
Problem Statement: You are given an array, you need to return true, if there is triplet in increasing subsequence. Example: Input: arr = [1,…
Greedy: Replace the integer to 1 by following given conditions
Problem Statement: You are given a number, you need to apply below operations: 1. If n is even, then replace n with n/2 2. If n is odd, then…
Greedy: Reorganize String
Problem Statement: You are given a string, you need to re-arrange the staring such that no two adjacent characters are not the same. Example:…
Greedy: Insert new interval
Problem Statement: You are given set of non overlapping interval. You are given a new interval. You need to insert the new interval and the…
Greedy: Minimum swaps to make strings equal
Problem Statement: You are given 2 strings, s1 and s2 of same size of letter x and y. You need make both of the strings equal by swapping any…
Greedy: Non overlapping intervals
Problem Statement: You are given a 2D array which represents interval. You need to find the minimum number of interval need to be removed to…
Greedy: Given three stacks, you need to find maximum equal sum
Problem Statement: You are given 3 stacks s1, s2, s3. You need to find the maximum possible equal sum that can be achieved by removing from…
Greedy: Assign maximum cookies
Problem Statement: You are given 2 arrays, greed[] and cookie[]. greed[i] is the minimum cookie size wanted by ith child. cookie[i] is the…
Greedy: Assign holes to mice
Problem Statement: You are given 2 arrays one for mice and one for hole. There are N mice and N holes and placed in a straight line. Each hole…
Greedy: Maximum odd binary number
Problem Statement: You are given a string, that has atleast one. Re-arrange the bits so that the number is the odd binary number and is the…