El proceso duró 1 semana. Acudí a una entrevista en Everpure (Mountain View, CA) en oct 2011
Entrevista
The process started with the recruiter getting back via email to set up the online skills test. This was followed by a phone screen with an engineer, going through a sample problem in ADT design. The in-person interview was with (if I remember correctly) three engineers and the CTO, in sequence, and primarily focused on more problem solving. I found the process a lot of fun; the questions were interesting, and just the right level of complexity to work through in the individual sessions. There was time in each session to ask questions back, which was especially productive with the CTO, as you might expect.
Everyone involved was friendly, professional, and smart. This was the best interview process I've seen in several years, and so I was delighted to accept their offer. My initial impressions from the interview have been born out on the job, too: everyone is still friendly, professional, and smart.
Preguntas de entrevista [1]
Pregunta 1
Describe how you would write a function to draw a circle (given a function to turn on an individual pixel).
So far had the coding test on HackerRank which was relatively easy. Two coding challenges and then 8 multiple-choice questions I think. The coding tasks are the leet-code level simple problems like counting objects in the input data etc.
Preguntas de entrevista [1]
Pregunta 1
Inferring information about the output of async tasks composed of atomic operations.
Acudí a una entrevista en Everpure (California City, CA)
Entrevista
It was the first round interview and was a Hacker rank with Easy-med leetcode qs including MCQs and fill in the blanks. 2 coding qs one was easy palindrome check.
Solicité el puesto por otro medio. Acudí a una entrevista en Everpure (Bengaluru) en ago 2025
Entrevista
Algorithm Round or Optical Illusion Puzzle?
Had an "interesting" experience with the so-called algorithm round. Still not sure if they were testing problem-solving skills or just hoping candidates would get lost in the formatting.
The highlight was a question on a bitbuddy tree (yep, that's what they called it) disguised in a 2D array format. Looked like a scene from Inception at first glance—layers within layers. Turns out, all it required was a plain old integer division. The challenge was more in deciphering what they were even asking, not solving the problem itself.
Would’ve appreciated a bit more clarity on what kind of "algorithm" knowledge they expect. Feels like they were going for clever, but ended up closer to cryptic.