โ† Infosys questions
CodingHardReported in a candidate post, May 2026

Shortest path graph problem with constraints

Filed under Infosys

Given a weighted graph and specific constraints (such as edge weight limits or node visit conditions), find the shortest path between a source and a destination using Dijkstra's algorithm or BFS.

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.