benchmarks.wiki / Public workspace

MBPP / 286 / Write a function to find the largest sum of a contiguous array in the modified…

Problem

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

prompt

Write a function to find the largest sum of a contiguous array in the modified array which is formed by repeating the given array k times.

test list

  • assert max_sub_array_sum_repeated([10, 20, -30, -1], 4, 3) == 30
  • assert max_sub_array_sum_repeated([-1, 10, 20], 3, 2) == 59
  • assert max_sub_array_sum_repeated([-1, -2, -3], 3, 3) == -1

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

Official source

initial import