OA (Non-Auto)
Phone Screen
1 round
technical
Final
3 rounds
technical + bug squash + integration (api)
Decision
OA (Non-Auto)
Phone Screen
1 round
technical
Final
3 rounds
technical + bug squash + integration (api)
Decision
Applications Open
August
Interview Period
September - November
Offers Released
October - December
Solve a simplified problem involving organizing or processing data, similar to challenges encountered at Stripe.
Describe how you would use graphs and dictionaries to solve a shipping cost calculation problem.
Solve an algorithmic problem with four parts focused on string parsing that is very easy.
How do you find fraudulent transactions in an array?
You are given strings representing transactions and must process the data for easier readability; then, given rules that bar certain transactions at specific times, return the final state after applying these rules, considering that the optimal O(n log n) solution involves sorting transactions by time, but a simpler O(n²) approach also exists.
I was asked a difficult greedy algorithm question, a string manipulation question, and a problem involving intervals and ranges in my first interview after applying via LinkedIn, but I did not advance further.
Explain how greedy algorithms apply to string manipulation problems.
I was asked an easy to moderate data structure and algorithms question based on graphs and Dijkstra's algorithm, with a preference for Python or Java over C++ during the interview, where the main focus was on clean coding practices involving object-oriented programming.
Explain a graph problem that involves Dijkstra's algorithm.
Solve data structure and algorithm problems tailored to Stripe and its core product, primarily using arrays and hashmaps, focusing on scenarios relevant to Stripe's services.