InterviewBit Problems
Noble Integer : Solved
Not getting one test case correct
(1)
A very simple O(n) time and O(n) space C++
(1)
Simple c++ O(n) solution
(2)
Simple c++ solution o(nlogn)
(1)
Solution in java O(nlogn)
(1)
Same algo, partially right in cpp, excellent in python
(1)
My Solution in O(nlogn) Sort + Upper Bound
(1)
Why its giving wrong answer on submission
(1)
Python O(nlogn) time & O(1) extra space | using heapq
(3)
Fastest solution in O(N)
(1)
Simple iterative solution c++
(1)
Simple easy Java solution
(1)
Solution for the above Problem
(1)
Not getting the desired answer
(3)
Solution Approach Algo
(1)
O(nlogn) Solution, can anyone suggest areas of improvements
(1)
Java solution Noble Integer
(1)
A simple code c++
(1)
Just calculate Upper bound
(3)
I made a python code but that wasn't efficient much so got partially correct score 96/200
(1)
Trick was not just to identify that there is a need of sorting [ C++ ]
(1)
Simple solution in python but inly got a 50 points🌳
(1)
I don't know why my algorithm fails for the test case A : [ -4, -2, 0, -1, -6 ]
(2)
What is the most optimized solution?
(5)
C++ Simple counting approach in O(n) time
(1)
Quicksort-like approach, O(n)
(1)
Ezpz lemon squeezey
(1)
Efficient one. Only 10 lines
(1)
C++ solution with constant space, approach is simple
(1)
O(n) time and O(1) space solution C++
(1)
← previous page
next page →