You are given two integer arrays energyDrinkA and energyDrinkB, both of length n, representing the energy boost gained from consuming drink A and drink B across n consecutive hours.

During each hour, you can choose to drink either energy drink A or energy drink B:

• Consuming energy drink A at hour i provides energyDrinkA[i] energy boost.

• Consuming energy drink B at hour i provides energyDrinkB[i] energy boost.

If you choose to switch between drinks, you must spend $1$ hour to clean your system, during which you receive $0$ energy boost.

Return the maximum total energy boost you can achieve across all n hours.

Constraints:

• n == energyDrinkA.length == energyDrinkB.length

• $3 \leq$ n $\leq 10^5$

• $1 \leq$ energyDrinkA[i], energyDrinkB[i] $\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.