InterviewBit Problems   Find Duplicate in Array : Solved

About the Find Duplicate in Array : Solved category (1)
Simple JAVA solution,TC:O(n) SC:O(1) (2)
Time O(N) by Traversing once and O(1) space complexity using simple maths (4)
O(n) time, O(n/2) space i.e, less than O(n) space. JAVA (1)
Fastest solution given, is wrong (1)
Doubt the fastest solution (4)
TC:- O(n), SC:- O(1) (2)
Python Easy solution using dictionary (2)
Fastest solution provided seems to be not correct (4)
Using floyd's cycle finding algorithm helps us find a solution in O(1) time (2)
My every solution getting error in same test case (1)
Python3 easy solution using set (1)
Python 3 solution using counter (1)
Short O(n) space O(n) time C++ solution (1)
Java | Fastest Solution | Hashmap | (1)
Solution C++ only vector (2)
What's wrong in this sol.? (4)
Either Solution provided by Interview bit is wrong or the question is wrong (1)
Find Duplicate in Array (1)
Shortest JS solution (1)
I don't know if this is the right solution but my simple python code works... (comment if my solution looks lame) (1)
How does using bitmask for bucketing make it "less than O(n)" space? (1)
Various Approaches summarized in C++ ( 2 ) (31)
Simple cpp solution O(n) time and O(1) space (1)
Weak testcases - First N natural sum formula solutions accepted (3)
Solution without Set and Time complexity O(n) and Space complexity O(1) (4)
Clarity on the question (1)
A little trick solution with O(n) TC and O(1) SC (3)
6 Liner Java Solution (1)
Short and easy python solution (1)