← Flipkart questions

Shortest route between cities with k edge weight eliminations

Filed under Flipkart

Find the shortest path between two cities in a graph where you can eliminate the weight of up to 'k' edges (setting them to 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.