Stripe interview questions

Tech / SWE · 6 questions · last reported Jan 2025
Report an interview →

Browse 6 Stripe interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Phone screen, Onsite, Online assessment (OA)
Practice topics
array (3), breadth-first-search (3), dynamic-programming (3), graph (3), backtracking (2), shortest-path (2), string (2), bit-manipulation (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what Stripe will ask. Locked question details require points. Public examples below are free to read.

Read 3 free Stripe interview question examples

Browse all Stripe questions

6 questions

Free Stripe interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Evaluate Division

Medium · Phone screen · Onsite · Full-time

Interesting graph question from my Stripe onsite. Given equations like a/b = 2.0 and b/c = 3.0, answer queries like a/c. I modeled it as a weighted directed graph and used BFS to find paths between query variables, multiplying edge weights along the way. The interviewer asked about handling contradictory equations, like if two paths between the same nodes give different products, and how I'd detect that. We also discussed union-find as an alternative approach.

Cheapest Flights K Stops

Medium · Onsite · Phone screen · Full-time

Got this graph problem in my Stripe phone screen. Find the cheapest flight from source to destination with at most k stops. The interviewer pushed on why standard Dijkstra doesn't work directly here and asked me to trace through an example where the cheapest path has more stops than allowed. I didn't quite get the optimal solution in time but talked through the right direction.

Min Penalty for Shop

Medium · Online assessment (OA) · Phone screen · Onsite · Full-time

Got this optimization problem during my Stripe phone interview. Given a string of Y and N representing hourly customer visits, find the earliest closing hour that minimizes penalties. You get penalized for being open with no customers and for being closed when customers show up. The interviewer liked my approach and asked how it extends to variable penalty weights for the two types of mismatches.