I candidati per il ruolo di Software Development Engineer (SDE) Intern hanno valutato i colloqui presso Amazon con un punteggio di 3 su 5 (dove 5 è il livello di difficoltà più alto) e hanno giudicato la loro esperienza di colloquio positiva per il 100%. Per fare un confronto, la media complessiva dell'azienda è positiva per il 58,6%. Queste sono le valutazioni degli utenti Glassdoor.
I tempi di assunzione dei candidati per il ruolo di Software Development Engineer (SDE) Intern sono in media di 150 giorni, in base alle recensioni di colloqui inviate da 1 utenti per questo ruolo. Per fare un confronto, il processo di assunzione presso Amazon in generale richiede una media di 29 giorni.
Le fasi comuni del processo di colloquio presso Amazon per il ruolo di Software Development Engineer (SDE) Intern secondo quanto emerso da 1 colloqui su Glassdoor includono:
Colloquio telefonico: 33%
Test della personalità: 33%
Test attitudinale: 33%
Ecco i ruoli cercati più frequentemente per le recensioni dei colloqui -
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Amazon (Jamshedpur) nel mese di ago 2022
Colloquio
Medium hard questions were asked from Leetcode . Some people were heavily asked about their project . Some people were allowed to switch on there camera some were not . The selection process was completely random .
Domande di colloquio [1]
Domanda 1
Snake and Ladder problem from Leetcode
Project related questions
Ho sostenuto un colloquio presso Amazon (Seattle, WA)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho sostenuto un colloquio presso Amazon (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.