You are given an array of integers nums and an integer key.

An integer target follows key if there is at least one index i such that $0 \leq i <$ nums.length $- 1$, nums[i] is equal to key, and nums[i + 1] is equal to target.

Return the integer target that appears the most times immediately after an occurrence of key.

Constraints:

• $2 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 1000$

• The test cases are generated such that the answer is 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.