Show Notes
SPOTLIGHT EPISODE: What happens when a physics PhD and former pro poker player decides to break into big tech? Drew sits down with Shawn Strausser to break down how he went from burnout to hired by Meta as a Senior MLE. You’ll hear the full story, from his initial struggles applying to 500+ jobs with no interviews, to the moment a spam-folder recruiting email from Meta changed everything. Along the way, we pause to reflect on Shawn’s live mock ML system design interview, highlighting key moments, strategies, and insights that helped him land a role as a machine learning engineer. If you’re preparing for system design or ML interviews, this one’s packed with gold. Watch Shawn’s full mock interview here: https://youtu.be/Q-g9nGDBUpY?si=pC896LpbRDRvPLNa Book your own mock interview: https://interviewing.io Connect with Shawn on LinkedIn: https://www.linkedin.com/in/shawn-strausser-93aa8620b/ Sign up to book coaching or to watch more interviews in our showcase: https://www.interviewing.io See the interviewer’s feedback and transcript here: https://interviewing.io/mocks/meta-python-minimum-depth-of-binary-tree Or view other Meta interviews: https://interviewing.io/mocks?company=meta Disclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee, and all interviews are anonymous. interviewing.io has the sole right to distribute this content. ⸻ Timestamps: 00:00 Introduction 00:24 Interview begins: Shawn’s background and path to Meta 19:39 Commentary: prepping to perform in interviews 23:39 Interview: mock interview begins 26:00 Commentary: feedback on outlining and preparation 26:35 Interview: data features and fraud detection 32:00 Commentary: fusion and feature discussion 32:21 Interview: early vs. late fusion 36:00 Commentary: bias and human labeling 37:00 Interview: modeling architecture and label bias 40:41 Commentary: real-world complexity of label bias 43:43 Interview: clarifying questions and best practices 48:03 Commentary: content fusion and meme example 50:41 Interview: pivotal interview moment 52:07 Commentary: rehearsal strategy 53:45 Interview: mindset, sleep, and sustainability 55:41 Final commentary and outro
More from Whiteboard Confidential
A candidate works through three algorithmic problems in Go during a mock interview with a senior FAANG engineer. This mock touched on correctness, complexity tradeoffs, implementation clarity, and communication — the core signals real interviewers evaluate.🧩 Problem 1 — Longest Consecutive Sequence (Unsorted Array)Design an O(n) solution using a hash set to identify sequence starts and expand. Covers duplicate handling, boundary detection, and correctness reasoning without sorting.🧩 Problem 2 — Binary Tree Level Order TraversalClassic BFS over tree nodes, using a queue and level-by-level batching. Discussion includes space complexity, queue growth, and common implementation pitfalls.🧩 Problem 3 — Cutting Trees on a Cliff (Grid Stability / Connectivity)After removing one tree, determine which remaining trees are still connected to the bottom row. Involves multi-source BFS/DFS from stable nodes, component tracking, and correctness guarantees for 4-directional connectivity. Key skills demonstrated• Translating verbal reasoning into clean Go implementations• Maintaining communication while coding (a major FAANG evaluation axis)• Applying BFS/DFS patterns across trees and grids• Identifying optimal vs. suboptimal approaches via time/space analysis• Handling interviewer hints and recalibrating solutions• Ensuring correctness through example-driven verification👉 Book coaching or watch more mock interviews: https://www.interviewing.io📝 Interview transcript & feedback: https://interviewing.io/mocks/faang-go-longest-consecutive-sequence🔗 Explore more FAANG interviews: https://www.interviewing.io/mocksDisclaimer: All interviews are shared with explicit permission from the interviewer and interviewee. All candidates remain anonymous.
REPLAY EPISODE: A candidate takes on two Meta-style interview problems—one array, one binary tree—and a Senior Meta engineer breaks down their performance step by step.In this Meta-style mock coding interview, a candidate is put through two challenging problems that test practical reasoning, optimal data structures, and clear communication — exactly what real Meta interviewers look for.🧩 Problem 1: Given a sorted array of positive integers and a target k, find the pair whose sum is closest to k.(A classic Meta-style twist on two-pointer optimization problems.)🧩 Problem 2: You’re given the root of a binary tree. If one person stands on the left side and another on the right side, return the nodes visible to both of them — left view (bottom → top) followed by right view (top → bottom).(A unique combination of tree view and traversal-order reasoning.)Watch how the candidate breaks down both problems like in a real Meta onsite:✅ Identifies the optimal O(n) two-pointer strategy✅ Handles tricky edge cases with clean logic✅ Designs a combined traversal strategy for dual tree views✅ Codes efficiently under pressure✅ Gets detailed feedback from a Senior Meta engineer💡 What you’ll learn:• Two-pointer patterns Meta loves to ask• How left/right tree views work and how to combine them• How to structure reasoning during a high-pressure interview• What great communication looks like in a real FAANG interview👉 Sign up to book coaching or watch more mock interviews: https://www.interviewing.io📝 Interviewer feedback & transcript: https://interviewing.io/mocks/facebook-python-closest-pair-sum🔗 Explore more Meta interviews: https://www.interviewing.io/mocks?company=metaDisclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee. All candidates remain anonymous.
REPLAY EPISODE: In this Google machine learning system design interview mock, a candidate tackles a personalized newsfeed recommendation system — the kind of large-scale ML challenge that real Google engineers face.
REPLAY EPISODE: In this Google coding interview mock, a candidate tackles one of the trickiest binary tree problems that keeps showing up in real interviews.
SPOTLIGHT EPISODE: What happens when a senior engineer stops “faking it” and starts treating interviewers like partners? Eamonn sits down with James—now at OpenAI, with prior stops at Pinterest, Reddit, and Discord—to unpack how he managed imposter syndrome, learned to ask clarifying questions early, and used improv to become a clearer, more confident communicator on the job. Along the way, we pause to analyze James’s mock coding interview on interviewing.io, tracing the exact habits that set him apart: writing while thinking, checking in for buy-in, and iterating toward better solutions under pressure. If you’re preparing for coding interviews, you’ll see how James navigates anagrams with letter-count tuples, weighs time/space tradeoffs, and engages with hints without losing the thread. Watch James's Full Mock Here: https://start.interviewing.io/interview/Gw58xSkxBKqu/replayWatch Another of James's Full Mocks Here: https://www.youtube.com/watch?v=eHF6YxfOXy4 Watch replays & transcripts: https://start.interviewing.io/showcase Book a mock interview: https://interviewing.io