You are given an integer array nums. A subsequence of nums is called a square streak if:

• The length of the subsequence is at least $2$.

• After sorting the subsequence in strictly ascending order, each element after the first is equal to the square of the preceding element.

Return the maximum length of a square streak in nums, or return $-1$ if no square streak exists.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

• $2 \leq$ nums[i] $\leq 10^5$

Input: nums = [49,2401]-List[int]
Output: 2-int
Explanation: After sorting, 49 is followed by 2401, and 2401 equals \(49^2\), forming a square streak of length 2.

Input: nums = [10,11,12,13]-List[int]
Output: -1-int
Explanation: No two elements form a square relationship, so no square streak exists.

Input: nums = [6561,3,81,9,42]-List[int]
Output: 4-int
Explanation: Sorting the valid subsequence gives [3, 9, 81, 6561], where each element is the square of the preceding element, resulting in a streak of length 4.

Input: nums = [2,4,16,256,65536]-List[int]
Output: 5-int
Explanation: The entire array forms a square streak because 4 equals \(2^2\), 16 equals \(4^2\), 256 equals \(16^2\), and 65536 equals \(256^2\), giving a length of 5.

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.