benchmarks.wiki

benchmarks.wiki / Public workspace

MBPP / 689 / write a function to find the minimum number of jumps to reach the end of the…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

test list

  • assert min_jumps([1, 3, 6, 1, 0, 9], 6) == 3
  • assert min_jumps([1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9], 11) == 3
  • assert min_jumps([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 11) == 10

text

## write a function to find the minimum number of jumps to reach the end of the array for the given array of integers where each element represents the max number of steps that can be made forward from that element. > indented block > indented block

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
689
task_id
2b661a0e-435c-5b67-a338-e7f9a35d03bb
task_key
full--train--689
task_revision_id
1
config / split
full / train

Official source

initial import