Question: You are given an array with integers (both positive and negative) in any random order. Find the sub-array with the largest sum. Answer: This is an all-time favorite software interview question. The best way to solve this puzzle is to use Kadane’s algorithm which runs in O(n) time. The idea is to keep scanning [...]
My Tech Interviews
PREPARE FOR A TECHNICAL INTERVIEW
Browsing the archives for the tricky tag
13 Jan 10
Four People on a Rickety Bridge
Question: Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: [...]
11 Jan 10
100 Prisoners in Solitary Cells
Question: 100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the [...]
9 Jan 10
12 Identical Balls Problem
Question: You are give 12 identical looking balls. One of them is fake (could be heavier or lighter) than the rest of the 11 (all the others weight exactly the same). You a provided with a simple mechanical balance and you are restricted to only 3 uses. Find the fake ball. Answer: For convenience sake, [...]
6 Jan 10
Little Endian or Big Endian?
Question: Is your machine little or big endian? Answer: Let first take a look at the solution before we discuss about it. int isLittleEndian( void ) { unsigned int temp = 0×12345678; char * tempAddress = &temp; if( *tempAddress == 0×12 ) { return 0; // Indicating False } else { return 1; // Indicating [...]
6 Jan 10
Gold for 7 Days of Work
Question: You’ve got someone working for you for seven days and a gold bar to pay them. You must pay the worker for their work at the end of every day. If you are only allowed to make two breaks in the gold bar, how do you pay your worker? (Assuming equal amount of work [...]
Follow Us
Sponsors
