hard20 pts · first answer countsarraysmatrixbinary-search
Search a matrix sorted by rows and columns
Each row and each column of an m × n matrix is sorted ascending, but rows can overlap. Which search runs in O(m + n)?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer