InterviewBit Problems
Order of People Heights : Unsolved
About the Order of People Heights : Unsolved category
(1)
Given editorial code isnt correct!
(1)
Is given example right?
(3)
N^2 solution accepted
(1)
Probably the most elegant solution
(2)
Segment Tree is an overkill. BIT works just fine
(3)
Simple O(N^2) solution easy to understand code
(2)
Don't waste your time, just get to n^2
(8)
Solution given in the editorial is not optimal
(2)
Multiple possible answers for some test cases but only one gets accepted others fail
(4)
For people confused by this question, please read
(5)
A : [ 86, 92, 49, 21, 62, 27, 90, 59 ] B : [ 2, 0, 0, 2, 0, 2, 1, 3 ] What does 2
(2)
Right Answer not accepted
(1)
The question is very confusing and need to be clarified
(1)
In given example for person with height 1, infront should be 4(5,3,2,6) right?
(5)
Input query: output is not correct
(1)
Map based solution is working
(1)
Does Google really expect you to implement segment trees?
(1)
Paras Meena hey paro... used binary seach along with bit tree even though solutio
(6)
Example clarification needed for height 1
(2)
Is the example wrong?
(5)
Incorrect nae of bucket for this problem
(1)
Example is misleading
(1)
Question needs to b clarified more
(1)
Time taken to solve
(1)
Passing Correctness but showing Seg fault in efficiency
(1)
next page →