Amazon Sde Ii , Pune

Summary

I interviewed for an SDE II position at Amazon in Pune. The interview consisted of an online technical screen and four in-office loop rounds, covering Data Structures & Algorithms, System Design, and resume discussions.

Full Experience

Technical Screening Online

DSA - https://leetcode.com/problems/first-missing-positive/description/

Questions around java , spring and other backend related

Loop Rounds

Conducted in office at same days. Every round conatined 2-3 amazon principles

Loop Round 1

DSA Question

https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/
Loop Round 2

Design a Cost Efficient File Storage System (HLD) . Gave the design from Hello Interview
Loop Round 3

Question around resume and previous work architecture
Loop Round 4

You are given a restaurant's weekly schedule in the form of a Map<String, List<int[]>>, where each key is a day of the week ("Monday" to "Sunday"), and each value is a list of time intervals representing when the restaurant is open. Each interval is of the form [start, end], where:

start and end are integers between 0 and 1439, representing minutes past midnight.

An interval like [1380, 120] represents a time from 11:00 PM on Monday to 2:00 AM on Tuesday.

The intervals do not overlap, but they may wrap to the next day.

You are also given access to a helper function:
```
Pair<String, Integer> parseTimestamp(String timestamp);
```
It returns:

The day of the week as a String (e.g., "Tuesday")

The minutes past midnight as an int (e.g., 90 for "01:30")

Your task is to implement the method:
```
public boolean isOpen(Map<String, List<int[]>> schedule, String timestamp)
```
Return true if the restaurant is open at the given timestamp, false otherwise.

Comp : https://leetcode.com/discuss/post/6907630/amazon-sde-2-pune-by-nileshyadav6633-vs8e/

Interview Questions (4)

First Missing Positive

Data Structures & Algorithms

This is a standard LeetCode problem. Find the smallest positive integer (greater than 0) that does not exist in the array.

Binary Tree Zigzag Level Order Traversal

Data Structures & Algorithms

This is a standard LeetCode problem. Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

Design a Cost Efficient File Storage System (HLD)

System Design

Design a Cost Efficient File Storage System (HLD).

Restaurant Schedule isOpen Method

Data Structures & Algorithms

You are given a restaurant's weekly schedule in the form of a Map<String, List<int[]>>, where each key is a day of the week ("Monday" to "Sunday"), and each value is a list of time intervals representing when the restaurant is open. Each interval is of the form [start, end], where:

start and end are integers between 0 and 1439, representing minutes past midnight.

An interval like [1380, 120] represents a time from 11:00 PM on Monday to 2:00 AM on Tuesday.

The intervals do not overlap, but they may wrap to the next day.

You are also given access to a helper function:

Pair<String, Integer> parseTimestamp(String timestamp);

It returns:

The day of the week as a String (e.g., "Tuesday")

The minutes past midnight as an int (e.g., 90 for "01:30")

Your task is to implement the method:

public boolean isOpen(Map<String, List<int[]>> schedule, String timestamp)

Return true if the restaurant is open at the given timestamp, false otherwise.

Help the Community

Summary

Full Experience

Loop Rounds

Interview Questions (4)

Join the Discussion

No comments yet