InterviewBit Problems   Matrix Search : Solved


About the Matrix Search : Solved category (1)
Simplest C code..didn't know it will work XD (2)
Optimal solution using two binary searches along row and column.I am thinking it's time complexity is o(log(nm)).Is it true.What is the time complexity.Thanks (1)
Easy C++ solution, O(log(M*N)) (1)
Can anyone please tell me why my soln is giving time lmit exceeded? (1)
Simple O(log(mn)) C++ solution (1)
Java Solution just like binary search (2)
O(n) c++ simplest solution (1)
Java solutionn like 1D array binary search (1)
Short 2 line code for Cplusplus (1)
Simple and easy to understand C++ code (1)
Easy C++ solutionnnn (1)
C++ solution. Is it wrong? (1)
C++ solutionnn easy (1)
C++ O(logn+logm) (1)
Solution in C++ Easy one.. Try this! (1)
Consider it as a 1D array O(log(n*m)) (3)
Easy to Understand JAVA (1)
Have a look at my sol (1)
Python solution: O(log(n)+log(m)) (3)
First find the row and then the col (easy C++) (2)
Matrix Search made simple (1)
Simple approach matrix search (1)
O(logm + logn) in 14 lines (1)
Log(m) +log(n) simple solution (1)
Simple C++ solution O(max(m,n)) in worst case (1)
Time complexity nlogn (1)
Python solution :) (1)
Simple solution in c++(staircase search) (1)
100% faster ever (2)