benchmarks.wiki

benchmarks.wiki / Public workspace

CRUXEval / sample_385 / [0, 2, 1, 2, 6, 2, 6, 3, 0]

Problem

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

code

Code

def f(lst):
    i = 0
    new_list = []
    while i < len(lst):
        if lst[i] in lst[i+1:]:
            new_list.append(lst[i])
            if len(new_list) == 3:
                return new_list
        i += 1
    return new_list

input

  • 0
  • 2
  • 1
  • 2
  • 6
  • 2
  • 6
  • 3
  • 0

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. 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. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

upstream_id / Original problem ID
sample_385
task_id
00a3c47e-0e4a-5177-aaf1-20a219b1a76d
task_key
default--test--sample~5f385
task_revision_id
1
config / split
default / test

Official source

initial import