Reddit·Software Engineer·Technical Phone Screen
May 2026
Reddit coding round, one problem the whole time. It was a merging/dedup problem built around a fake chat API, which sounds manageable until you read the time complexity constraint and realize they actually want you to know what a k-way merge is.
- You have a chat application where messages have unique strictly-increasing integer IDs. Given an external API that returns a message plus up to N messages before and after it (a context window), implement a class with a method that takes a list of IDs, fetches the context window for each, and returns a single deduplicated list of messages sorted by ID. The solution must run better than O(M log M) where M is the total number of messages fetched across all windows.
“The dedup and sort parts I got pretty quickly, just throw everything in a set keyed by ID and sort at the end.” The rest of the author's notes on Software Engineer interview at Reddit, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post