Given an array of strings, strs, write a function to find the longest common prefix string in strs. If there is no common prefix, return an empty string, "".

Constraints:

• $1 \leq$ strs.length $\leq 200$

• $0 \leq$ strs[i].length $\leq 200$

• strs[i] consists of only lowercase English letters.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to 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 main.py in the following coding playground: