You are given an integer array nums and an integer k.

You need to partition nums into one or more non empty contiguous subarrays. The cost of a partition is defined as the sum of the importance values of each subarray in the partition.

The importance value of a subarray is $k + ext{trimmed}( ext{subarray}) ext{.length}$, where $ ext{trimmed}( ext{subarray})$ is obtained by removing all elements from the subarray that appear exactly once within it.

Return the minimum possible total cost to split nums.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $0 \leq$ nums[i] $<$ nums.length

• $1 \leq$ k $\leq 10^9$

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.