amazon logo
Amazon· Software Dev Engineer - 1

Amazon | Software Dev Engineer - 1 | University Talent Acquisition

Posted
15 Apr 2025
328 reads

Summary

I recently completed my SDE-1 interview process at Amazon. The overall experience was intense yet rewarding, and the interviewer's final comment strongly indicated selection.

How it went

Amazon SDE-1 Interview Experience (March - April 2025)

I recently completed my SDE-1 interview process at Amazon. The overall experience was intense yet rewarding. Here’s a detailed breakdown of all the rounds:


📅 Round 1 – Technical Interview

Note: This round was rescheduled twice.

1. OOPs Implementation Question
Given student data with fields: rollNo (alphanumeric and unique), marks, name, rank (not unique), etc.
Task:

  • Write classes and functions to:
    • Retrieve all students for a given rank.
    • Retrieve a student by their roll number.

My Approach:
I used two HashMaps:

  • One for mapping rollNo to Student.
  • One for mapping rank to a list of Students.

The interviewer was satisfied with the approach.

Follow-up:

  • Asked how HashMap works internally.
  • I explained the underlying structure: array of buckets, hashing, handling collisions (via chaining or open addressing), resizing, etc.
  • Based on this, he asked a few in-depth follow-up questions.

2. Binary Tree – Count Nodes with Two Children
Problem: Count the number of nodes in a binary tree that have both left and right children.
My Approach: Implemented using post-order traversal (recursive).

Follow-up:
He asked me to solve it iteratively, but I was unable to implement the iterative version in time.


📅 Round 2 – DSA + Leadership Principles

Note: This round was initially scheduled on some other date, but the interviewer didn’t show up and it was rescheduled.

1. Leadership Principle Question
Q: Tell me about a time when you were learning something that wasn’t part of your job. .

2. Follow-up:
Q: What did you like most about that technology?


3. String Compression Variant
Problem:
Given a string, replace each group of consecutive characters with the character and its count. If the count goes beyond 9, than start the counting again.

  • s = "aaabbc" → a3b2c1
  • s = "aaaaaaaaaaabbbcc" → a9a2b3c2

Status: Solved with an optimized solution.


4. Beautiful Nodes in a Graph
Problem:
Given an n x n adjacency matrix, find all beautiful nodes.

  • matrix[i][j] = 1 means node i is connected to node j.
  • A node is beautiful if:
    • It is connected to all other nodes.
    • No node is connected to it.

Status: Solved with correct and optimized solution.


📅 Round 3 – Leadership + DSA

1. Leadership Principle:
Q: Tell me about a time when you had to deep dive to solve a particular problem.
Cross-questions followed to test depth and clarity.

2. Leadership Principle:
Q: Tell me about a time when you received negative feedback and how you handled it.
More follow-up questions on this as well.


3. DSA – Longest Substring with All Distinct Characters
Problem: Given a string, return the length of the longest substring with all distinct characters.
Status: Solved with an optimized sliding window approach.


✅ Final Outcome

At the end of the third round, the interviewer said:

"Recruiter will reach out for next steps."

Which strongly indicates selection. 🎉

Questions asked (8)

  1. 01

    OOPs - Student Data Management

    Data Structures & Algorithms

    Given student data with fields: rollNo (alphanumeric and unique), marks, name, rank (not unique), etc. Task: - Write classes and functions to: - Retrieve all students for a given rank. - Retrieve a student by their roll number.

  2. 02

    Count Nodes with Both Left and Right Children in Binary Tree

    Data Structures & Algorithms

    Count the number of nodes in a binary tree that have both left and right children.

  3. 03

    Tell me about a time when you were learning something that wasn’t part of your job.

    Behavioral

    Tell me about a time when you were learning something that wasn’t part of your job. What did you like most about that technology?

  4. 04

    String Compression (Count Reset After 9)

    Data Structures & Algorithms

    Given a string, replace each group of consecutive characters with the character and its count. If the count goes beyond 9, than start the counting again. - s = "aaabbc" → a3b2c1 - s = "aaaaaaaaaaabbbcc" → a9a2b3c2

  5. 05

    Beautiful Nodes in an Adjacency Matrix Graph

    Data Structures & Algorithms

    Given an n x n adjacency matrix, find all beautiful nodes. - matrix[i][j] = 1 means node i is connected to node j. - A node is beautiful if: - It is connected to all other nodes. - No node is connected to it.

  6. 06

    Tell me about a time when you had to deep dive to solve a particular problem.

    Behavioral

    Tell me about a time when you had to deep dive to solve a particular problem. Cross-questions followed to test depth and clarity.

  7. 07

    Tell me about a time when you received negative feedback and how you handled it.

    Behavioral

    Tell me about a time when you received negative feedback and how you handled it. More follow-up questions on this as well.

  8. 08

    Longest Substring with All Distinct Characters

    Data Structures & Algorithms

    Given a string, return the length of the longest substring with all distinct characters.

How they prepared

🔚 Final Thoughts

  • Interviewers were very friendly and professional.
  • Questions tested both depth of knowledge and problem-solving skills.
  • Strong emphasis on Amazon Leadership Principles.
  • Don't create fake answers for leadership principle questions because interviewer can ask cross questions and you might get into trouble.
  • No core subjects asked, only LP and DSA questions.
  • To prepare for leadership principles create few stories from your past experiences and form answers for each leadership principle.

Hope this helps others preparing for Amazon!

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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