← Walmart questions
CodingMedium-HardReported in a candidate post, Aug 2021

Minimum Cost to Reach Position N with Jumps

Filed under Walmart

Find the minimum cost to reach index N from index 1 in an array of size N. You can jump up to K steps. Jumping between indices with equal values costs 0, otherwise it costs X.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Walmart questions

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