amazon logo
Amazon· SDE II

Amazon Interview SDE2

Location
Bangalore
Experience
4 years
Posted
16 Apr 2025
294 reads

Summary

I interviewed for an SDE2 position at Amazon in Bangalore, which involved an online assessment followed by four rounds covering algorithms, system design, and leadership principles. Despite providing my best approaches to the problems, I was ultimately rejected.

How it went

YOE : 4+ Location : Bangalore Team : Payments

OA : Dont remember

  1. Based on some frequency
  2. Extended version of LIS

**Round 1 **

  1. https://leetcode.com/problems/cheapest-flights-within-k-stops/description/
  2. https://leetcode.com/problems/course-schedule-ii/description/
  3. 2 Question on LP's

Round 2:

2 Question on LP's

Design Moview Booking System

Don't know what actually panel wants HLD/LLD he was not coperative as well given some sort of HLD and some API contracts

Round 3:

2 Question on LP's

  1. https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/
  2. Intead of Binary if it is N array Tree

Round 4:

Design Google Drive Gave all requirnment he asked for

Verdict : Rejected

Questions asked (6)

  1. 01

    Cheapest Flights Within K Stops

    Data Structures & Algorithms · Medium

    There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei. You are also given three integers src, dst, and k. Return the cheapest price from src to dst with at most k stops. If there is no such route, return -1.

    Open the problem
  2. 02

    Course Schedule II

    Data Structures & Algorithms · Medium

    There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Return the ordering of courses you should take to finish all courses. If there are multiple valid orderings, return any of them. If it is impossible to finish all courses, return an empty array.

    Open the problem
  3. 03

    Design Movie Booking System

    System Design

    Design a Movie Booking System. I don't know what actually the panel wanted (HLD/LLD), and he was not cooperative. I gave some sort of HLD and some API contracts.

  4. 04

    Amount of Time for Binary Tree to Be Infected

    Data Structures & Algorithms · Medium

    You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from the node with value start. Each minute, a node becomes infected if it is currently uninfected and an adjacent node (parent or child) is infected. Return the number of minutes needed for the entire tree to be infected.

    Open the problem
  5. 05

    Amount of Time for N-ary Tree to Be Infected

    Data Structures & Algorithms · Hard

    An extension of the 'Amount of Time for Binary Tree to Be Infected' problem, but adapted for an N-ary tree instead of a binary tree.

  6. 06

    Design Google Drive

    System Design

    Design Google Drive. I gave all the requirements he asked for.

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!