# Given the test_data which is a list of restaurant names, and given a search
# term, return at most k restaurant names that start with the search term.
# Part 2 - Implement something which will return at most k restaurant names
# that either start with the search term (prefix) or contain the search term
# (infix). Prioritise returning the prefix based suggestions first,
# only if you have less than k, then return infix suggestions.
test_data = [
"Burgburger king",
"Burger King",
"DDI Steakhouse",
"Bob's Burgers",
"Bob's Pizza",
"DDI Diner",
"Super Duper Burgers",
"Wahlburgers",
"In-n-Out Burgers",
"Burgers Burger King"
]