You are given a string s of even length. Split this string into two halves of equal length, letting a be the first half and b be the second half.

Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'). Notice that s contains both uppercase and lowercase English letters.

Return true if a and b are alike, or false otherwise.

Constraints:

• $2 \le$ s.length $\le 1000$

• s.length is even.

• s consists of uppercase and lowercase 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.