Coding (Algo)

Find the Nearest Available Value

Algorithm: Binary search Difficulty: Easy Time: 25 minutes

Goal

Return the allowed value closest to the target and choose the smaller value on an equal-distance tie.

What this task practices

Find the Nearest Available Value 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.