Given a linear equation of k variables, count total number of possible solutions of it.
Given a binary tree, write an efficient algorithm to invert binary tree.
Given an array of integers, find a subset in it that has maximum product of its elements.
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, check if it contains four elements tuple (Quadruplets) having given sum.
Find all N-digit numbers with equal sum. N varies from [1 to 9] and sum < = 81 (Maximum possible sum in a 9-digit number)
Convert a given binary tree to BST (Binary Search Tree) by keeping original structure of the binary tree intact.
Implement Quicksort algorithm using Hoare’s Partitioning scheme.
Given a normal binary tree, convert it to Left-child right-sibling (LC-RS) binary tree.
Given an unsorted array of integers, find a triplet with given sum in it.
Implement Quicksort efficiently for inputs containing many repeated elements.