Moloco·Software Engineer·Technical Phone Screen
Apr 2026
One round at Molocoads for a software engineer role. The interviewer was a senior Korean guy, very warm, but the accent made a few things hard to catch at first. The problem itself was deceptively simple on the surface but turned into a long back-and-forth about optimization.
- You have a log file where each entry is a (user, ad-click) pair and a single user can appear many times. How would you compute the total number of clicks per user, and how do you push the worst-case complexity below O(n) for range queries?
“Started fine, group-by-user is obvious, but then they pushed on range queries and I kind of stalled.” The rest of the author's notes on Software Engineer interview at Moloco, 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