InterviewBit Problems
Equal : Unsolved
About the Equal : Unsolved category
(1)
N^2 with map cpp easy solution
(1)
Weak testcases on interview bit
(1)
Why they accepting O(n^4) solution...atleast force solver for n^3
(3)
O(n^2) solution using unordered map
(1)
This code has O(n^3) time complexity but gives a TLE?
(2)
Wrong test case given wrong wrong please help
(2)
Why is 0,1,2,6 not an answer for given example?
(4)
Bad_alloc error
(1)
Java - ALWAYS shallow copy!
(2)
Delete this post
(1)
How (0,1,3,22) is solution for A : [ 9, 5, 4, 9, 3, 6, 8, 7, 1, 2, 8, 7, 2, 9, 7, 1, 3, 9, 7, 8, 1, 0, 5, 5 ]
(2)
Why not [0,2,4,6] given example
(3)
Custom output doesn't match with submitted solution
(1)
Did it without hashmap by generating all possible ways of selecting four indexes
(1)
<made a mistake>
(1)
Why is this answer wrong [0 6 1 2] for the given example?
(2)
Error in submitting python solution : TypeError: not all arguments converted during string formatting
(1)
My brute force O(n^4) solution got accepted, just reporting this bug
(1)
The answer to the example seems to be wrong
(2)
Returning list of list in python is wrong answer
(1)
Required time complexity is less than O(n^2). I did this in n^2 but got only part
(6)
For input like [1, 1, 1, 1, 1], the expected output is 0 1 2 3. Why is 0 1 1 2 no
(2)
When the array is 1 1 1 1 1 The expected answer is 0 1 2 3 However the actual ans
(2)
O(n^2) is good!
(1)
Hi, you have a problem in java version of the assigment. The return type is a Lis
(1)
Anshuman Singh: I am getting this error while compilation, please check: soluti
(3)
There is nothing mentioned about indices B ans C so it implies B can be equal to
(1)
I return the same output 0 2 3 5 as a vector and no space but it appear as wron
(4)
next page →