benchmarks.wiki / Public workspace

MBPP / 895 / Write a function to find the maximum sum of subsequences of given array with no…

Problem

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

test list

  • assert max_sum_subseq([1, 2, 9, 4, 5, 0, 4, 11, 6]) == 26
  • assert max_sum_subseq([1, 2, 9, 5, 6, 0, 5, 12, 7]) == 28
  • assert max_sum_subseq([1, 3, 10, 5, 6, 0, 6, 14, 21]) == 44

text

Write a function to find the maximum sum of subsequences of given array with no adjacent elements.

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