AceStack AI

Coding (Algo)

Count Matching Name Prefixes

Algorithm: Prefix matching Difficulty: Easy Time: 20 minutes

Goal

Return how many entries in words begin with prefix, counting duplicates as separate matching records.

What this task practices

Count Matching Name Prefixes is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as easy difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.

Sign in to startThe workspace and evaluation open after sign in.