Problem
Given an array of integers, find a duplicate number. You must solve this with O(1) auxiliary space and better than O(n^2) time complexity.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
