Practice eBay Coding Question | Real Coding Interviews

Quick Summary

Validate string patterns where dashes act as wildcards constrained by existing characters.
Check exact character matches at fixed positions while ensuring wildcard positions reference available non-wildcard characters.
Filter and return all valid patterns while preserving their original input order.

What This Tests

String iteration and conditional validation
Hash set usage for efficient membership checking
Algorithmic decomposition into preprocessing and verification phases
Time and space complexity optimization

Common Patterns

Hashing

String Manipulation

You are given a string word consisting of lowercase English letters and an array of strings skeletons. Each skeleton has the same length as word and consists of lowercase English letters and the character '-', which marks a position that may be filled according to the matching rules below.

A skeleton matches word when both of the following conditions hold:

At every non-dash position i, skeleton[i] must equal word[i].

Test Cases

Input

Output

Expected