Searching and Sorting: Count all distinct pairs with difference equal to k
Problem Statement: You are given an unsorted array, and an integer K. You need to get all distinct pairs with difference equal to k. Example…
Searching and Sorting: Search an array where adjacent differ by at most k
Problem Statement: You are given an array and has a difference of atmost k. Given a key ‘x’, we need to find the index value of…
Searching and Sorting: Maximum and minimum of an array using minimum number of comparisons
Problem Statement: You are given an unsorted array, you need to get the maximum and minimum element of the array using minimum comparisons.…
Searching and Sorting: Get the fixed point in an array
Problem Statement: You are given an sorted ascending array, you need to find the fixed point. A fixed point is an element in the array, such…
Strings: Recursively print all sentences that can be formed from list of word lists
Problem Statement: You are given list of words, you need to print all the combinations of phrases that can be formed by picking one word from…
Strings: Find minimum operations required to transform a string into another string
Problem Statement: You are given 2 strings, you need to convert str1 to str2 by only moving a character from str1 to front. If the string can…
Strings: Remove all consecutive duplicates from the string
Problem Statement: You are given a string S, you have to remove all the consecutive string. Example Input: aabb Output: ab Solution The…
Strings: Minimum Window Substring
Problem Statement: You are given 2 strings s1 and s2. You need to find the smallest substring in s1 that has all the characters of s2. Example…
Minimum characters to be added at beginning to make string palindrome
Problem Statement: You are given a string, you need to tell minimum characters to be added at the beginning to make the string palindrome.…
Strings: Check if it is possible to re-arrange characters in a string, such a way that no two adjacent are same
Problem Statement: You are given a string, you need to check if ti is possible to rearrange the string such that no two adjacent characters…