Leetcode Problem 1086. High Five

1086. High Five

Leetcode Solutions

Initialize a map where each key is a student ID and each value is a min heap (or priority queue) that will store up to five scores.
Iterate over the list of items.
For each item, check if the student ID already has a min heap in the map.
If not, create a new min heap for that ID.
Add the score to the min heap for the corresponding student ID.
If the min heap size exceeds five, remove the smallest score (min heap root).
After processing all items, iterate over the map entries.
For each entry, calculate the average of the scores in the min heap using integer division.
Add the student ID and the calculated average to the result list.
Sort the result list by student ID.
Return the sorted result list.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen