Les candidats postulant à un poste comme Software Development Engineer (SDE) Intern chez Amazon attribuent un niveau de difficulté de 3 sur 5 (5 étant le niveau de difficulté le plus élevé) à leur expérience d’entretien et sont 100 % à l’évaluer comme positive. À titre de comparaison, la moyenne pour l’ensemble de l’entreprise est de 58,2 % d’avis positifs, d’après les évaluations Glassdoor.
Les candidats postulant à un poste comme Software Development Engineer (SDE) Intern mettent en moyenne 18 jours pour être embauchés, d’après les 2 entretiens partagés par les utilisateurs pour ce poste. À titre de comparaison, le processus de recrutement chez Amazon prend en moyenne 31 jours.
D’après 2 entretiens Glassdoor, les étapes typiques du processus d’entretien d’embauche pour un poste comme Software Development Engineer (SDE) Intern chez Amazon incluent :
Test de personnalité: 20 %
Test des compétences: 20 %
Test de QI/d’intelligence: 20 %
Présentation: 20 %
Entretien téléphonique: 20 %
Voici les rôles les plus recherchés pour les rapports d’entretien -
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Amazon en août 2022
Entretien
Two questions asked. The interviewer was cooperative. Also helped with dropping hints when I got struck. The interview experience was good. The interview ran for 50 minutes. Started with interviewers introduction and then I gave my introduction. Then he moved it questions. Only 2 DSA questions asked.
Questions d'entretien [1]
Question 1
2 questions asked
Arrange 0, 1 and 2
Number of binary trees that can be created.
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.