I recently interviewed for a software engineering role, and it was a great learning experience. The technical portion focused heavily on LeetCode medium-level questions, so I highly recommend reviewing all relevant tagged questions in preparation. The interviewers were well-prepared and asked thoughtful questions that required solid problem-solving skills.
In addition to the technical aspects, they placed a lot of emphasis on behavioral questions, specifically around leadership principles. Make sure to prepare 5-6 stories that align with these principles, structured in the STAR format (Situation, Task, Action, Result). Having clear, concise examples ready will definitely help.
Overall, it was a challenging but fair interview process.
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.
Interview questions [1]
Question 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.
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.
Interview questions [1]
Question 1
Pergunta historicas baseada nos principios de lideranca da amazon.
