Find the missing number, frequency of elements

Maximum sum, no two elements are adjacent

Sort an array of 0's and 1's

Sort an array of 0's, 1's and 2's

Product Array Puzzle
Print Product of all array except arr[i].
without using "/" and in O(n)

Median in a Stream of integers

Min length Unsorted Array, sorting which make the array sorted

Form Min No for given Sequence
I = 12
D = 21
ID = 132

Count all pair with sum K

Minimum no of Steps in Infinite Grid
|_|_|_|
|_|_|_|
|_|_|_|
(0,0)--> (1,1)=1 step. Can move in 8 dirs