Given a n x n square matrix, find the sum of all sub-squares of size k x k

Given a n x n square matrix, find the sum of all sub-squares of size k x k is a DSA topic. In plain words you use it for a short Given a n x n square matrix, find the sum of all sub-squares of size k x k example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Given a n x n square matrix, find the sum of all sub-squares of size k x k example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Given a n x n square matrix, find the sum of all sub-squares of size k x k.

From the example next to this theory: Given a n x n square matrix, find the sum of all sub-squares of size k x k — arrays give O(1) index access; matrices are arrays of arrays.

Trap: only saying “Given a n x n square matrix, find the sum of all sub-squares of size k x k” with no example. Fix that before you talk about advanced DSA.

Viva: what is Given a n x n square matrix, find the sum of all sub-squares of size k x k? Then show the smallest Given a n x n square matrix, find the sum of all sub-squares of size k x k example you can type. Then name the trap.

Exam tip

What is Given a n x n square matrix, find the sum of all sub-squares of size k x k? Show this: the smallest Given a n x n square matrix, find the sum of all sub-squares of size k x k example you can type. Trap: only saying “Given a n x n square matrix, find the sum of all sub-squares of size k x k” with no example.

Example

arr = [10, 20, 30, 40]
print(arr[2], arr[-1])
matrix = [[1, 2], [3, 4]]
print(matrix[1][0])  # 3

Given a n x n square matrix, find the sum of all sub-squares of size k x k — arrays give O(1) index access; matrices are arrays of arrays.

Short notes

DefGiven a n x n square matrix, find the sum of all sub-squares of size k x k — a short Given a n x n square matrix, find the sum of all sub-squares of size k x k example in a short dry-run on paper.
Rulethe smallest Given a n x n square matrix, find the sum of all sub-squares of size k x k example you can type
Traponly saying “Given a n x n square matrix, find the sum of all sub-squares of size k x k” with no example
Usea short dry-run on paper

Given a n x n square matrix, find the sum of all sub-squares of size k x k

From the example next to this theory: Given a n x n square matrix, find the sum of all sub-squares of size k x k — arrays give O(1) index access; matrices are arrays of arrays.

Trap: only saying “Given a n x n square matrix, find the sum of all sub-squares of size k x k” with no example. Fix that before you talk about advanced DSA.

Exam tip

Example

arr = [10, 20, 30, 40]
print(arr[2], arr[-1])
matrix = [[1, 2], [3, 4]]
print(matrix[1][0])  # 3

Given a n x n square matrix, find the sum of all sub-squares of size k x k — arrays give O(1) index access; matrices are arrays of arrays.

Short notes

DefGiven a n x n square matrix, find the sum of all sub-squares of size k x k — a short Given a n x n square matrix, find the sum of all sub-squares of size k x k example in a short dry-run on paper.
Rulethe smallest Given a n x n square matrix, find the sum of all sub-squares of size k x k example you can type
Traponly saying “Given a n x n square matrix, find the sum of all sub-squares of size k x k” with no example
Usea short dry-run on paper

Given a n x n square matrix, find the sum of all sub-squares of size k x k

Example

Short notes

Questions

Given a n x n square matrix, find the sum of all sub-squares of size k x k

Example

Short notes

Questions