Arrays

1

Find the Kth smallest element from unsorted array of n numbers where n>>K (can even say n → ∞ or numbers are being processed and one by one coming to you). Basically this question is to reduce infinite input problem to finite/constant memory/storage.


2
Given an unsorted array of n integers. Find that pair of integers which gives the maximum sum.



3
Given a picture of H*W. Write a program to rotate the picture by 90 degrees. Picture is of 32 bit represented by an int array.



4
Write a program to print a matrix helically or spirally.



5

Right rotate an array by k units in place