Solicité el puesto a través de un captador. Acudí a una entrevista en HARVEY (San Francisco, CA) en sept 2025
Entrevista
Reached out by a recruiter and I put it off until a month later. Did a coding screen and went to onsite. Really bummed I didn’t get the offer. I had lunch with the team and they took me out to a nice restaurant since there was some event going on that week in the office.
Preguntas de entrevista [1]
Pregunta 1
They got a bunch of new questions now so nothing you see on here is that helpful. I was asked a tree problem to rebalance a red black tree and they actually expect running code. System design was something completely unrelated like designing a car dealership management system. People I met was great but I did terrible. They are also heavy on what you do outside of work and seem to prefer people who excels at a hobby. Some employees are professional dancer or compete in some sports or high video game ranking so make sure you sound interesting and have a life outside of work.
Phone screen - positive experience where they spin a LC problem as a little more practical real life example. Interviewer was very straightforward and did not waste much time. Started with background intro and went straight into problem.
Envié una solicitud electrónica. Acudí a una entrevista en HARVEY (San Francisco, CA) en abr 2026
Entrevista
1 phone screen round + 4 onsite rounds.
The screen round is a leetcode style coding question.
The onsite rounds are 1 leetcode style coding question + 1 system design + 1 behavior + 1 project deep dive.
Their question bank seems to be small but I still failed. No feedback was provided.
Envié una solicitud electrónica. El proceso duró más de 1 semana. Acudí a una entrevista en HARVEY en sept 2025
Entrevista
Coding tech screen followed by on-site interview, consisting of coding, systems design, and behavioral interviews. The coding interviews were data structure heavy and definitely worth studying graph and R-tree algos before
Preguntas de entrevista [1]
Pregunta 1
1. Implementing a rudimentary geospatial partitioning scheme using R-trees
2. Variation on minimum cost flow problem
Make sure you know graphs and trees inside and out