Algorithm: Sorting Difficulty: Easy Time: 25 minutes
Goal
Return each original record’s zero-based position in a stable ascending ordering of all records.
Coding (Algo)
Algorithm: Sorting Difficulty: Easy Time: 25 minutes
Return each original record’s zero-based position in a stable ascending ordering of all records.
Rank Records Without Losing Their Positions is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as easy difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.