2013-09-08

juan_gandhi: (VP)
2013-09-08 06:03 pm

a funny interview question, ascribed to Google

Design an algorithm that, given a list of n elements in an array, finds all the elements that appear more than n/3 times in the list.

The algorithm should run in linear time. (n >=0 )

You are expected to use comparisons and achieve linear time. No hashing/excessive space/ and don’t use standard linear time deterministic selection algo


rithm.

and here's another one

Find maximum product of subarray in given array of integers

and one more

Given a float number 7.64, convert it into the string WITHOUT using any inbuilt function/library.

(sigh) I now tend to believe that the biggest problem in programming is that everybody is an idiot. The set of idiots is dense.
juan_gandhi: (VP)
2013-09-08 07:55 pm

а вот израильский Челябинск:

In a recent interview, General Norman Schwarzkopf was asked if he
thought there was room for forgiveness toward Hezbollah.


The General said,
" I believe that forgiving Hezbollah is God's function. The Israeli's
job is to arrange the meeting ."