Given an array of strings strs, return the length of the longest uncommon subsequence among them. If no uncommon subsequence exists, return $-1$.

An uncommon subsequence is defined as a string that is a subsequence of one string in strs but not a subsequence of any other string in strs.

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

Constraints:

• $2 \leq$ strs.length $\leq 50$

• $1 \leq$ strs[i].length $\leq 10$

• strs[i] consists of 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.