← Back to Directory

Tinder

Mid-sized

Screna has 2 Tinder interview write-ups. The most reported round is the technical phone screen (2).

2 interview notes · updated Jun 2026

Tinder·Software Engineer·Technical Phone Screen

May 2026
Tinder SWE interview that went pretty deep into data structures. The core problem was a median finder, but the real test was what you did after you gave the obvious two-heap answer.
  • Design a data structure that continuously ingests a stream of integers and can return the current median at any point. What's the standard approach and what are its time complexities?
  • The input stream is very large and has many duplicate values. How would you optimize the median-finding data structure beyond the standard two-heap approach?

“Two heaps, yeah I knew this one.”

View Post

Tinder·Software Engineer·Technical Phone Screen

Apr 2026
Tinder SWE interview, got a classic streaming median problem. Pretty standard stuff if you've seen it before, but the implementation details can trip you up under pressure.
  • Design a data structure that supports adding numbers from a stream one at a time and returning the current median at any point.

“I knew the two-heap trick going in, max-heap for the lower half, min-heap for the upper half.”

View Post