## Print k different sorted permutations of a given array

Given an array arr[] containing N integers, the task is to print k different permutations of indices such that the values at those indices form… Read More »

- Count distinct elements in an array
- Print the nodes of binary tree as they become the leaf node
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Sort the array of strings according to alphabetical order defined by another string
- In-Place Merge Sort
- Ternary Search
- Number of pairs whose sum is a power of 2
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Minimum Increment / decrement to make array elements equal
- Smallest subarray containing minimum and maximum values
- Check if array can be sorted with one swap
- Find closest value for every element in array
- Check if it is possible to sort the array after rotating it
- Print array elements in alternatively increasing and decreasing order
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Internal details of std::sort() in C++
- Sort the array in a given index range
- Maximum sum by picking elements from two arrays in order
- Array element with minimum sum of absolute differences
- Sort only non-prime numbers of an array in increasing order
- Check if the characters of a given string are in alphabetical order
- Largest element in the array that is repeated exactly k times
- Sort an array of string of dates in ascending order
- Average of remaining elements after removing K largest and K smallest elements from array
- K-th lexicographically smallest unique substring of a given string
- Python | Sort list of list by specified index
- Check if words are sorted according to new order of alphabets
- Minimum number of bottles required to fill K glasses
- Make palindromic string non-palindromic by rearranging its letters
- Rearrange an array to maximize i*arr[i]

Given an array arr[] containing N integers, the task is to print k different permutations of indices such that the values at those indices form… Read More »

Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted. Examples: Input : {{3,… Read More »

Given an array consisting of even number of elements, the task is to divide the array into M group of elements (every group must contain… Read More »

Giving k sorted arrays, each of size N, the task is to merge them into a single sorted array. Examples: Input : arr[][] = {{5,… Read More »

There are N distinct integers arranged on a circle. The distance between any two adjacent numbers is 1. The task is to travel on this… Read More »

Given a string str containing lowercase alphabets (a – z). The task is to print the string after rearranging some characters such that the string… Read More »

Given an array arr[] of N integers, the task is to find an element x from the array such that |arr[0] – x| + |arr[1]… Read More »

Given an integer K and a matrix of N rows and M columns, the task is to find the minimum number of operations required to… Read More »

Given N segments (or ranges) represented by two non-negative integers L and R. Divide these segments into two non-empty groups such that there are no… Read More »

Given a list N, the task is to sort all the elements at odd and even positions in increasing order. After sorting, we need to… Read More »

Given an array of integers (both odd and even), the task is to arrange them in such a way that odd and even values come… Read More »

Given an unsorted array, count all distinct elements in it. Examples: Input : arr[] = {10, 20, 20, 10, 30, 10} Output : 3 There… Read More »

Ternary search is a divide and conquer algorithm that can be used to find an element in an array. It is similar to binary search… Read More »

Given an array arr[], the task is to find an element that can be added to the array in order to convert it to Arithmetic… Read More »

Given an array of 2 * n elements, the task is to construct and print an array of n element such that the mean of… Read More »