Given an integer array nums and two integers firstLen and secondLen, return the maximum sum of elements in $2$ non overlapping subarrays of lengths firstLen and secondLen.

The subarrays must be contiguous segments of the array that do not intersect. The subarray of length firstLen may occur before or after the subarray of length secondLen.

Constraints:

• $1 \leq$ firstLen, secondLen $\leq 1000$

• $2 \leq$ firstLen $+$ secondLen $\leq 1000$

• firstLen $+$ secondLen $\leq$ nums.length $\leq 1000$

• $0 \leq$ nums[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.