Given two sparse matrices mat1 of size m × k and mat2 of size k × n, return the result of matrix multiplication mat1 × mat2.

Constraints:

• m == mat1.length

• k == mat1[i].length == mat2.length

• n == mat2[i].length

• $1 \leq$ m, n, k $\leq 100$

• $-100 \leq$ mat1[i][j], mat2[i][j] $\leq 100$

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.