Daily Coding Problem: Problem #806 [Hard]

Good morning! Here's your coding interview problem for today.

This problem was asked by Google.

Let A be an N by M matrix in which every row and every column is sorted.

Given i₁, j₁, i₂, and j₂, compute the number of elements of M smaller than M[i₁, j₁] and larger than M[i₂, j₂].

For example, given the following matrix:

[[1, 3, 7, 10, 15, 20],
 [2, 6, 9, 14, 22, 25],
 [3, 8, 10, 15, 25, 30],
 [10, 11, 12, 23, 30, 35],
 [20, 25, 30, 35, 40, 45]]

And i₁ = 1, j₁ = 1, i₂ = 3, j₂ = 3, return 15 as there are 15 numbers in the matrix smaller than 6 or greater than 23.

Upgrade to premium and get in-depth solutions to every problem, including this one. Since you were referred by one of our affiliates, you'll get a 10% discount on checkout!

If you liked this problem, feel free to forward it along so they can subscribe here! As always, shoot us an email if there's anything we can help with!

Master algorithms together on Binary Search. Create a room, invite your friends, and race to finish the problem!

No more? Snooze or unsubscribe.