โ† Aptean questions

Minimum cost to cross array with forward and backward jumps

Filed under Aptean

The question

Given an array A of N integers, find the minimum cost required to cross the array by starting from the first element. You can make forward jumps of length 2 and backward jumps of length 1, where the cost of jumping from index i is the value of A[i].

No write-up yet. Related questions below have one.

Related Aptean questions

Collected from public candidate posts and coding forums. Updated Nov 2026.