1. Given a 3 array like below NSArray *a = [1,3,4,5]; NSArray *b = [-1,3,0,9]; NSArray *c = [0,31,32,22,6]; Find the elements from the three array which existing in atleast 2 arrays. Eg: [3, 0] Because 3 is presented in array a, b and 0 is presented in array b, c respectively. -(NSArray)find2ElementsAtleastPresentIn2Arrays:(NSArray*)aList b::(NSArray*)bList c::(NSArray*)cList{ // -- your code here. }
Easy quant and java questions
implement a O(1) min function for Stack
How would you implement a stack with the additional operation of getMin?
Given a stream of integers of unknown (possibly large) length, how would you pick one at random? Now prove its random.
Giving a windows size K and an array of size N, find the minimum of each window as it slides through the array.
* You have a data structure of integers, which can be negative, zero, or positive, and you need to support an API with two public methods, insert(int) and getmedian(). Describe a data structure you would use to support this API and describe the running time of the two methods. * Imagine you're writing a function that takes an array of integers and an integer and it needs to return true if any pair in the array sum to the 2nd argument. The array can have negative numbers, zero, or positive numbers. Describe how you would design this function and what its running time would be. I ran through the trivial n^2 solution, then modified it to an nlogn and finally to a linear solution.
Find the maximum difference in an unsorted array with the index of max greater than min. array cant be sorted
Given an array like [-1, 2, 3, 5, 4, 6] and it should print the 3 that is order of the array is equal to array element
Given a function for a fair coin, write a function for a biased coin that returns heads 1/n times (n is a param).
Viewing 341 - 350 interview questions