You are given an integer array nums.

You can increase the value of any element in nums by at most $1$. Each element can be modified at most once.

After applying any number of these operations, select a collection of elements from the resulting array such that they form a sequence of consecutive integers when sorted in ascending order.

Return the maximum number of elements you can select.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^6$

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.