Amazon SDE 1 | May 2022
Summary
I recently went through the interview process for an SDE 1 position at Amazon in May 2022, which included an Online Assessment and two virtual technical rounds focusing on data structures and algorithms. I am currently awaiting the final results.
Full Experience
I was connected by a recruiter, and my Online Assessment was scheduled within a week.
Round 1: Online Assessment
This round consisted of two coding problems:
1. K Closest Points to Origin (LeetCode 973)
2. Optimal Utilization (a common Amazon OA problem from 2019)
After about 4-5 days, I received a call from the recruiter inviting me to the further interview rounds.
Round 2: Virtual Technical Round
This round was conducted by an SDE-2, with another SDE shadowing. We discussed two algorithm problems:
1. Minimum Knight Moves (LeetCode 1197)
2. Find the Winner of the Circular Game (LeetCode 1823)
Round 3: Virtual Technical Round
Similar to the previous round, this was also conducted by an SDE-2 with an SDE shadowing. The problems discussed were:
1. Binary Tree Maximum Path Sum (LeetCode 124)
2. Longest Substring Without Repeating Characters (LeetCode 3)
I am currently waiting for the result of this final round and will update my experience afterwards.
Interview Questions (6)
Given two lists, a and b, and a target value target. Each element in the lists is a pair of integers, where the first integer represents an ID and the second integer represents a value. You need to find pairs of elements, one from a and one from b, such that the sum of their values is less than or equal to target and as close to target as possible. Return a list of IDs of the selected elements. If there are multiple pairs that meet the criteria, return all of them.
There are n friends playing a game, sitting in a circle numbered from 1 to n. Given a positive integer k, starting from the 1st friend, count k friends clockwise and remove the kth friend. The game continues from the friend immediately clockwise to the removed friend until only one friend remains. Return the winner (the number of the last friend remaining).
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. The path does not need to pass through the root. The path sum is the sum of the node's values. Given the root of a binary tree, return the maximum path sum of any non-empty path.