You are given two integer arrays nums1 and nums2.

The numbers of nums1 and nums2 are placed on two separate horizontal lines in their original order. You may draw connecting lines between elements where a line connects nums1[i] and nums2[j] such that:

• nums1[i] == nums2[j]

• The line does not intersect with any other drawn line.

Return the maximum number of uncrossed connecting lines that can be drawn.

Note: A connecting line cannot intersect another line at any point, including its endpoints, which means each position in nums1 and nums2 can be connected at most once.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 500$

• $1 \leq$ nums1[i], nums2[j] $\leq 2000$

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.