โ† Infosys questions

Minimal time to reach node N in graph

Filed under Infosys

Find the minimum time to reach node N from node 1 in a directed or undirected graph where edges may have temporal availability constraints or disappear at specific time moments.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Infosys questions

Collected from public candidate posts and coding forums. Updated Nov 2026.