The OA is quite difficult. I need to resolve a question with sliding window and consider tons of edge cases. And the time is limited. I need to finish two questions in 75 minutes and it is not easy.
Domande di colloquio [1]
Domanda 1
Given an integer array, representing distances from 0, and a number, representing the number of points a sneak should visit, a sneak starts from distance zero, write the algorithm to return the minimal distances the sneak should use after visiting given number of points.
Surprisingly easy — I expected tougher questions, but the coding round felt more like a warm-up. The main challenge was a DSA problem about counting islands in a 2D grid, which led to a discussion on DFS versus BFS and handling large grids. Funny enough, I had revisited that exact type of question while prepping on PracHub, which made me feel more confident. The interview wrapped up with a behavioral round, and I accepted an offer, but ultimately decided to decline it for another opportunity. Overall, it was a smooth experience.
Domande di colloquio [1]
Domanda 1
Number of Islands — given a 2D grid of '1's (land) and '0's (water), count the number of connected islands. Walk through DFS vs BFS, and discuss how to avoid revisiting cells (in-place mutation vs visited set) and what changes if the grid is huge and must stream from disk.
It started with an OA, and then after a few weeks, I got invited to four rounds of interviews: technical and behavioral at 3 of the 4, and behavioral only at one.
Ho sostenuto un colloquio presso Amazon (San Paolo del Brasile, )
Colloquio
Um teste de código online, se aprovado, vai para o loop. O loop é 4 entrevistas seguidas, duas em inglês e duas em português. 3 entrevistas técnicas de código, todas as 4 têm pergunta de liderança.
Domande di colloquio [1]
Domanda 1
Pergunta historicas baseada nos principios de lideranca da amazon.
