Given a binary string s, return true if the longest contiguous segment of $1$s is strictly longer than the longest contiguous segment of $0$s in s, or return false otherwise.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s[i] is either '0' or '1'.

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.