Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an integer array, rearrange it such that it contains positive and negative numbers at alternate positions. If the array contains more positive or negative elements, move them to the end of the array.
Given an unsorted integer array, print all triplets in it with a sum less than or equal to a given number.
Given a sorted integer array, find a pair in it having an absolute minimum sum.
Given an array of n integers where every element appears an even number of times except one element, which appears an odd number of times, find that odd occurring element in logarithmic time and constant space.
Given two strings, determine if the first string can be transformed into the second string. The only operation allowed is moving a character from the first string to the front. If the string can be transformed, find the minimum number of operations required for the transformation.
In this post, we will see how to find all lexicographic permutations of a string where the repetition of characters is allowed.
Given a set S, generate all distinct subsets of it, i.e., find a distinct power set of set S. A power set of any set S is the set of all subsets of S, including the empty set and S itself.
This post will sort an integer array using the iterative merge sort algorithm. Merge sort is an efficient sorting algorithm that falls under the Divide and Conquer paradigm and produces a stable sort.
Given an integer array, find all distinct combinations of a given length k. The program should print only distinct combinations.
Given an unsorted integer array, find all pairs with a given difference k in it without using any extra space.
Given an unsorted integer array, print all pairs with a given difference k in it.
Given an unsorted integer array, print all distinct four elements tuple (quadruplets) in it, having a given sum.