7 min read How Motive, the fleet-tech company once called KeepTruckin, runs its engineering loop, the coding and system-design rounds candidates report, and equity. Read article
9 min read A breakdown of the 2026 AI-interviewer screen, how it scores you, and how to talk to a bot that never nods back. Read article
8 min read What the Windsurf (Codeium) interview loop looked like before the Cognition acquisition, what each round screened for, and how the ownership change should shift your prep. Read article
6 min read A walk through HRT’s online assessment, phone screen, and onsite, the two engineering tracks, and what the coding rounds reward. Read article
7 min read Clay runs a long, practical engineering loop built around its own product problems; here is the round structure, the questions, and how to prepare. Read article
8 min read The ownership, async, and lock-free questions that Rust systems rounds at shops like Anduril and Oxide actually ask, and how to reason through them out loud. Read article
7 min read A reference to the main dynamic programming families, what the dp array means in each, and the canonical problems that drill each one. Read article
7 min read A reference for the common sorting algorithms, their time and space costs, whether each is stable, and which one to name when an interview constraint changes. Read article
5 min read The classic n-pairs parentheses problem, why the brute-force filter is a trap, and the pruning rule that keeps backtracking clean. Read article
6 min read Walking Minimum Window Substring from the brute-force baseline to the O(n) sliding window that tracks coverage with a single counter. Read article
6 min read A walkthrough of LeetCode 72, from the recursive prefix idea to the 2D table, its O(n)-space version, and the follow-ups interviewers ask. Read article
5 min read A deep copy of a graph only works if you record each clone the moment you make it, before you ever touch its neighbors. Read article
7 min read House Robber reduces to two running numbers and a two-state machine, and that same shape solves the circular, tree, and stock-cooldown follow-ups. Read article
6 min read Kadane’s algorithm finds the largest contiguous subarray sum in a single pass, and the interview really lives in the follow-ups: all-negative inputs, returning indices, and the product and circular variants. Read article
7 min read Why 3Sum sorts first, where the duplicate skips go, and what interviewers ask once your two-pointer solution compiles. Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.
