You are given an integer n representing an array containing the sequence of integers from $1$ to n in increasing order.

You are also given a $2$D integer array conflictingPairs, where each conflictingPairs[i] = [a, b] represents a pair of conflicting numbers.

A contiguous subarray is considered valid if it does not contain both elements of any conflicting pair present in conflictingPairs.

You may remove at most one conflicting pair from conflictingPairs.

Return the maximum possible number of valid subarrays after removing at most one conflicting pair.

Constraints:

• $2 \leq$ n $\leq 10^5$

• $1 \leq$ conflictingPairs.length $\leq 2 imes$ n

• conflictingPairs[i].length $= 2$

• $1 \leq$ conflictingPairs[i][j] $\leq$ n

• conflictingPairs[i][0] $\neq$ conflictingPairs[i][1]

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.