Status: 4-5 YOE
Position: SDE2 at Amazon
Location: Berlin, Germany
Date: August, 2020

Status: Rejected by the hiring manager for the team, but accepted by the bar raiser. Status: waiting for a team match

Coding Task (2 questions):
Can't remember the first, but the second was solvable using minimum spanning trees.

Technical phone screen A (1 hour):

• Behavioral questions
• Algorithm question: computational geometery (count number of squares formed given a list of verticies)

2nd Technical phone screen (1 hour):

• Algorithm question: longest common sequence (of some child objects) in a list of parent objects that each contain a list of child objects (was OOP + algorthmic)

Onsite (5 rounds, all had 30 minutes leadership priniciples unless stated otherwise):

1. System design: bit.ly at a global multizone scale
2. OOP + DFS: implement unix find command (simplified version)
3. Given two lists of items, find their intersection. Follow up: given any amount of lists find the intersection across all lists given a certain appearance threshold (e.g. item has to appear in all 3 lists before its considered as an intersection)
4. Had 15 minutes of theoratical questions about inner workings of tries, hashtables, and some other structures. Given a list of time intervals [[10:30-12][11-15]] merge them so that the result is [[10:30-15]]
5. 1 hour behavioural with the hiring manager.

Result: rejected by hiring manager of that team, but they still believe i should get an offer from a different team so the current status is a limbo of waiting until a team match happens.