Given a binary tree, write an efficient algorithm to compute maximum width of it.
Given a square matrix, print maximum length snake sequence in it. A Snake sequence is defined as a sequence of numbers where each new number, which can only be located to the right or down of the current number, is either plus or minus one.
In k-partition problem, we need to partition an array of positive integers into k disjoint subsets that all have equal sum and they completely covers the set.
3-partition problem: Given a set S of positive integers, determine if it can be partitioned into three disjoint subsets that all have same sum and they cover S.
Given a positive integer N, find all N-digit binary numbers having more 1’s than 0’s for any prefix of the number.
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 representing a Min Heap, convert Min Heap into a Max Heap. The conversion should be done inplace and in linear time.
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.