Practice Roblox Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Track dynamic cumulative scores for named entities across sequential update and query operations.
Return the entity with the highest score on each query, breaking ties alphabetically.
Efficiently handle frequent updates without scanning all entities.

What This Tests

Hash map usage for maintaining current state
Max-heap implementation for efficient retrieval
Lazy deletion strategy for outdated heap entries
Custom comparator logic for deterministic tie-breaking

Common Patterns

Heap / Priority Queue

Hashing

Test Cases

Input

Output

Expected