Amazon | SDE 2 (L5) | Bangalore | April 2024 [Offer]

amazon logo
amazon
SDE 2 (L5)bangalore3.2 yearsOffer
April 27, 20240 reads

Summary

I interviewed with Amazon for an SDE 2 (L5) position in Bangalore from February to April 2024 and successfully received and accepted an offer.

Full Experience

My Amazon SDE 2 (L5) Interview Journey

I interviewed with Amazon for an SDE 2 (L5) role in Bangalore between February and April 2024. With 3.2 years of experience as an SDE 2 at a product-based MNC, I was eager for this new challenge. This is my detailed interview experience.

Application and Initial Contact

An Amazon recruiter contacted me on LinkedIn, and after I shared my resume, I received an online assessment link within a week. This was followed by four interview rounds over the next two months.

Online Assessment

The online assessment consisted of two coding questions:

  • Question 1: Return the longest decreasing subsequence in a linked list. (Similar to Longest Increasing Subsequence)
  • Question 2: Given two categories of movies with start time and duration, find the minimum time by which you can finish watching at least 1 movie of each category.

Round 1: Low Level Design (1 hr)

This round began with introductions, followed by a couple of leadership principles questions, such as a situation where I had to deep dive into code. The main design question was to design a chat messenger like WhatsApp or Facebook Messenger.

Round 2: Coding (1 hr)

Similar to the first round, we started with introductions and leadership principles questions, discussing a situation where I aimed for a long-term goal rather than a short-term one. I was then given two coding questions:

  • Question 1: Given a matrix of blue and white balloons, where white balloons surrounding blue ones (4 directions) convert to blue each day. I needed to return the minimum number of days required to convert all balloons to blue. A follow-up asked how to get the number of blue balloons at any given day (0 to MAX_DAY). I approached this using BFS.
  • Question 2: This was a design question for an Amazon locker service. I had to design a function to return the locker to be opened when a package is received and another function to retrieve a package for a given customer. Packages were assumed to be small, medium, or large. Due to lack of time, I verbally discussed the algorithm and data structures.

Round 3: Hiring Manager, High Level Design (1 hr)

This round started with introductions, leadership principles questions, and a discussion about my projects. The main question was to design an auto-complete or search recommendations feature for Amazon Search, with the assumption of a given ranking algorithm and the target to show the top 5 searches.

Round 4: Bar Raiser, Coding (1 hr)

This final round began with introductions and leadership principles questions. I was asked two coding questions:

  • Question 1: Given a Binary Tree, return the maximum sum of a subset such that no two nodes in any subset are adjacent. I completely solved this question with a dry run.
  • Question 2: Print the subset for the previous question. I verbally discussed how to improve the algorithm to print the subset.

Feedback and Result

I received the hire feedback within a week, and compensation details were finalized the following week. I ultimately accepted the offer.

Interview Questions (8)

Q1
Longest Decreasing Subsequence in Linked List
Data Structures & Algorithms

Return the longest decreasing subsequence in a linked list.

Q2
Minimum Time to Watch Movies from Two Categories
Data Structures & Algorithms

Given two categories of movie with start time and duration. Find the minimum time by which you can finish watching at least 1 movie of each category.

Q3
Design Chat Messenger
System Design

Design Chat Messenger Like WhatsApp or Facebook Messenger

Q4
Blue Balloons Conversion
Data Structures & Algorithms

Given a matrix which contains blue and white balloons. At any given day all the white balloons surrounding the blue ones in 4 direction(up, down, left, right) are convert to blue ones. Return minimum number of days required to convert all balloons to blue.

Follow up: How to get the number of blue balloons at any given day (0 to MAX_DAY)

Input:

W W W W
W W B W
W W W W
B W W W 

Output: 3

Explanation:

Day 1:
W W B W
W B B B
B W B W
B B W W 
Day 2:
W B B B
B B B B
B B B B
B B B W
Day 3:
B B B B
B B B B
B B B B
B B B B
Q5
Amazon Locker Service Design
System Design

Amazon Provides a locker service for packages

  1. Design a function which returns the locker to be open when a package is received
  2. Design a function to retrieve the package of a given customer For simplicity, assume packages can be of 3 sizes: small, medium and large.
Q6
Design Auto Complete / Search Recommendations
System Design

Design Auto Complete / search recommendations in Amazon Search Assumption: Given a ranking algorithm which returns the search priority. Target: Show top 5 searches.

Q7
Maximum Sum of Non-Adjacent Nodes in Binary Tree
Data Structures & Algorithms

Given a Binary Tree, return the maximum sum of the subset such that no two nodes in any subset are adjacent.

Q8
Print Subset for Maximum Sum of Non-Adjacent Nodes
Data Structures & Algorithms

Print the subset for last question (maximum sum of non-adjacent nodes).

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!