Stripe Interview Guide

#1. Minimum Penalty for a Shop

ArraysTwo PointersSliding Windows

Imagine you're managing a shop and need to decide when to close to minimize penalties. Determine the optimal closing time based on customer arrival data to reduce losses.

This question is very likely to be asked in your Stripe interview

Evaluate Division

You are given equations represented by pairs of variables and their corresponding values. Your task is to evaluate queries based on these equations, determining the value of expressions if possible, or returning -1.0 if not.

Graphs

Somewhat likely

If you have a Stripe interview, you might get this question

#2. Evaluate Division

This question is somewhat likely to be asked in your Stripe interview

Graphs

Cheapest Flights Within K Stops

Find the cheapest price to fly from a source to a destination with at most K stops. You're given a list of flights with prices and need to determine the optimal route within the stop limit.

GraphsDynamic Programming

Somewhat likely

If you have a Stripe interview, you might get this question

#3. Cheapest Flights Within K Stops

GraphsDynamic Programming

Find the cheapest price to fly from a source to a destination with at most K stops. You're given a list of flights with prices and need to determine the optimal route within the stop limit.

This question is somewhat likely to be asked in your Stripe interview

Brace Expansion

You're given a string containing braced groups of comma-separated options. Expand the string to generate all possible combinations by selecting one option from each group.

ArraysStringsRecursion

If you have a Stripe interview, it's unlikely that you will get this question. Stripe does ask it, but it's rare

#4. Brace Expansion

This question is not likely to be asked in your Stripe interview

You're given a string containing braced groups of comma-separated options. Expand the string to generate all possible combinations by selecting one option from each group.

ArraysStringsRecursion

Optimal Account Balancing

You are given a list of transactions between people. Determine the minimum number of transactions needed to settle all debts, such that everyone owes or is owed exactly zero.

ArraysGreedy AlgorithmsRecursion

If you have a Stripe interview, it's unlikely that you will get this question. Stripe does ask it, but it's rare

#5. Optimal Account Balancing

ArraysGreedy AlgorithmsRecursion

You are given a list of transactions between people. Determine the minimum number of transactions needed to settle all debts, such that everyone owes or is owed exactly zero.

This question is not likely to be asked in your Stripe interview

Number of Black Blocks

Imagine a grid where some 2x2 blocks are marked. Count how many unique integers from 0 to 4 (inclusive) represent the number of marked cells within those 2x2 blocks that intersect with given coordinates.

ArraysSliding Windows

If you have a Stripe interview, it's unlikely that you will get this question. Stripe does ask it, but it's rare

#6. Number of Black Blocks

This question is not likely to be asked in your Stripe interview

ArraysSliding Windows

One Edit Distance

Determine if two strings are considered to be one edit distance apart. An edit can be an insertion, deletion, or replacement of a single character.

StringsTwo Pointers

If you have a Stripe interview, it's unlikely that you will get this question. Stripe does ask it, but it's rare

#7. One Edit Distance

This question is not likely to be asked in your Stripe interview

Determine if two strings are considered to be one edit distance apart. An edit can be an insertion, deletion, or replacement of a single character.

StringsTwo Pointers

Parallel Courses III

You're given courses with prerequisites and time to complete each. Find the minimum time to finish all courses, taking dependencies and parallel study into account.

ArraysGraphsDynamic Programming

If you have a Stripe interview, it's unlikely that you will get this question. Stripe does ask it, but it's rare

#8. Parallel Courses III