InterviewBit Problems
3 Sum : Solved
About the 3 Sum : Solved category
(1)
Binary Search Approach Failing for larger test cases , help needed
(3)
Easy two pointer algorithm in C++( O(n) solution)
(7)
Trying to get NlogN solution. But the code is failing for large testcases
(1)
The editorial solution for C# is not working .Can anybody let me know the issue
(1)
Editorial solution is o(n*n) in worst case
(1)
C++ | 3 Sum : TC O(n^2)
(1)
It is very similar to editorial but not working
(1)
Partial correct. Your code might be failing for larger test-cases. Whats the problem here?
(1)
Easy JAVA SOLUTION -- >
(1)
Python O(n2) solution
(1)
3 sum Java Solution O(n^2)
(1)
Solution Accepted
(1)
For all test cases
(1)
Passes All Test Cases
(3)
I used one loop and still got an efficiency penalty. Any help will be appreciated
(1)
Whats wrong in this code
(2)
Ruby 3 Sum O(2)
(1)
When for bestSum INT_MAX Is replaced by 10000000 then it print correct answers..other wise worng..whats the differece between INT_MAX and this large valuewhy?
(3)
Problem in Test case
(2)
Simple Solution JAVA
(1)
Simple O(n^2) solution in C++
(1)
Solution in O(n^2*log(n)), using binary search
(1)
My Simple O(n^2) solution using three pointers
(1)
Hi, a little optimization to the solution you have provided: What happens if (sum
(2)
I think you missed the test cases like this one: 5 -20 -1 5 16 18 1 I had a wron
(2)
next page →