InterviewBit Problems
Sum of pairwise Hamming Distance : Solved
About the Sum of pairwise Hamming Distance : Solved category
(1)
C++ Solution : Bit manipulation in O(n)
(1)
Is this O(N) time?
(1)
C++ Solution : Bit Manipulation
(2)
Even though I have written the similar code as mentioned in the solution IDE is not accepting it
(5)
C++ partition based on bit status
(1)
A nice approach O(n*32)
(1)
C++ O(nlog2(maxval))
(2)
Efficient Solution
(1)
Java Solution simple
(1)
Unknown Warning
(1)
Detailed Solution in Python
(2)
In C++ It is quite easy to solve
(1)
Same code as in solution but still not working, But as soon as i put ' L ' in 2 then it got accepted .. WHY?
(1)
Help in understanding a line in python 3 solution provided
(1)
The best solution concept explaination
(2)
My python3 solution
(1)
Testcase getting wrong after Submission of optimal solution
(2)
Python 3 optimal solution
(1)
Interesting point : bug or mistake
(2)
Your submission didn't complete in the allocated time limit
(1)
Can someone explain me how to optimize the code? The code is O(n2) to find the pairs . Can you please help to reduce the time taken to find the pairs
(1)
Trouble understanding the solution
(1)
Can anyone help me understand why sum of hamming distance of all pair of elements equals 2XY?
(3)
Why the iteration is till 31 in the solution of Hamming Distance?
(2)
Why mod 1000000007?
(5)
Help in understanding the solution
(2)
next page →