Given a n-by-n matrix, each cell has a value of either 0 or 1. A cell indicates a wall if its value is 1. give the length of the shortest path from M[0][0] to M[n-1][n-1]. You can move either up, down, left or right.
Phone screen, followed by two coding rounds, one system design, and one HM/behavioral round. Prepare with LeetCode tagged questions related to data structures, algorithms, and system design topics. Prepare for Behavioural in STAR method.
Envié una solicitud electrónica. Acudí a una entrevista en X
Entrevista
Went through two screenings and virtual onsite. Technical team members were friendly and great to speak with. Recruiters were pretty awful - the one that set up the virtual onsite gave everybody different zoom links and trying to find the correct room to join really cut into my interview time and made me stressed out during the VO. Main recruiter scheduled a phone call to discuss results after the VO for when it was past midnight in my timezone but never called or responded to my followup.
To the recruiter: you don't need to try to keep me warm by scheduling a phone call and ghosting me when I only asked you whats the decision timeline. If its rejection just email to let me know instead of wasting more of my time especially when its late in my timezone.
In general this would've been a positive experience if the recruiters weren't so bad.
Solicité el puesto a través de la recomendación de un empleado. El proceso duró 2 semanas. Acudí a una entrevista en X (Londres, Inglaterra) en abr 2025
Entrevista
Ho effettuato un colloquio conoscitivo con HR dopodiché una sessione di live coding e domande tecniche con il responsabile dell'area. Domande vertevano su vari algoritmi e complessità in termini di tempo e spazio
Preguntas de entrevista [1]
Pregunta 1
Risoluzione di un problema algoritmico che richiedeva l'utilizzo della funzione xor
