## 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 »

## Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )

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 »

## Minimize the sum of the squares of the sum of elements of each group the array is divided into

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 »

## Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )

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 »

## Shortest path to traverse all the elements of a circular array in increasing order

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 »

## Make palindromic string non-palindromic by rearranging its letters

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 »

## Array element with minimum sum of absolute differences

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 »

## Minimum operations of given type to make all elements of a matrix equal

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 »

## Divide N segments into two non-empty groups such that given condition is satisfied

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 »

## Sort even and odd placed elements in increasing order

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 »

## Rearrange Odd and Even values in Alternate Fashion in Ascending Order

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 »

## Count distinct elements in an array

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

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 »

## Convert given array to Arithmetic Progression by adding an element

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 »

## Choose n elements such that their mean is maximum

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 »