← Flipkart questions
CodingReported in a candidate post, Sep 2020

Min-cost path in a weighted directed graph allowing K skips

Filed under Flipkart

Given a directed weighted graph with n nodes, a source and a destination, find the minimum cost to reach the destination when you may skip the cost of up to K edges (assumed here: K edges can be…

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.