The interview experience at Amazon was exceptionally smooth and fair. I truly appreciate the recruiter's professional approach and effective communication throughout the process. I highly recommend considering opportunities with Amazon, especially for those interested in the Software Development Engineer (SDE) realm.
Questions d'entretien [1]
Question 1
Software engineer questions were the ones related to the interview.
Standard LC mediums, nothing too crazy. Interviewer was pretty chill and was helpful in pointing me in the right direction when I needed as well. Only thing I would probably change was to study more on graph problems before hand.
Questions d'entretien [1]
Question 1
You are given an 0-indexed integer array weights, where weights[i] represents the weight of the i-th marble, and an integer k.
Your task is to divide the marbles into k bags such that:
No bag is empty.
Each bag must contain marbles from a contiguous range of indices. That is, if a bag includes marbles at indices i and j, then all marbles with indices between i and j (inclusive) must also be included in that same bag.
The cost of a bag that includes marbles from index i to j (inclusive) is defined as weights[i] + weights[j].
The total score of a distribution is the sum of the costs of all k bags.
Return the difference between the maximum and minimum possible scores among all valid distributions.
J'ai passé un entretien chez Amazon (Tel Aviv-Yafo)
Entretien
Applied online and received an Online Assessment. It consisted of two LeetCode-style coding problems with a time limit . The process was straightforward and fully automated with no human interaction at this stage.
Questions d'entretien [1]
Question 1
Solve a coding problem involving array manipulation under a timed online assessment
There were 2 rounds- one DSA round and one HR round.
In the first round they asked me a DP + trees question which was of medium to hard difficulty.
In the second round the interviewer asked me about my resume, my projects, some computer fundamental questions.