I have been trying to find if a given sorted array contains 2 numbers having the given sum. For 1 d array I figured but for 2 d array is not working
Given a 2D array sorted row wise and column wise how to find if a given number can be represented as a sum of 2 numbers from the array in an efficient manner.
Trying this problem but not finding a solution.