1. Given a array of integers find the index which partitions the array to two with high numbers and low numbers. For example [5, -1, 3, 8,6] the index 3 will partition the array to [5,-1,3] and [8,6] all the numbers in the second partition are greater than first. The solution has to work in O(n).
Give an array that has only the values 1, 2 or 3, sort the array in place.
Given an array of numbers, replace each number with the product of all the numbers in the array except the number itself *without* using division.
Write a C function to return the number of set bits in an integer.
Explain the data structure you would use to implement pop() and push(Object, int) for a Priority Queue.
Code to find character count in a given string.
what's wrong with the following code : <template type T > T accumulate ( vector<T> in) { T total = in[0]; for (int i =0; i < in.length() ; i++) { total = total + in[i]; } return T }
Rand(7) from Rand(5)
Write a function that divides one number by another, without using the division operator, and make it better than O(n).
Describe a function to check if an integer is a power of 2.
Viewing 21 - 30 interview questions