You are given a list days, where days[i] represents a calendar day on which you plan to travel. You are also given travel pass costs for three different durations:

• A $1$-day pass costs costs[0].

• A $7$-day pass costs costs[1].

• A $30$-day pass costs costs[2].

A pass bought on day $d$ covers travel starting from day $d$ and continues for its full duration. For example, a $7$-day pass bought on day $d$ covers days $d$ through $d + 6$.

Return the minimum total cost needed to cover all travel days in days.

Constraints:

• $1 \leq$ days.length $\leq 365$

• $1 \leq$ days[i] $\leq 365$

• days is in strictly increasing order

• costs.length $== 3$

• $1 \leq$ costs[i] $\leq 1000$

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.