# Leetcode 74 - Search a 2D matrix

`Note:`

- Use
`binary search`

by concating all elements together to form a sorted array. - Different ways to flat an array
`array.flat()`

(Not working in IE.)`[].concat(...array)`

- Also, remember add or minus
`1`

toward`middle`

otherwise it wonâ€™t work.. (Silly mistake)

`Question:`

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

- 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.

`Example:`

1 | Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3 |

`Code:`

1 | /** |