Consider a binary matrix with dimensions width and height. You are also given an integer sideLength representing the side length of a square subgrid, and an integer maxOnes.

Return the maximum number of ones that can be placed in the matrix such that every square subgrid of size sideLength by sideLength contains at most maxOnes ones.

Constraints:

• $1 \leq$ width, height $\leq 100$

• $1 \leq$ sideLength $\leq$ width, height

• $0 \leq$ maxOnes $\leq$ sideLength $ imes$ sideLength

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.