sidd.scope
BAN USER
Comments (5)
Followers (1)
Reputation 10
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
we can do it using dividing the array into three and finding the max and min of each.so that we'll have three max and three min numbers from which the max product can be easily found.
that would just take log(N) time.
Comment hidden because of low score. Click to expand.
0
of 0 vote
when u enque on stack1 how do u add that element at the bottom of stack2? or u just empty stack 2 and do the process from start?
- sidd.scope July 27, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
I've the same solution.Can anyone suggest wat can be wrong in this?
- sidd.scope July 27, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
i dont understand point 3.why should the next item be from that server.It may be possible that the next smallest item is the second element in some other server.
- sidd.scope July 19, 2012Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
- sidd.scope February 19, 2015