You are given an array of integers nums of length $n$.

You need to partition nums into $3$ contiguous, non empty, and disjoint subarrays. The cost of a partition is defined as the sum of the first element of each of the $3$ subarrays.

Return the minimum possible total cost of partitioning the array.

Constraints:

• $3 \leq n \leq 50$

• $1 \leq$ nums[i] $\leq 50$

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.