## Convert Min Heap to Max Heap in O(n) time

Given an array representing a Min Heap, convert Min Heap into a Max Heap. The conversion should be done inplace and in linear time.

Coding made easy

Given an array representing a Min Heap, convert Min Heap into a Max Heap. The conversion should be done inplace and in linear time.

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 two integers, add their binary representation.

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

Given a square matrix, rotate the matrix by 180 degrees in clock-wise direction. The transformation should be done in-place in quadratic time.

Given a sorted array containing duplicates, efficiently find frequency of each element in it without traversing the whole array.

Given a number, find out if it is even or odd without using any conditional statement (if-else) or ternary operator.

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.