I had the same experience as one of the candidates mentioned below.

I'm a bit flummoxed because it seems like my answers to the code screen were correct, but they said they were wrong or that I solved the wrong problem.

I also tested the solution for the second problem, but they said I solved the wrong problem.

I forgot to save the questions with their exact wording, but I would recommend applicants save the questions (for personal use, to double-check if their answers are actually incorrect).

There are 10,000 different orders. Each order is a combination of different food items. We want to find the most popular base choice.

The most popular base choice is defined as a combination of different food items, including one additional item. For example, if you have orders for "pizza, hamburger", "pizza hamburger", "pizza hamburger soda", and "pizza hamburger fries", the total count for the "pizza hamburger" food choice would be 4.

So, design an algorithm to find the most popular food base choice and describe its time complexity.

There is a grid with guards (represented by int 2), empty spaces (represented by int 0), and other objects (represented by int 1). There is a pillar, with guards standing between the pillars. A guard can only look in two directions. For a given guard, find how many empty spaces are on both its sides before hitting an object or another guard.