CodingHard
Minimum Transitions Between Network Nodes
Filed under Uber
The question
Given a starting 4-digit numeric code, a target code, and a list of activated nodes, find the minimum number of transitions required to reach the target, where a transition is only valid if codes differ by exactly one digit and the intermediate node is activated.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.