You have a pointer starting at index $0$ in an array of length arrLen.

At each step, you can perform one of the following moves:

• Move $1$ position to the left

• Move $1$ position to the right

• Stay in the same position

The pointer must remain within the array boundaries at all times.

Given two integers steps and arrLen, return the number of ways to end up at index $0$ after exactly steps steps. Since the answer can be large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ steps $\leq 500$

• $1 \leq$ arrLen $\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.