def searchMatrix(self, mat, target):
        """
        Manhattan work
        O(m+n) eliminate a row or a column at a time
        Practically: 112 ms

        :type mat: list[int][int]
        :type target: int
        :rtype: bool
        """
        m = len(mat)
        n = len(mat[0])

        i = 0
        j = 1-n
        while i < m and 0 <= j:
            if mat[i][j] == target:
                return True
            elif mat[i][j] > target:
                j -= 1
            else:
                i += 1

        return False
dataset/ETHPy150Open algorhythms/LeetCode/240 Search a 2D Matrix II.py/Solution.searchMatrix/swapped operands of `-`