Closed raghavddps2 closed 3 years ago
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Put this in the medium folder.
Integers in each row are sorted from left to right. The first integer of each row is greater than the last integer of the previous row.
Input and Output format Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]], target = 3 Output: true
Write a program in go for the same
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Put this in the medium folder.
Input and Output format Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]], target = 3 Output: true
Write a program in go for the same