A sentence is defined as a sequence of words separated by single spaces, without any leading or trailing spaces.

Given a sentence s and an integer k, truncate s such that it contains only its first k words. Return the resulting string.

Constraints:

• $1 \le s. length \le 500$

• k is in the range $[1, the \space number \space of \space words \space in \space s]$.

• s consists of only lowercase and uppercase English letters and spaces.

• The words in s are separated by a single space.

• There are no leading or trailing spaces.

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.