InterviewBit Problems   Diffk : Unsolved


About the Diffk : Unsolved category (1)
Easy O(N) soln C++ (4)
Can be done easily by 2-pointer c++ solution (1)
C++ solution using 2 pointers // (1)
Why this is not O(N) (2)
I don't like these people as they don't mention the constraints already (1)
Use HashMap instead of pointers (2)
Hint for DiffK problem (1)
What's the problem (2)
Hint to solve in O(n) (1)
Can anyone tell me the error? (2)
O(nlogn) got accepted (1)
Test case passing for wrong output A : [ 1, 5, 4, 1, 2 ] & B : 0 (3)
O(n) solution to this problem (2)
My approach on paper (take it as an hint) - picture (O(n) (1)
Feels good to do O(n) (8)
O(n^2) is working:( (2)
Even though people mentioned this years ago, O(n^2) solution got accepted. This makes me want to go to leetcode instead (2)
Explanation for testcase A : [ 1, 2, 2, 3, 4 ], B : 0 (2)
Regarding Input (1)
Improve Test Cases! (1)
Why the O(n^2) solution is also getting accepted? (3)
Hey, are the test constraits proper for this question ? Even brute force n^2 pass (2)