Backend Developer

Design Food delivery system.

Design Flight System.

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.

Design bookmyshow. 

• How does React work?
• State management in React.
• useState, useEffect, useCallback, useMemo. (Learn)

The problem was hypothetical, not a standard DSA question. He told me there is a circle and a square, and asked how many circles can fit inside the square. He also asked me about the probability of that.

The follow-up question was about how many points can fit inside a circle and the probability related to that.

1. Points in a Circle
Infinite points: Mathematically, an infinite number of points can fit inside any geometric shape, including a circle. This is because a "point" is a dimensionless entity (it has no size), so you can theoretically place an infinite number of them within any bounded area.