3807. Minimum Cost to Repair Edges to Traverse a Graph

Use binary search.

For a fixed value of money, check whether there exists a path from node 0 to node n - 1 that uses at most k edges.

Use binary search to find the smallest value of money that makes this possible.