Peers Helping Peers Land Offers

DoorDash

Data Scientist

Multiple TypesPhone Screen

The SQL s are standard ones I’ve seen before, specifically the 'Restaurant' problem. When you practice these, you can’t just focus on getting the right output. You need to prepare for drill-down s on the details. For example, be ready to explain exactly why you chose a specific line of code—like whether adding DISTINCT to a certain row actually changes the result or performance, and why. For the 'Biker' product case, expect 4 to 5 follow-up s covering different layers of the business: 1. Data Collection: How are we actually getting this data? 2. Challenges: What are the technical or real-world edge cases? 3. Pros & Cons: What are the trade-offs of this specific solution? 4. Experimentation: How would you design an A/B test to verify this?"

Amazon

Software Engineer

Multiple TypesFull Journey

Video Interview Behavioral s about a tight deadline and a project I'm most proud of. The coding was a binary search variation. Video Interview Behavioral s about helping peers and conflict resolution. The coding was a modified sliding window problem similar to the fruit basket problem. Team Interview The hiring manager and two senior software engineers interviewed me. They said that interns who perform well may return as L4 engineers. I explained each step of my coding process, but the interviewers gave little feedback. The binary search I discussed was met with a simple "ok" after my explanation.

Google

Software Engineer

CodingFull Journey

Coding Round I You are given an array `tasks`, where each task is represented by two integers: * `start`: the start time of the task in minutes * `duration`: the number of minutes the task runs Each task runs continuously once it starts, and a server can process only one task at a time. Time is measured in minutes within a 24-hour cycle (from `0` to `1439`). If `start + duration` exceeds `1440`, the task continues into the next day. Return the minimum number of servers required to run all tasks without any overlap on the same server. Example ```python tasks = [ (23 * 60, 60), 23:00 – 00:00 (0, 30), 00:00 – 00:30 (23 * 60, 30) 23:00 – 23:30 ] Output: 2 ``` Coding You are given an integer array `nums`. The array may contain duplicate values and negative numbers. You must remove exactly one element from the array (i.e., delete one index). After the removal, the relative order of the remaining elements must be preserved. A pivot index is an index `p` such that the sum of elements strictly to the left of `p` is equal to the sum of elements strictly to the right of `p`. Task Return `true` if there exists some way to remove exactly one element so that the resulting array contains at least one pivot index. Otherwise, return `false`. Example ```text nums = [2, 1, 3, 1, 2] ``` Possible removals: * Remove `3` (index 2) → `[2, 1, 1, 2]` * Remove `1` (index 1) → `[2, 3, 1, 2]` (These examples illustrate the operation format only; they do not necessarily produce a valid pivot.) Notes * You must remove exactly one element. * The pivot index must exist after the removal. * Left and right sums do not include the pivot element itself.