Amazon | SDE-Intern(2020) | Seattle | Offer

amazon logo
amazon
sde-internseattleOffer
November 20, 201910 reads

Summary

I successfully navigated Amazon's SDE-Intern hiring process, which included online assessments and a final interview, ultimately resulting in an offer.

Full Experience

I applied for the SDE-Intern position in early September 2020. On September 17th, I received an assessment link that comprised three distinct parts. I completed all three assessments by September 29th.

The first part was a simple 20-minute debugging round, consisting of 7 questions. The second part involved two online coding questions, both rated as LeetCode Medium, specifically "Two Sum" and a problem on "k nearest points using Euclidean Distance." The third and final part was a two-and-a-half-hour work simulation and logic ability test, featuring multiple-choice questions focused on problem-solving sequences.

On October 11th, I received an email inviting me to move forward with the final interview round and to fill out a survey with available interview dates. My interview was scheduled for November 7th and lasted 45 minutes.

During the interview, I faced both behavioral and technical questions. The behavioral questions included: "Have you ever worked on a tight deadline?", "Tell me about a time when you took help from a senior," and "Describe a time when you got stuck on something and whether you delivered on time." The technical questions involved: "Binary Tree Level Order Traversal," "Zigzag Traversal," and a "modified Two Sum" problem. My knowledge of sorting algorithms, specifically counting sort and merge sort, was also tested with particular given inputs.

The interview concluded on a positive note, with me asking the interviewer about their experience and journey at Amazon. I received an offer on November 13th, 2020. I could also track my application status on the Amazon career portal before the official offer.

Interview Questions (8)

Q1
Two Sum
Data Structures & AlgorithmsMedium

One of the two online coding questions given in the assessment, a classic LeetCode Medium problem.

Q2
K Nearest Points using Euclidean Distance
Data Structures & AlgorithmsMedium

One of the two online coding questions, requiring the use of Euclidean distance to find k nearest points. It was categorized as LeetCode Medium difficulty.

Q3
Working on Tight Deadlines
Behavioral

A behavioral question asking to describe an experience where I had to work under a tight deadline.

Q4
Seeking Help from Senior
Behavioral

A behavioral question asking to recall a time when I sought help from a senior colleague.

Q5
Overcoming Obstacles and Delivering on Time
Behavioral

A behavioral question prompting me to describe a situation where I encountered a significant obstacle, how I overcame it, and ensured timely delivery.

Q6
Binary Tree Level Order Traversal
Data Structures & Algorithms

A technical question focused on performing a level order traversal of a binary tree.

Q7
Binary Tree Zigzag Level Order Traversal
Data Structures & Algorithms

A technical question about implementing a zigzag level order traversal for a binary tree.

Q8
Two Sum (Modified)
Data Structures & Algorithms

A technical question presenting a modified version of the classic Two Sum problem.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!