benchmarks.wiki

benchmarks.wiki / Public workspace

CRUXEval / sample_249 / FSA"

Problem

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

code

Code

def f(s):
    count = {}
    for i in s:
        if i.islower():
            count[i.lower()] = s.count(i.lower()) + count.get(i.lower(), 0)
        else:
            count[i.lower()] = s.count(i.upper()) + count.get(i.lower(), 0)
    return count

input

FSA

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_249
task_id
b598e0d0-cd98-5598-90bb-5baa5465d8b2
task_key
default--test--sample~5f249
task_revision_id
1
config / split
default / test

Official source

initial import