Leetcode Problem 2247. Maximum Cost of Trip With K Highways

2247. Maximum Cost of Trip With K Highways

Leetcode Solutions

Handle the base case where k is greater than or equal to n, which means it's impossible to have a valid trip. Return -1 in this case.
Initialize the dynamic programming array dp with -1 to indicate that no path has been found yet.
Set the base case in the dp array for paths that include only one city to have a cost of 0.
Iterate over all possible bitmasks representing sets of visited cities.
For each bitmask, iterate over all cities u that are included in the bitmask.
For each city u, iterate over all cities v that are not yet visited.
If there is a highway between u and v, and if there is a valid path ending at u, update the dp array for the new mask that includes v.
After filling the dp array, iterate over all masks that have exactly k + 1 bits set (representing k highways used) and find the maximum cost among all paths ending at any city.
Return the maximum cost found, or -1 if no valid path exists.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen