InterviewBit Problems
Matrix Search : Unsolved
About the Matrix Search : Unsolved category
(1)
O(nlog(m)) solution in c++
(1)
Can somebody tell my error?
(1)
Easy C++ soln with intuitive approach
(1)
Easy and simple Cpp solution
(1)
Simple and efficient C++ approach
(1)
Cout<<"simple solution with O(log(m+n)) time compelxity and O(1) space complexity "
(1)
O(log(nm)) Solution for this question elegant
(1)
Simple c++ implementation Using binary search
(1)
O(n+m) and log(nm) simple solutions in C++;
(1)
C++ O(n) simplest solution
(2)
Working C++ soln but have doubt
(2)
What is the criteria to get a UNICORN?
(3)
Can someone pls tell why is it showing Wrong Answer
(2)
Please Run this solution with given test case and tell me the issue
(1)
Why TLE in the following code?
(1)
What is error in my code showing runtimeerror ,array index out of bounds
(1)
Hint: First binary search to locate row index, then binary search in row to check if element is present
(1)
Simple O(R+C) time complexity
(1)
What is the error in my code?
(2)
Somebody please tell time complexity of this
(2)
Where is the 2D array
(2)
Concise Java Solution
(1)
Calculating col size of 2-d vector
(5)
Log(m*n) method, What is wrong with my code ? It doesnt work on one column matrix but it works on GFG for that same test case
(1)
SOmebody explain this approach. It works but i dont know why!
(2)
Custom input is giving the right answer but while submitting is shows different output. Please help in this!
(2)
Just a quick hint to get you thinking right
(1)
TLE for O(log(mn))
(3)
I'm getting wrong answer for following case but get right answer if I run it as a custom input
(1)
next page →