PhonePe Associate Developer Interview Question 2025 February | Cycle Detection | on-campus

Question 1: Find the Duplicate Number Problem Statement Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive, there is only one repeated number in nums. Return this repeated number. You must solve the problem without modifying the array and uses only O(1) extra space. Constraints 1 <= n <= 105 nums.length == n + 1 1 <= nums[i] <= n All integers in nums appear only once except ...