Given a binary array nums and an integer k, return true if all $1$’s are separated by at least k places from each other, or false otherwise.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ k $\leq$ nums.length

• nums[i] is either $0$ or $1$

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.