amazon logo
Amazon· SDE 1

Amazon SDE 1 | Interview Round 1 | India

Location
India
Posted
10 Jul 2025
273 reads

Summary

I applied for an SDE 1 role at Amazon and, after completing an Online Assessment, proceeded to a technical interview round. I struggled with two Data Structures & Algorithms questions and was ultimately rejected.

How it went

Applied, got and gave the OA on 26th June, 2025.

Recruiter reached out through a call on the 10th of July asking for availability confirmation for the interview on the 11th July. Got the interview email couple of hours later.

Interviewer was a few mins late. She was actively interacting with me throughout the interview. She was very friendly. But she was not very helpful. At times it felt like she had no idea what she was talking about.

The first question was worded in a confusing manner, having the words "nodes, edges, connection, redundancy, priority". Only the first input was given. I had to guess and confirm the output. I suggested the other inputs and outputs. Many times she said that the expected output I suggested was correct and then later, said she was sorry and that she was wrong about it. Initially, she didn't share the first input so I suggested a graph approach which was wrong. Then moved to a DP based solution which was not correct. Did not solve this question. Already 45mins had passed. Twice midway through the discussion I asked if I was headed in the right direction, she said yes but nearing the end suggested to drop DP and try a different approach. I still don't understand this question.

For the second question, I suggested a brute force to binary search (MlogN) approach. She said binary search is also brute force. I was discussing other solutions but with 5 mins left she said binary search is also optimal, so code it. But time was up. Now, I understand there is a better solution but at that moment, right after hearing "brute force" my brain gave up and stopped working lol.

Verdict: Rejected

Questions asked (2)

  1. 01

    Remove Redundant Nodes with Dependency Order (Lexicographical)

    Data Structures & Algorithms · Hard

    Determine the sequence after removing the redundant nodes with similar configuration. Maintain the dependency order. Choose the lexicographically larger sequence, incase of multiple possible sequences.

    Input: AZADA
    Output: ZDA
    
    Input: AZAD
    Output: ZAD
    
    Input: ZAZDA
    Output: ZDA
    
  2. 02

    Search Element in Row and Column Sorted Matrix

    Data Structures & Algorithms · Medium

    Search and find if the given element is present in the given, rows and column sorted matrix

    Open the problem

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!