Usual data structures and algorithmic questions. They love the guys who can
do actual coding, instead of blurting it out in pseudo-codes, since its a
telephonic interview, I think its going to be different for you.
On Wed, May 16, 2012 at 6:37 PM, rishabh shukla wrote:
> Anyone recently appeared
You need to have idea about algorithm design techniques such as Greedy
method and Dynamic Programming for these kind of problems.
(1) Greedy method always selects local optima to achieve global optima.
This is very intuitive method and simple to implement, but doesn't always
yield optimal solution
