Autocomplete / Prefix Search with Frequency and Timestamp

CodingRobloxLast reported December 2025Medium Frequency
Reported
4× across candidate reports
First seen
May 2025
Last reported
December 2025
Reported outcome
mixed

Problem Overview

Given three arrays — queries (strings), timestamps (integers, one per query), and prefixes (strings) — for each prefix find all matching queries (queries that start with that prefix), then output them sorted by frequency (descending). If two queries appear the same number of times, break ties by the minimum timestamp…

  • 4 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Roblox catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Roblox question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?