Leetcode 2065. Maximum Path Quality of a Graph

Find the maximum sum of unique node values collectible by any walk that starts and ends at node 0 within a given time budget on a weighted undirected graph — you may revisit nodes but each node's value is counted at most once. The core challenge is exploring time-constrained walks (maxTime ≤ 100 and node degree ≤ 4) to maximize unique-node coverage under travel-cost limits.