You are given an integer array nums of length $n$, where nums is a permutation of the numbers in the range $[0, n - 1]$.

You should build a set s[k] = \\{ nums[k], nums[nums[k]], nums[nums[nums[k]]], \dots \\} subjected to the following rule:

• The first element in $s[k]$ starts with the selection of the element nums[k] of index $k$.

• The next element in $s[k]$ should be nums[nums[k]], and then nums[nums[nums[k]]], and so on.

• We stop adding right before a duplicate element occurs in $s[k]$.

Return the longest length of a set $s[k]$.

Constraints:

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

• $0 \leq$ nums[i] $<$ nums.length

• All the values of nums are unique.

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.