benchmarks.wiki

benchmarks.wiki / Public workspace

CRUXEval / sample_558 / [3, 1, 2, 1, 4, 1], [1]

Problem

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

code

Code

def f(nums, mos):
    for num in mos:
        nums.pop(nums.index(num))
    nums.sort()
    for num in mos:
        nums += [num]
    for i in range(len(nums)-1):
        if nums[i] > nums[i+1]:
            return False
    return True

input

[3, 1, 2, 1, 4, 1], [1]

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_558
task_id
0fc45f82-677d-5633-8c6d-6998303539ea
task_key
default--test--sample~5f558
task_revision_id
1
config / split
default / test

Official source

initial import