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.”