Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: High Five

Explore how to use hash maps to store student scores and calculate the top five average scores efficiently. This lesson helps you implement a solution with sorting and integer division to solve a typical coding interview problem.

We'll cover the following...

Statement

You are given a list of scores for multiple students, represented as items, where items[i]=[IDi,scorei]items[i] = [ID_i, score_i] indicates the ID of a student (IDi)(ID_i) and their score (scorei)(score_i). Your task is to compute the top five average scores for each student.

Return the result as an array of pairs, result, where result[j]=[IDj,topFiveAveragej]result[j] = [ID_j, topFiveAverage_j] ...