**Status**: 1 YOE\n**Position**: SDE1 at Amazon\n**Location**: Seattle, WA\n**Date**: September, 2019\n\n**Technical Phone Screen (1 hour allotted)**\n\n**Intro/Behavior (10 minutes)**\nBrief introductions, he asked me for some details on things listed on my resume.  Whenever I mentioned whatever he was looking for, he would say \'OK\' and then ask me something else.\n\n**Technical Questions**\nFor each question, I asked some questions regarding constraints and described some approaches, allowing him to choose which approach I went with before coding.  After solving each problem, I walked through some test cases and answered whatever questions he had regarding the solution (pretty basic questions - why use this data structure, what\'s the time complexity).\n\n**Question 1**\nFind K largest latencies in a stream of latencies.  I used a min-heap.  I was asked about time and space complexities and to justify why I used a min-heap over a max-heap.  Overall the interviewer seemed satisified (again, cutting me off with \'OK\' once I mentioned whatever he was looking for), although he did mention that my solution wasn\'t what he had written down.\n\n**Question 2**\nExactly this problem: [Unique Paths](https://leetcode.com/problems/unique-paths-iii/)\n\nWe had a lot of time left, so he let me ask him some questions and we chatted for a bit afterward.  I thought we got along well, so I was surprised when I was rejected.  Oh well, I tried my best.\n\n\n

Status: 1 YOE\nPosition: SDE1 at Amazon\nLocation: Seattle, WA\nDate: September, 2019\n\nTechnical Phone Screen (1 hour allotted)\n\nIntro/Behavior (10 minutes)