El proceso duró 1 día. Acudí a una entrevista en Pocket Gems (San Francisco, CA) en feb 2012
Entrevista
The first phone call was with a recruiter. They liked some work I'd done on an open source project that they use internally. The second phone call was
They flew me out to San Francisco. I got to stay for three days. Only one day was spent interviewing. The other two days I visited friends and saw the sights of San Francisco. There were four interviews, but I spent the lunch break talking with some one, I think it was mostly about fit, so I count that as the fifth interview.
Overall it was pretty nice experience. The questions were mostly very interesting questions. With some of them it's hard to even know where to start. Even if I didn't get the job, I enjoyed seeing San Francisco. The interviews themselves were very difficult. I really thought that I hadn't done well. I made a lot of coding mistakes, but I got an email two weeks later saying they were interested in hiring me. Yay!
Preguntas de entrevista [5]
Pregunta 1
How would you check if a binary tree is balanced? Write a program to implement your algorithm.
You are in a game of Russian Roulette with a revolver that has 3 bullets placed in three consecutive chambers. The cylinder of the gun will be spun once at the beginning of the game. Then, the gun will be passed between two players until it fires. Would you prefer to go first or second?
At a movie theater, the manager announces that they will give a free ticket to the first person in line whose birthday is the same as someone who has already bought a ticket. You have the option of getting in line at any time. Assuming that you don't know anyone else's birthday, that birthdays are distributed randomly throughout the year, etc., what position in line gives you the greatest chance of being the first duplicate birthday?
You are given a list of about half a million English words. All of the English words have fewer than 35 characters. You are also given a (potentially very long) input string of characters. Determine an algorithm that will find all of the valid anagrams of the input string. What data structures will you use? Is it efficient? Now that you've figured out the algorithm, implement it in the language of your choice. How would you parallelize it?
Envié una solicitud electrónica. El proceso duró 1 semana. Acudí a una entrevista en Pocket Gems (Los Angeles, CA) en mar 2016
Entrevista
The whole interview was ok but I did sucks. Based on phone, you can choose what ever language you like. It interviewer went directly to the programming part. 2 small coding task asked. Anyway, it's relatively easy to get a interview. But I guess it's not very easy to continue.
Via recruiter, LinkedIn, Facebook. First by LinkedIn email then evitedoc. Then phone interview with HR, followed by phone interview with Tech. Phone interview lasts about 40 minutes. After that will be on-site interview at San Francisco. Offer discussion after...
Preguntas de entrevista [1]
Pregunta 1
More algorithm/data structure question than actual game dev, graphic related questions!