Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Amazon
Colloquio
Two 45 minute interviews on campus.
-Some general data structures/algorithm questions
-In a list of integers, give an algorithm to find the block with the largest sum
-A graph problem
-Given a list of words, describe an algorithm for finding duplicate strings, find a way to do it using no additional memory or certain run time.
-simple text compression algorithm
Domande di colloquio [1]
Domanda 1
Write a program to compress text (being as syntactically correct as possible in a language of your choice) by encoding runs of repeated characters:
e.g. aaaaaabbbcc becomes a6b3c2
Also the graph problem which I cannot remember exactly but you had a certain number of spaces and each space could jump a certain number of spaces to another space. Find the shortest number of jumps to reach the end.
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.
The whole process stretched over nearly a month, longer than I anticipated. After an initial phone screen, I faced a technical round that included a Min Stack implementation question. We discussed design considerations and thread safety, which threw me for a bit. Fortunately, I remembered a specific mock interview I practiced on PracHub that mirrored this scenario closely, making me feel more at ease. Ultimately, I received an offer, but I chose to decline due to the company culture not feeling like the right fit.
Le migliori aziende per "stipendio e benefit" vicino a te
