Software Backend Engineer

You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the array.

Your task is to find the duplicate element. The duplicate element may be repeated more than twice in the error, but there will be exactly one element that is repeated in the array.

Note :

All the integers in the array appear only once except for precisely one integer which appears two or more times.

It was a design like problem, I was given a class and then a list of objects of that class. I had to solve a min max problem, like find-out people with x salary and in descending order, the question was easy but it was structured in a difficult way.

We had discussion on hashmaps, equals(), hashCode(). It was indepth, and then Interviewer gave a question and scenario in which of the 2 given maps will the values change if i input something.(Learn)

General discussion of how/ which APIs will you use, how kafka will be used there, retry flows, database