Given an unsorted array of integers, print all distinct four elements tuple (Quadruplets) in it having given sum.
Given an unsorted array of integers, check if it contains four elements tuple (Quadruplets) having given sum.
Given an array where all its elements are sorted except two elements which were swapped, sort the array in linear time. Assume there are no duplicates in the array.
Implement Quicksort algorithm using Hoare’s Partitioning scheme.
Given M sorted lists of variable length, print them in sorted order efficiently.
Implement Quicksort efficiently for inputs containing many repeated elements.
Given a schedule containing arrival and departure time of trains in a station, find minimum number of platforms needed in the station so to avoid any delay in arrival of any train.
Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.
Given an array of integers, find the smallest window in array sorting which will make the entire array sorted in increasing order.
Find largest number possible from set of given numbers. The numbers should be appended to each other in any order to form the largest number.
Given an array of integers, find all distinct combinations of given length where repetition of elements is allowed.
Given an array of integers, find all distinct combinations of given length.