Stripe·Software Engineer·Onsite - Coding / Algorithms
Apr 2026
Stripe coding round, software engineer role. The problem was a factory selection optimization with transport costs layered in, and it escalated across multiple parts. Decent problem if you like thinking about prefix arrays and DP, but the setup took a while to internalize.
- You have three lists of factories, one per type. Each factory has a distance from origin and a production cost. Pick exactly one factory from each type to minimize total cost, where total cost includes each factory's production cost plus the transport cost between consecutive factories (transport cost = absolute difference in distances). How do you solve this efficiently?
- How would you generalize the factory selection problem to an arbitrary number of factory types instead of just three?
“The naive triple-nested loop is obviously too slow and I think they were watching to see if I'd go there first.” The rest of the author's notes on Software Engineer interview at Stripe, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post