← Flipkart questions

Shortest distance with k edge removals

Filed under Flipkart

Given a weighted undirected graph, find the shortest distance between a source node and a destination node given that you can remove up to k edges from the path (effectively making their weight 0).

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 Flipkart questions

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