Leetcode 568. Maximum Vacation Days

Given a flights graph and a matrix of vacation days per city per week, start at city 0 and choose each week whether to stay or fly along allowed edges to maximize total vacation days over K weeks. The core challenge is a DP/state-search over (city, week) states with transitions constrained by the flight graph and time steps to accumulate the optimal sum.