Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Greenplum nel mese di gen 2011
Colloquio
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.
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Greenplum (San Mateo, CA) nel mese di apr 2011
Colloquio
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