Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Apple
Leetcode 568. Maximum Vacation Days
Reported Mar 20, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceDatadog
Leetcode 568. Maximum Vacation Days
Reported Apr 10, 2025 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 568. Maximum Vacation Days
Reported Aug 24, 2025 · 3 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source