The $k$ beauty of an integer num is defined as the number of substrings of num, when viewed as a string, that satisfy the following conditions:

• The substring has a length equal to k.

• The integer value represented by the substring divides num evenly.

Return the $k$ beauty of num.

Note:

• Leading zeros in substrings are permitted.

• The value $0$ is not a divisor of any integer.

• Substrings may overlap.

Constraints:

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

• $1 \leq$ k $\leq$ num.length (taking num as a string)

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.