← Adobe questions

Minimum cost of path with default weights

Filed under Adobe

Given a directed/undirected graph with n nodes (labeled 1 to n) and m edges, where each edge has a specified weight (or a default weight of 1 if unweighted), find the minimum cost to travel from node…

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 Adobe questions

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