I stopped at the OA session. It has three problems, which I can't remember exactly now, or basically I just don't fully understand the three problems. It has enough amount of time for you to finish if you are familiar with backtracking and dynamic programming.
Preguntas de entrevista [1]
Pregunta 1
There were three online assessment questions which I don't remember or understand clearly. But I have a sense that they are solvable with dynamic programming and backtracking algorithms.
Asked for an intern willing to write in "x" language, OA languages were limited in test environment, a bit unfortunate/hard to prepare for that scenario in my opinion, would have liked more options on the OA screen.
Envié una solicitud electrónica. Acudí a una entrevista en Snowflake (Burlingame, CA)
Entrevista
Quite difficult. I got asked a divide and conquer question in the technical interview: a tree question, and a backtracking question. On the medium to hard end of the algorithm difficulty spectrum. The online assignment to get to the interview itself was 3 hards.
Acudí a una entrevista en Snowflake (San Mateo, CA)
Entrevista
Recruiter call - short prob around 20 minutes
2 interview rounds with a lot of follow up questions about distributed system. Also, there are two different people in the two interviews. The first one is medium and the other one is easy version but followed up my medium version
Preguntas de entrevista [1]
Pregunta 1
Hashmap questions. They gave me a different question not based on the questions on leetcode