amazon logo
Amazon· SDE-I (L4, New Grad/University)

[Accepted] Amazon SDE-I (University Hire) 2025 | Final Loop | Focus on Coding Rounds

Posted
5 Jun 2025
267 reads

Summary

I received an offer for the SDE-I position at Amazon after a virtual final loop, with the experience focusing on technical rounds involving coding and low-level design.

How it went

Role: SDE-I (L4, New Grad/University)
Interview Type: Final Loop (Virtual)
Result: Offer received

This post focuses on the technical rounds (coding + low-level design) of the Amazon university SDE-I loop. Behavioral content and timeline excluded for brevity.


🧩 Round 1 – Low-Level Design (probably the Bar Raiser)

Question:
Given a folder and a filtering option, return the files that match the filter.

Follow-ups:

  • How would you design it if you're given a list of filters?
  • What if the filters need to be combined using AND or OR logic (but not both at once)?

💻 Round 2 – Full DSA (Coding)

Q1: Robot in a Grid

  • A robot starts at the top-left of an m x n grid.
  • Initially, it can move right or down.
  • Goal is to reach the bottom-right cell.

Follow-up:

  • The robot can now move in all four directions, but cannot revisit cells.

I used DFS with a visited set. I don't recall if the original question asked for reachability or shortest path, but the focus was on adapting to changing constraints.


Q2: Next Greater Element to the Right

  • For each element in the array, return the first number to its right that is greater. If none, return -1.

Standard stack pattern. I talked through the logic and edge cases out loud.

Questions asked (3)

  1. 01

    File Filtering System Design

    System Design

    Given a folder and a filtering option, return the files that match the filter.

    Follow-ups:

    • How would you design it if you're given a list of filters?
    • What if the filters need to be combined using AND or OR logic (but not both at once)?
  2. 02

    Robot in a Grid (Pathfinding)

    Data Structures & Algorithms

    • A robot starts at the top-left of an m x n grid.
    • Initially, it can move right or down.
    • Goal is to reach the bottom-right cell.

    Follow-up:

    • The robot can now move in all four directions, but cannot revisit cells.
  3. 03

    Next Greater Element to the Right

    Data Structures & Algorithms

    • For each element in the array, return the first number to its right that is greater. If none, return -1.

How they prepared

Solved many Amazon-tagged problems on LeetCode — they closely reflected the types of follow-ups and patterns I saw in the actual interview.

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!