I was recently given this interview question and I\'m curious what a good solution to it would be.
Say I\'m given a 2d array where all the numbers i
A. Do a binary search on those lines where the target number might be on.
B. Make it a graph : Look for the number by taking always the smallest unvisited neighbour node and backtracking when a too big number is found
I suggest, store all characters in a 2D list
. then find index of required element if it exists in list.
If not present print appropriate message else print row and column as:
row = (index/total_columns)
and column = (index%total_columns -1)
This will incur only the binary search time in a list.
Please suggest any corrections. :)