## Reverse every consecutive m elements of the given subarray

Given an array, reverse every group of consecutive m elements in given subarray of it.

Coding made easy

Given an array, reverse every group of consecutive m elements in given subarray of it.

Given an array of integers, find a subset in it that has maximum product of its elements.

Given an unsorted array of integers, print all pairs with given difference k in it without using any extra space.

Given an unsorted array of integers, print all pairs with given difference k in it.

Given an array of integers, duplicates are present in it in such a way that all duplicates appear even number of times except one which appears odd number of times. Find that odd appearing element in linear time and without using any extra memory.

Quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is closely related to the quicksort sorting algorithm.

The longest decreasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, highest to lowest, and in which the subsequence is as long as possible.

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 an unsorted array of integers, find a triplet with given sum in it.