Amazon University Talent Acquisition, Software Dev Engineer I Interview experience.

amazon logo
amazon
Software Dev Engineer I0.67 years
May 4, 20257 reads

Summary

I successfully interviewed for a Software Dev Engineer I position at Amazon, navigating through three rounds focused on Data Structures & Algorithms and behavioral questions, ultimately receiving an offer.

Full Experience

Background

  • Education: Tier 1 IIT (CSE), CPI: 8.25
  • Experience: 8 months

Application Process

  • Applied via Amazon's career website.
  • Received OA within 2 days.
  • Completed OA in 5 days.
  • HR scheduled interviews 4 days after OA completion.

Interview Process

Round 1: 7/4/25

Round 2: 11/4/25

  • Format: Introduction followed by 2 DSA problems and 2 behavioral questions.
  • DSA Problems:
    • Topological Sort Problem: Implement a topological sort algorithm to solve a problem similar to the Course Scheduler problem.

    • Minimum Absolute Difference Problem: Given two arrays and a variable X, find the minimum absolute difference abs(X - a - b), where a is an element from the first array and b is an element from the second array.

  • Behavioral Questions:
    • Experience About a Blocker in a Project
    • Anything Done Out of Responsibility

Round 3: 21/4/25

  • Format: Introduction followed by 1 DP problem and 2 behavioral questions.
  • DP Problem: Similar to Path with Maximum Gold (https://leetcode.com/problems/path-with-maximum-gold/)
  • Behavioral Questions:
    • Tell me a time when you received critical feedback from a PM
    • Tell me a time when you learned something new on your own in a project

Key Takeaways

  • DSA Focus: Emphasis on time and space complexity.

Final Verdict

  • Outcome: Received an offer for SDE I at Amazon on 30th April.

Interview Questions (9)

Q1
Capacity To Ship Packages Within D Days (Binary Search)
Data Structures & AlgorithmsMedium

Implement a binary search algorithm to solve a problem similar to LeetCode's Capacity To Ship Packages Within D Days.

Q2
Delete Node in a BST
Data Structures & AlgorithmsMedium

Implement a standard Binary Search Tree (BST) node deletion algorithm.

Q3
Course Scheduler (Topological Sort)
Data Structures & Algorithms

Implement a topological sort algorithm to solve a problem similar to the Course Scheduler problem.

Q4
Minimum Absolute Difference with Two Arrays
Data Structures & Algorithms

Given two arrays and a variable X, find the minimum absolute difference abs(X - a - b), where 'a' is an element from the first array and 'b' is an element from the second array.

Q5
Describe a Blocker in a Project
Behavioral

Describe an experience where you encountered a significant blocker in a project and how you addressed it.

Q6
Initiative Taken Out of Responsibility
Behavioral

Share an instance where you took initiative or acted out of responsibility beyond your explicit duties.

Q7
Path with Maximum Gold (Dynamic Programming)
Data Structures & AlgorithmsMedium

Implement a dynamic programming solution for a problem similar to LeetCode's Path with Maximum Gold.

Q8
Received Critical Feedback from PM
Behavioral

Describe a situation where you received critical feedback from a Project Manager (PM) and how you handled it.

Q9
Self-Learned Skill for a Project
Behavioral

Share an experience where you learned something new independently to contribute to a project.

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!