7. Report Writer (2)

Time Limit: N/A seconds

Memory Limit: N/A MB

Rating: 900

Problem Statement

Due to the success of these superheroes, many companies want to see which heroes are the most popular to market. Create a searching algorithm which counts how many times a certain superhero appears in a report.

Input

Not available for this problem.

Output

Not available for this problem.

Sample Cases

Not available for this problem.

Explanation

Not available for this problem.

Sources

KL Coding Cup 2022 > Problem 2 > Intermediate League

Submit | Back