Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Greenplum en ene 2011
Entrevista
Was given a programming assignment and one hours to complete it. Question: 1. Recursive and non-recursive solution for a fibonacci. 2. FInd the sum of the k maximum numbers in a file. What would you do for a very large number of numbers. A min-heap based solution works best.
Me postulé en línea. El proceso tomó 4 semanas. Acudí a una entrevista en Greenplum (San Mateo, CA) en abr 2011
Entrevista
one phone, then a coding test via email. Then onsite with upto 6 one on one. Mostly coding question. each one of them had more than one puzzle and each interview lasted 45 mins