Here’s the problem statement: Given an array of n integers such that every integer lies only in [1, n], find the element in the array who’s duplicate has the minimum index of all the indices that are occupied by duplicate values. For example: Array: [3 2 5 2 3]Output: 2 Approach 1: This is a naiveContinue reading “Scribble 11: First Duplicate”