Prefix Search I

Problem

You are provided with a list of business names called bizNames. Write a function that searches these names and returns the top k that contain a specific prefix. The prefix can appear at the beginning of any word within a business name, and the search should be case-insensitive.

Results are ordered using two criteria:

1. Word Position: The primary ranking is the index of the word where the prefix match first occurs. A match at word index 0 (the first word) is ranked higher than a match at word index 1 (the second word), and so on.
2. Alphabetical Tie-break: If two names have the same earliest matching word position, they are sorted alphabetically (lexicographically).

Constraints

• Each business name is a non-empty string made up of words delimited by a single space.
• The prefix is a non-empty string. Matching is case-insensitive.
• k is a positive integer.

Examples

Example 1:

Example 2:

Example 3:

Explanation:

• For "Alpha Beta", the prefix "alpha" matches the first word "alpha" at index 0.
• "Alpha Gamma" also finds a match at index 0 with "alpha". "Beta Alpha" finds its first match at index 1 with "alpha", and "AlphaGo" matches at index 0. The index-0 matches are "Alpha Beta", "Alpha Gamma", and "AlphaGo". The top 2 by alphabetical order among these are "Alpha Beta" and "Alpha Gamma".