benchmarks.wiki

benchmarks.wiki / Public workspace

MBPP / 245 / Write a function that takes an array and finds the maximum sum of a bitonic…

Problem

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

prompt

Write a function that takes an array and finds the maximum sum of a bitonic subsequence for the given array, where a sequence is bitonic if it is first increasing and then decreasing.

test list

  • assert max_sum([1, 15, 51, 45, 33, 100, 12, 18, 9]) == 194
  • assert max_sum([80, 60, 30, 40, 20, 10]) == 210
  • assert max_sum([2, 3 ,14, 16, 21, 23, 29, 30]) == 138

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
245
task_id
304b1b65-8458-51db-9453-5fa44c2f1a5f
task_key
sanitized--test--245
task_revision_id
4
config / split
sanitized / test

Official source

initial import