## Remove duplicates from a linked list

Given a linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.

Coding made easy

Given a linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.

Given an unsorted array of integers, find a triplet with given sum in it.

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

Given an array of integers, find largest sub-array formed by consecutive integers. The sub-array should contain all distinct values.

Given 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.

Given an binary array containing 0 and 1, find maximum length sub-array having equal number of 0’s and 1’s.

Given an array of integers, find maximum length sub-array having given sum.

Given an array of integers, check if array contains a sub-array having 0 sum. Also, prints end-points of all such sub-arrays.

Given 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.

Given an array of integers, in-place shuffle it. The algorithm should produce an unbiased permutation i.e. every permutation is equally likely.

Given an unsorted array of integers, find a pair with given sum in it .

Given 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.

Given 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.

Given 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.