You are given four integer arrays: landStartTime, landDuration, waterStartTime, and waterDuration.

There are $n$ land rides and $m$ water rides available:

• The $i^{ {th}}$ land ride opens at time landStartTime[i] and takes landDuration[i] time to complete.

• The $j^{ {th}}$ water ride opens at time waterStartTime[j] and takes waterDuration[j] time to complete.

You must complete exactly one land ride and exactly one water ride in any order.

A ride cannot begin before its opening time. If you arrive at a ride after it opens, you may start it immediately.

Return the earliest possible time by which you can finish both rides.

Constraints:

• $1 \leq n, m \leq 5 \times 10^4$

• landStartTime.length $==$ landDuration.length $== n$

• waterStartTime.length $==$ waterDuration.length $== m$

• $1 \leq$ landStartTime[i], landDuration[i], waterStartTime[j], waterDuration[j] $\leq 10^5$

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.