I went through seven rounds of interviews, only to be told at the end that the position I was interviewing for was no longer available. I chatted with the recruiter, and they confirmed that I had met all the criteria and had performed exceptionally well in the final round interviews. Essentially, I should have received an offer, but a mistake was made.

This mishap by Yelp cost me a significant amount of time and energy in preparation. The interviewers were very good, polite, and answered all questions, proving easy to work with.

The interview process included:

• First round: Offline coding test on HackerRank
• Second round: Chat with the Tech Recruiter
• Third round: Data structure and algorithm-based question on Yelp Beans (internal product)
• Final rounds: Two technical and two non-technical rounds covering problem-solving, software engineering, behavioral aspects, and teamwork.

Given the test_data, which is a list of restaurant names, and a search term, return at most k restaurant names that start with the search term.

Part 2 - Implement something that will return at most k restaurant names that either start with the search term (prefix) or contain the search term (infix).

Prioritize returning prefix-based suggestions first. Only if you have less than k suggestions, 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" ]