benchmarks.wiki

benchmarks.wiki / Public workspace

MBPP / 863 / Write a function to find the length of the longest sub-sequence such that…

Problem

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

test list

  • assert find_longest_conseq_subseq([1, 2, 2, 3], 4) == 3
  • assert find_longest_conseq_subseq([1, 9, 3, 10, 4, 20, 2], 7) == 4
  • assert find_longest_conseq_subseq([36, 41, 56, 35, 44, 33, 34, 92, 43, 32, 42], 11) == 5

text

Write a function to find the length of the longest sub-sequence such that elements in the subsequences are consecutive 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
863
task_id
29b2f29b-4d1c-561e-9d46-8f36e14d9d8c
task_key
full--train--863
task_revision_id
1
config / split
full / train

Official source

initial import