Given an array of pairs of integers, find all symmetric pairs i.e. pairs that are mirror of each other. For instance, pairs (x, y) and (y, x) are mirrors of each other.
Write a efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.
Given an array and an integer k, find the count of distinct elements in every sub-array of size k in the array.
Given a string and a pattern (having all distinct characters), determine if characters of the string follows specific order as defined by characters of the pattern.
Given an array of integers between 0 to 9, find two numbers with maximum sum formed by using all digits of the array. The difference in number of digits of the two numbers should be ± 1.
Given an array of integers, print all maximum size sub-arrays having all distinct elements in them.
Write a program to count number of ways to calculate a target number from elements of specified array by using only addition and subtraction operator.
Given an array of integers, find minimum index of a repeating element in linear time and doing just one traversal of the array.
Given a collection of integers, develop an algorithm to find the index of maximum occurring element with equal probability.
Given an array of integers, check if an array is formed by consecutive integers.
Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.
Given a binary tree, write an efficient algorithm to print right view of given binary tree.