← Sprinklr questions

Minimum distances with K wildcards per path

Filed under Sprinklr

The question

Given a graph with weighted bidirectional edges and a source vertex 1, find the minimum distances from node 1 to all other nodes where you can use at most K wildcards (making edge cost 0) along each path from source to destination.

No write-up yet. Related questions below have one.

Related Sprinklr questions

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