Watch a full mock coding interview where a CS senior goes head-to-head with an Apple software engineer who has 10+ years of experience and has conducted over 200 real interviews. This coding interview session covers two classic dynamic programming problems — Word Break and Word Break II — with a complete problem-solving walkthrough in Python.
You'll see the entire interview arc from problem statement through brute force reasoning, optimized DP solution, code implementation, and thorough test case analysis. The interviewer provides real-time evaluation across technical skill, problem solving, and communication — the same criteria used in actual Apple coding rounds. Whether you're grinding LeetCode or preparing for FAANG on-sites, this video shows exactly what a strong interview performance looks like from start to finish.
0:00 Introduction and interview format
1:15 Problem 1: Word Break — problem statement and examples
3:00 Clarifying questions and initial approach
5:30 Dynamic programming solution walkthrough
8:45 Coding the Word Break solution (Python)
12:00 Tracing through test cases ("Facebook" = "face" + "book")
14:30 Time and space complexity analysis (O(n^2))
16:00 Interviewer feedback on Problem 1
17:30 Problem 2: Word Break II — returning all valid segmentations
20:00 Designing the recursive DFS approach with memoization
23:15 Coding the Word Break II solution (Python)
26:45 Testing and complexity discussion (D * n^2)
28:30 Post-interview Q&A and career discussion
30:00 Final interview rating and performance review
Resources:
Word Break on LeetCode: https://leetcode.com/problems/word-br...
Word Break II on LeetCode: https://leetcode.com/problems/word-br...