benchmarks.wiki

benchmarks.wiki / Public workspace

MBPP / 366 / Write a python function to find the largest product of the pair of adjacent…

Problem

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

test list

  • assert adjacent_num_product([1,2,3,4,5,6]) == 30
  • assert adjacent_num_product([1,2,3,4,5]) == 20
  • assert adjacent_num_product([2,3]) == 6

text

Write a python function to find the largest product of the pair of adjacent elements from a given list of integers.

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
366
task_id
3286a0dd-86c6-56df-8e13-1986bb15955e
task_key
full--test--366
task_revision_id
1
config / split
full / test

Official source

initial import