Backend developer intern

Given an array of non-negative integers ‘ARR’ of length ‘N’, you are initially positioned at the array's first index.

Each element in the array represents your maximum jump length at that position.

Return the minimum number of jumps required to reach the last index.

If it is not possible to reach the last index, return -1.

Example:

Input:

‘N’ = 3
‘ARR’ = [ 2, 1, 1 ]

The shortest way to reach index 2 is
Index 0 => Index 2
that requires only 1 jump.

Your friend gifted you ‘N’ balls. Each ball has a number associated with it, the numbers associated with the balls are given in the array 'ARR'. But your cupboard has slots such that only N/2 balls can be kept. So, you decided to remove the balls following an operation.

In one operation, you can select a ball numbered ‘x’ and remove all the balls which are numbered ‘x’.

You are supposed to minimize the number of operations such that at least half of the balls are removed from ‘N’ balls.

Note:

Numbers on the balls may not be unique.

Why do we need Indexes in MongoDB? How do you decide if you need an index?

Why do we need Redis if we can store data in MongoDB?

Did you participate in tech and product grooming? Did you share your opinions and how were they taken?

Tell me about some of the suggestions you made which were then turned into a feature