← Back to Directory

Retool

Mid-sized

Screna has 4 Retool interview write-ups. The most reported round is the technical phone screen (3).

4 interview notes · updated Jun 2026

Retool·Software Engineer·Onsite - System Design / Architecture

Jun 2026
System design round at Retool for a software engineer role. The whole session was basically one big question about designing a dog-walking marketplace backend, and they went deep on every layer of it.
  • Design the backend for a two-sided dog-walking marketplace where owners can search for and book walkers, and walkers can manage availability and receive payouts.
  • How would you handle booking concurrency to prevent double-booking a walker for the same time slot?
  • Walk through how you'd design idempotent payment processing for this system, including capturing payment on walk completion and paying out walkers.
  • How would you design the schema for users, walkers, dogs, bookings, payments, and reviews?
  • How would you scale the walker discovery and search feature to handle high read volume?

“Big open-ended one.”

View Post

Retool·Software Engineer·Technical Phone Screen

Jun 2026
Retool SWE interview hit me with a two-part stock trading problem that looked like standard LeetCode until the 'exactly' constraint showed up and I realized I'd been solving a slightly different problem the whole time.
  • Given an array of daily stock prices, you must complete exactly one buy-sell transaction (sell day strictly after buy day). Return the maximum profit, or indicate that no valid transaction exists.
  • Now extend that to exactly two non-overlapping buy-sell transactions. The second buy must happen on or after the first sell. Return the maximum total profit across both transactions, and again the 'exactly two' constraint is required, not optional.

“I went straight for the running minimum scan and it worked fine, but I almost forgot the infeasibility case.”

View Post

Retool·Software Engineer·Technical Phone Screen

Jun 2026
Retool had me build a mini SQL execution engine in Python during a technical phone screen. The problem started manageable but the follow-ups kept stacking on and I felt like I was playing catch-up by the end.
  • Implement a small in-memory SQL execution engine in Python that supports SELECT (column projection), WHERE (row filtering with comparison operators), and LIMIT. The input and output are both list[dict[str, Any]].
  • Extend the engine to support GROUP BY with aggregate functions (COUNT, SUM, AVG, MIN, MAX) and a HAVING clause to filter on aggregated results.
  • How would you design the API so these operators compose cleanly, for example using an iterator or operator-tree style? Also analyze the time and space complexity of your implementation.

“I started with a flat loop approach, filtering rows one pass at a time, which worked but felt clunky when they asked me to extend it.”

View Post

Retool·Software Engineer·Technical Phone Screen

Apr 2026
Retool SWE interview focused on implementing a Markov chain simulator from scratch. Two parts to the coding question, starting with transition counts and then converting to probabilities with a sampling API. The discussion portion got into edge cases and extensions which felt like the real test.
  • Given a sequence of tokens, build a data structure that tracks how many times each token is immediately followed by every other token in the sequence.
  • Convert those transition counts into probabilities and implement a sample_next function that returns a random next token weighted by those probabilities.
  • How would you handle edge cases like tokens that never appear as predecessors, numerical precision problems in very long sequences, and extending the model to higher-order k-gram chains?

“Pretty straightforward once you just start iterating pairwise.”

View Post