## Find subarray having given sum in given array of integers

Given an array of integers, find a sub-array having given sum in it.

Read More Find subarray having given sum in given array of integersCoding made easy

Given an array of integers, find a sub-array having given sum in it.

Read More Find subarray having given sum in given array of integersGiven an array of integers, find largest sub-array formed by consecutive integers. The sub-array should contain all distinct values.

Read More Find largest sub-array formed by consecutive integersGiven a limited range array of size n where array contains elements between 1 to n-1 with one element repeating, find the duplicate number in it.

Read More Find a duplicate element in a limited range arrayGiven an binary array containing 0 and 1, find maximum length sub-array having equal number of 0’s and 1’s.

Read More Find maximum length sub-array having equal number of 0’s and 1’sGiven an array of integers, find maximum length sub-array having given sum.

Read More Find maximum length sub-array having given sumGiven an array of integers, check if array contains a sub-array having 0 sum. Also, prints end-points of all such sub-arrays.

Read More Find sub-array with 0 sumGiven an array of integers containing duplicates, return the majority element in an array if present. A majority element appears more than n/2 times where n is the size of the array.

Read More Find majority element in an array (Boyer–Moore majority vote algorithm)Given an array of integers, in-place shuffle it. The algorithm should produce an unbiased permutation i.e. every permutation is equally likely.

Read More Shuffle a given array of elements (Fisher–Yates shuffle)Given an unsorted array of integers, find a pair with given sum in it .

Read More Find pair with given sum in the arrayGiven an array of integers, rearrange the array such that every second element of the array is greater than its left and right elements. Assume no duplicate elements are present in the array.

Read More Rearrange the array with alternate high and low elementsGiven a binary tree, print all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes 45 degree angle with the parent.

Read More Print Diagonal Traversal of Binary TreeGiven a binary tree, calculate sum of all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes 45 degree angle with the parent.

Read More Find the diagonal sum of given binary treeGiven a binary tree, perform vertical traversal of it. In vertical traversal, we print nodes of a binary tree in vertical order by assuming that the left and right child of a node makes 45 degree angle with the parent.

Read More Print nodes in vertical order of a given Binary Tree (Vertical Traversal)Given a binary tree, print vertical sum of it. Assume, the left and right child of a node makes 45 degree angle with the parent.

Read More Find Vertical Sum in a given Binary Tree