Scoreboard Insertion Order | Dataford Interview Questions

Given a sorted list of scoreboard scores and a second list of scores ordered by time, return the place each new score would take when inserted (e.g. scoreboard [5, 10, 15], scores [6, 16, 3] -> [3, 1, 6]).

Asked in the interview 2 stage. Treat larger scores as better, so the highest score has place 1. Each new score remains on the scoreboard before processing the next score. Equal scores take the later position among equal values.

Input and Output

Implement scoreboard_ranks(scoreboard, scores). Both inputs are lists of integers, with scoreboard sorted in ascending order. Return a list containing the 1-based place for each score in scores.

Constraints

0 <= len(scoreboard) <= 10^5
0 <= len(scores) <= 10^5
-10^9 <= scoreboard[i], scores[i] <= 10^9
scoreboard is sorted in ascending order
Scores are processed in the given order

Function Signature

def scoreboard_ranks(scoreboard, scores):

Your question is Scoreboard Insertion Order. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Input and Output

Constraints

0 <= len(scoreboard) <= 10^5
0 <= len(scores) <= 10^5
-10^9 <= scoreboard[i], scores[i] <= 10^9
scoreboard is sorted in ascending order
Scores are processed in the given order

Function Signature

def scoreboard_ranks(scoreboard, scores):

Your question is Scoreboard Insertion Order. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.