Available question text
Choose a starting city and sequence of k daily actions (stay to earn stayScore[day][city] or move to any other city to earn travelScore[from][to]) to maximize total points across n fully-connected cities. This is solved with dynamic programming over days and cities, taking the max over previous-city transitions (O(k·n^2), feasible for n,k ≤ 200).
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 · 1 record
No company association
Leetcode 3332. Maximum Points Tourist Can Earn
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source