InterviewBit Problems   Single Number II : Solved


About the Single Number II : Solved category (1)
Title of your commentwhat's wrong with my approach (1)
Same logic as in the editorial's solution, but use bit operators instead of arithmetic like sum and power (3)
5 line code in cpp (1)
C++ O(n) - time O(1) - Space Easy to understand (1)
[C++][Single Number II] short simple code (4)
N logn solution (1)
Simple and Sweet, based on given hint (1)
TWO LINE O(n) C++ without extra memory (1)
Java Easy HashMap (2)
Can someone explain this ((A[j] >> i) & 1) please? (3)
Very simple c++ soln(pure bit manipulations): (1)
Single Number II (easy and intuitive solution) (2)
Without using bits c++ solution (1)
C++ solution O(n) & space complexity O(1) (1)
Easy to Understand : C++ Solution (1)
Easy C++ solution in O(n) time and O(1) space! (2)
XOR without bitmask (4)
Use bitwise operators only where it is needed (1)
Solving with o(n) time & aux. o(1) (1)
Difficulty in understanding the solution (2)
Partition the number according to bits. Elegant solution (3)
Bitmask solution explanation (6)
My solution to this problem. Simple and easy to understand (1)
It just gets better (2)
How can one think of approach 2.... I didnt even understood it (2)
I think the solution provided is n log2 (max(a_i)) not linear (2)