You are given an integer n representing the total number of floors in a building, where floors are indexed from $0$ to n $- 1$. You are also given an integer array requests.

An elevator begins at floor $0$ and processes each request in requests in the given order. Moving between any two floors takes an amount of time equal to the absolute difference between their floor numbers.

Return the total time required to complete all requests.

Constraints:

• $1 \leq$ n $\leq 100$

• $1 \leq$ requests.length $\leq 100$

• $0 \leq$ requests[i] $\leq$ n $- 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.