Algorithm · Ebay · Medium
You have a word made of lowercase English letters and a list skeletons of strings, each the same length as word. A skeleton contains lowercase English letters plus the character '-', which works as a placeholder that might be satisfied under the rules below. A skeleton matches word if it passes two checks: For every index i where the skeleton has a letter (not '-'), that letter must equal word[i]. For every index i where the skeleton has a '-', the character word[i] must…
Checking your access…