Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedQuicksort exhibits poor performance for inputs that contain many repeated elements. The problem is visible when all the input elements are equal. In this post, we will implement Quicksort efficiently for inputs containing many repeated elements.
This post will discuss how to find permutations of a string using iteration. The implementation should be able to handle strings with duplicate characters and don’t repeat the permutations.
Lexicographic sorting: Given a set of strings, print them in lexicographic order (dictionary/alphabetical order).
Quicksort performance can be boosted in several ways. In this post, we will cover a few of them.
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
Given a schedule containing the arrival and departure time of trains in a station, find the minimum number of platforms needed to avoid delay in any train’s arrival.
Given a set of intervals, print all non-overlapping intervals after merging the overlapping intervals.
Given an integer array, find the smallest window sorting which will make the entire array sorted in increasing order.
Find the largest number possible from a set of given numbers where the numbers append to each other in any order to form the largest number.
Given an integer array, find all distinct combinations of a given length k, where the repetition of elements is allowed.
Given an integer array, find all distinct combinations of a given length k. The program should print only distinct combinations.
Given an integer array, find the maximum product of two integers in it. For example, consider array {-10, -3, 5, 6, -2}. The maximum product is the (-10, -3) or (5, 6) pair.