You are given a string sentence containing words separated by single spaces, and an integer k.

You need to split sentence into multiple rows such that:

• The words in each row remain in their original order.

• The words within each row are separated by a single space.

• The total length of any row does not exceed k.

The cost of each row with length $L$ is $(k - L)^2$, except for the last row which has a cost of $0$.

Return the minimum total cost to divide sentence into rows.

Constraints:

• $1 \leq$ sentence.length $\leq 5000$

• $1 \leq$ k $\leq 5000$

• The length of each word in sentence is at most k.

• sentence consists of only lowercase English letters and spaces.

• sentence does not begin or end with a space.

• Words in sentence are separated by a single space.

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.