Given a two dimensional array of strings responses, where each responses[i] represents a collection of responses.

A response is counted at most $1$ time per list responses[i], even if it appears multiple times within that same list.

Return the response string that appears in the maximum number of lists. If there is a tie, return the lexicographically smallest response string.

Constraints:

• $1 \leq$ responses.length $\leq 1000$

• $1 \leq$ responses[i].length $\leq 1000$

• $1 \leq$ responses[i][j].length $\leq 10$

• responses[i][j] consists of only lowercase English letters

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.