InterviewBit Problems
REC_CMPL1 : Unsolved
About the REC_CMPL1 : Unsolved category
(1)
Can Someone please explain why O(n)?
(8)
Is the logic or the thinking correct is correct?
(1)
How does this function end?
(2)
Isn’t the if conditions useless?
(4)
Didnt got the answer plz explain in detail
(2)
I guess this Algorithm contain some bug
(2)
Ans shoukd be log(n) as this is same of binary search tree which has its worst case when the key is found at the leaf
(5)
What does this return statement actually doing?
(3)
How can Someone know to take alll the elements of the array similar for this program snippets?
(3)
Deceptive question... but fun :)
(1)
Why O(N) time complexity explained:
(2)
Intuition of O(n)
(1)
How do we get O(n)?
(1)
O(n) is write ans
(1)
Wrong answer for the question
(5)
Proposed solution is wrong
(8)
I think recurrence is T(n)=3T(n/2)+c ,In worst case three recursive calls are mad
(2)
Recurrence for solution
(2)
Problem with answer selection
(1)
Wrong Answer may be
(2)
Wrong ans may be
(1)
Possible mistake on the answer problem
(4)
Solution not clear
(1)
Three recurrences are called in the function in worst case...one recurrence is ca
(1)
next page →