## Longest Alternating Subarray Problem网上棋牌平

Longest Alternating Subarray is a problem of finding a subarray with alternating positive and negative elements, and in which the subarray is as long as possible.

## Reverse specified portion of a Linked List网上棋牌平

Write an efficient algorithm to reverse the specified portion of a given linked list.

^{}

## Find longest subsequence formed by consecutive integers网上棋牌平

Given an array of integers, find the length of longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values and the character set should be consecutive, irrespective of its order.

^{}

## Find duplicates within given range k in an array网上棋牌平

Given an array and a positive number k, check whether the array contains any duplicate elements within range k. If k is more than size of the array, the solution should check for duplicates in the complete array.

## Invert alternate levels of a perfect binary tree网上棋牌平

Write an efficient algorithm to invert alternate levels of a perfect binary tree.

^{}

## Construct a binary tree from inorder and level order sequence网上棋牌平

Write an efficient algorithm to construct a binary tree from given inorder and level-order sequence.

## Find minimum number of deletions required to convert a string into palindrome网上棋牌平

Given a string, find minimum number of deletions required to convert it into a palindrome.

## Find minimum range with at-least one element from each of the given arrays网上棋牌平

^{}

Given three sorted arrays of variable length, efficiently compute the minimum range with at-least one element from each of the arrays.

## Update random pointer for each linked list node to point to the maximum node网上棋牌平

Given a linked list with each node having an additional random pointer which points to any random node of the linked list or null, update the random pointer in each linked list node to point to node with maximum value to their right.

^{}

## Find all elements in an array that are greater than all elements present to their right网上棋牌平

Given an unsorted array of integers, print all elements which are greater than all elements present to its right.