I was first asked to solve a problem using binary search—the interviewer emphasized both correctness and efficiency, so I had to carefully reason through edge cases and optimize my implementation. After that, I tackled a heap-related question that involved designing a data structure to support dynamic retrieval of the top‑k elements. The focus was on choosing the right heap type (min-heap vs. max-heap), maintaining time complexity, and explaining trade-offs clearly. Throughout, the interviewer encouraged me to think out loud and discuss my approach, which helped make it a collaborative and engaging experience.
Preguntas de entrevista [1]
Pregunta 1
Given an array nums, find a peak element and return its index.
You may assume that nums[i] ≠ nums[i + 1] for all valid i.
The array may contain multiple peaks—return the index of any one.
Envié una solicitud electrónica. Acudí a una entrevista en Amazon (Sídney)
Entrevista
I can't comment much. I submitted an application for the software engineer position, and not even a minute later, I received an auto rejection email from Amazon (never received an online assessment).
2 behavioral 2 coding not very difficult. Behavioral is tell me about a time you took responsibility beyond your role and biggest accomplishment. The process is exactly the guideline they posted for interview.
Preguntas de entrevista [1]
Pregunta 1
tell me about a time you took responsibility beyond your role
It was a 2-3 round process, depending on how your interview went, with increasingly hard DSA questions followed by some HR and behavioural questions. First round was mostly easy and medium leetcode, followed by medium and hard questions in the second round and above on more complex topics.
