Status: New grad, PhD CS
Position: SDE1 or SDE2 at Amazon (will determine later)
Location: Seattle, WA
Technical Online Assesement (2 hours):
- Algorithm question (1.5 hours)
- Points on 2D grid, return K nearest points from the origin.
- Given a matrix with three kinds of cells, Empty, Wall, Gate and find out the nearest gate from a point.
- Complexity Analysis (15 minutes)
- Needed to write my approach for solving the previously mentioned problems and their time and space complexity.
- Some kind of compitability test
Technical phone screen (45 Minutes):
- Given a List with a sorted integers. Find whether an integer is present in the list. The twist here is the list does not have a size function.
- Given a long string, return whether it has any palindrome of length three or more.
Onsite (4 rounds): Yet to be scheduled