You are given an integer array tickets where tickets[i] is the number of tickets the $i$th person in a queue wants to buy. The queue is processed in rounds as follows.

At each second, the person at the front of the queue buys exactly one ticket, decreasing their remaining count by $1$. If they still need more tickets, they move to the back of the queue. Otherwise, they leave the queue.

Given an index k, return the total number of seconds required until the person who initially starts at position k has purchased all of their tickets.

Note: The index k refers to the person’s original position in the initial queue.

Constraints:

• $`n` == `tickets.length`$

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

• $1 \leq `tickets[i]` \leq 100$

• $0 \leq `k` < `n`$

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.