← Flipkart questions
CodingReported in a candidate post, Jan 2021

Shortest route between cities eliminating k edge distances

Filed under Flipkart

Given n cities and bidirectional roads with weights, find the shortest path between two cities. You have a special ability to set the distance of up to k edges to 0. AI-generated content.

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.