You have a 100 coins laying flat on a table, each with a head side and a tail side. 10 of them are heads up, 90 are tails up. You can't feel, see or in any other way find out which side is up. Split the coins into two piles such that there are the same number of heads in each pile.
Write some pseudo code to raise a number to a power.
Describe and code an algorithm that returns the first duplicate character in a string?
In a given sorted array of integers remove all the duplicates.
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.
Suppose you have a matrix of numbers. How can you easily compute the sum of any rectangle (i.e. a range [row_start, row_end, col_start, col_end]) of those numbers? How would you code this?
What sort would you use if you required tight max time bounds and wanted highly regular performance.
Write a method to decide if the given binary tree is a binary search tree or not.
Given two strings with the same characters except for one additional character in one string, return that additional character.
how can a particular application be tested apart from testing its functionality
Viewing 1 - 10 interview questions