leetle

Daily challenge for 2026-07-25

571. Alternating Jump Maximum Score

You are given an array of integers scores representing the points available at each platform. You start at index 0 and want to reach the last index of the array.

At each step, you can jump forward by either 1 platform or 2 platforms. However, to avoid fatigue, you **cannot make two consecutive jumps of size 2**.

Return the maximum score you can collect by reaching the last platform.

Example:
Input: scores = [1, 10, 2, 10, 3]
Output: 26

Explanation: One optimal path is jumping 1 step to index 1, then 1 step to index 2, then 1 step to index 3, and 1 step to index 4. Total score is 1 + 10 + 2 + 10 + 3 = 26.

Run this challenge interactively in Python or JavaScript when the app loads.