Design a data structure that supports addScore(playerId, score), reset(playerId), and top(K) which returns the sum of the top K players' scores; the core challenge is maintaining dynamic scores under frequent updates and answering top-K sum queries efficiently (e.g., via an ordered structure or heaps combined with a map).
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Pros/Cons of heap approach– Simple, memory‑efficient; recompute each call (O(n)) if not using persistent heap. More performant alternative– Use SortedList (or balanced BST) + dictionary; updates O(log n), getHighScores O(1). Further optimization– Fixed‑size min‑heap alongside dictionary; lazy deletion; possible Redis Sorted Set for distributed scale.
Sem observação adicional neste relato público.
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
