← Wells Fargo questions

Shortest path with at most k edge weight reductions

Filed under Wells Fargo

Given a weighted undirected graph, a source vertex, and a destination vertex, find the shortest path from source to destination allowing at most k edge weight reductions, where each reduction sets an…

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 Wells Fargo questions

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