Return dictionary words matching a prefix
Quick Overview
This problem evaluates string-processing and filtering skills, focusing on exact prefix matching, case sensitivity, duplicate handling, and edge-case management over arrays of strings. Commonly asked in Coding & Algorithms interviews, it assesses practical implementation ability and understanding of algorithmic complexity at an implementation-level (basic to intermediate).
Google
Mar 9, 2026, 12:00 AM
Software Engineer
Technical Screen
Coding & Algorithms
14
0
You are given a list of strings words (a dictionary) and a string prefix.
Return all words in words that start with prefix.
Clarifications/constraints:
- Matching is case-sensitive.
- If no words match, return an empty list.
-
If
wordscontains duplicates, include duplicates in the output. - You may return the result in any order unless the interviewer asks for a specific ordering (e.g., lexicographic).