Leetcode 2247. Maximum Cost of Trip With K Highways

Given a weighted graph where some edges are designated as highways, find the maximum-cost trip between two nodes while using at most K highways (or exactly K, per statement), which requires treating the number of highways used as an extra state and solving a constrained longest-path problem via DP/state-expanded graph techniques (e.g., modified Dijkstra/Bellman-Ford over node×k states) to manage cycles and the K constraint.