You are given two integer arrays of length $2$, d = [d_1, d_2] and r = [r_1, r_2].

There are two delivery drones:

• The first drone must complete d[0] deliveries and must recharge at every hour that is a multiple of r[0].

• The second drone must complete d[1] deliveries and must recharge at every hour that is a multiple of r[1].

At any given hour $t$ (starting from hour $1$):

• A drone cannot make a delivery during an hour it is recharging.

• At most one drone can make a delivery during that hour.

Return the minimum number of hours required for both drones to complete all deliveries.

Constraints:

• d.length $= 2$

• r.length $= 2$

• $1 \le$ d[i] $\le 10^9$

• $2 \le$ r[i] $\le 3 imes 10^4$

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.