Sep. 8th, 2013

juan_gandhi: (VP)
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)
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 ."
juan_gandhi: (VP)


Sam Yokel, 2013

Profile

juan_gandhi: (Default)
Juan-Carlos Gandhi

August 2025

S M T W T F S
      12
3456789
10 11 12 13141516
17181920212223
24252627282930
31      

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Aug. 17th, 2025 10:22 am
Powered by Dreamwidth Studios