AMAZON | SDE 1 | VIRTUAL ONSITE | STATUS (PENDING)

amazon logo
amazon
sde 1virtual onsiteOngoing
April 9, 20202 reads

Summary

I interviewed for the SDE 1 New Grad position at Amazon in a virtual onsite format, which involved an online assessment and four subsequent rounds focusing on coding and leadership principles. My application status is currently pending.

Full Experience

I underwent the Amazon SDE 1 virtual onsite interview process as a New Grad. My interview journey began in the second week of February with an online round. Following that, I had four virtual onsite rounds spread across the second, third, and fourth weeks of March 2020.

The process was structured as follows:

Online Assessment:

  • MCQs: These were C++ output-based multiple-choice questions.
  • Programming Questions: I was presented with two slightly modified coding problems:

Onsite Rounds:

  • Round 1: This round started with an introduction, followed by two coding problems:

    • Given a matrix containing 0s and 1s, sorted row-wise, find the row with the maximum number of 1s. I was asked to achieve an O(n) time complexity.
    • Find all the anagrams in a list of words.
  • Round 2: After an introduction, I tackled two more coding challenges:

    • Replace every node in a binary tree with the sum of its inorder predecessor and successor.
    • Determine the minimum number of platforms required for trains, given their arrival and departure times.
  • Round 3: This round also began with an introduction, and then I worked on two problems:

  • Round 4: This final round involved a combination of Leadership Principle (LP) questions about my projects and two coding problems:

    • Find all nodes at distance 'k' from a given node in a binary tree (the root was provided).
    • Perform a Clockwise Spiral Traversal of a binary Tree.

LP Questions:

During my interviews, I was asked the following Leadership Principle questions:

  1. What was the most challenging project you have worked on?
  2. Can you describe a situation where you were able to come up with a creative solution to a complex problem?

Based on my experience, I've observed that interviewers consistently look for the most efficient solutions and pay close attention to code quality and complexity.

Interview Questions (12)

Q1
Edit Distance
Data Structures & AlgorithmsHard

I was given a slightly modified version of the Edit Distance problem.

Q2
Unique Email Addresses
Data Structures & AlgorithmsEasy

I was given a slightly modified version of the Unique Email Addresses problem.

Q3
Find Row with Max 1s in Sorted Matrix
Data Structures & AlgorithmsMedium

Given a matrix containing 0s and 1s, where the matrix is sorted row-wise. Find the row with the maximum number of 1s. The interviewer expected a solution with O(n) time complexity.

Q4
Find All Anagrams in a List
Data Structures & AlgorithmsMedium

Find all the anagrams in a given list of words.

Q5
Replace Node with Inorder Predecessor and Successor Sum
Data Structures & AlgorithmsHard

Replace every node in a binary tree with the sum of its inorder predecessor and successor.

Q6
Minimum Platforms for Trains
Data Structures & AlgorithmsMedium

Given the arrival and departure times of trains, determine the minimum number of platforms required.

Q7
Kth Largest Element in Infinite Sequence
Data Structures & AlgorithmsMedium

Find the Kth Largest element in an infinite sequence of numbers.

Q8
Find Peak Element
Data Structures & AlgorithmsMedium

I was asked to solve the Find Peak Element problem.

Q9
Nodes at Distance K from a Node in Binary Tree
Data Structures & AlgorithmsMedium

Given the root of a binary tree and a target node, find all nodes at distance k from the target node.

Q10
Clockwise Spiral Traversal of Binary Tree
Data Structures & AlgorithmsMedium

Perform a clockwise spiral traversal of a binary tree.

Q11
Most Challenging Project
Behavioral

What was the most challenging project you've worked on?

Q12
Creative Solution to Complex Problem
Behavioral

When were you able to come up with a creative solution to a complex 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!