Two Pointers : Move all negative numbers to beginning and positive to end using extra space
Problem Statement: You are given an array with +ve and -ve numbers in random order. You need to re arrange the elements that all -ve elements…
Two Pointers: Given an array and a value “m”, choose “m” elements having minimum difference between max and min
Problem Statement: You are given an array and a value “m”. You need to pick exactly m elements such that the difference between…
Greedy: Given a string, check if it is a valid parenthesis or not
Problem Statement: You are given a string having only “(“, “)”, “*”. Return true if its a valid…
Greedy: Given a string, return the length of longest palindrome
Problem Statement: Given a string, return the length of longest palindrome substring that can be constructed with those letters Palindrome are…
Greedy: Given a number and a value k, return the smallest digit after removing k digits
Problem Statement: Given a number and a value k, return the smallest digit after removing k digits Example: Input: num = "12345" k =…
Greedy: Given an array and a value k, check if we can have k consecutive numbers
Problem Statement: Given an array and a value k, check if we can have k consecutive numbers Example: Input: arr = [1, 2, 3, 4, 5, 6, 7, 8] k =…
Greedy: Get the maximum number by swapping once
Problem Statement: Given a number, you need to swap 2 digits to make the maximum value of the number. Example: Input num = 1234 Output: 4231…
Greedy: Check if a given string becomes palindrome by deleting atmost one char
Problem Statement: You are given a string and you need to return true if the string is palindrome, by deleting at most one character. Example:…
Greedy: Given an array, find the longest alternative subsequence
Problem Statement: You are given an array, you need to find the longest alternative sub-sequence. Alternative sub-sequence is a sequence where…
Greedy: Given a string, partition the string such that each letter appears at only one part
Problem Statement: You are given a string, you need to partition in such a way that each letter appears at most one part. Example: Input str =…