Maximize points over n days choosing easy or hard tasks with rest days
Filed under MindTickle
The question
Given an n x 2 matrix representing points earned for completing an easy task or a hard task on each day, find the maximum total points achievable over n days. The constraint is that if a hard task is performed on day i, the person must take day i + 1 off and perform no tasks.
No write-up yet. Related questions below have one.
Related MindTickle questions
Collected from public candidate posts and coding forums. Updated Nov 2026.