You are given an integer array widths of length $26$ and a string s. The array widths indicates the width of each lowercase English letter, where widths[0] is the width of 'a', widths[1] is the width of 'b', and so on up to widths[25] for 'z'.

You start writing the characters of s line by line from left to right. Each line has a maximum width capacity of $100$ units. When adding a character to the current line, if its width would cause the total width of the line to exceed $100$ units, the entire character must be placed at the beginning of a new line.

Return an array of two integers where the first integer represents the total number of lines used, and the second integer represents the width used on the final line.

Constraints:

• widths.length $= 26$

• $2 \leq$ widths[i] $\leq 10$

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

• s contains only lowercase English letters.

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.