SDE - 1

Ninja has an array and he can perform two operations any number of times.

Operation 1: He can divide any even element by 2
For example: [1, 2, 3, 4, 5] -> [1, 1, 3, 2, 5]

Operation 2: He can multiple any odd element by 2:
For example: [1, 2, 3, 4, 5] -> [2, 2, 6, 4, 5]

Ninja wants your help to minimize the maximum difference between any two elements in the array using these operations.

Can you help Ninja achieve this task?

You are given N rectangles whose sides are aligned with the x-axis and the y-axis. Each rectangle is represented by 4 integers [ a, b, c ,d ]. Here, (a, b) are x and y coordinates of the bottom left corner, and (c, d) are x and y coordinates of the top right corner.

You need to find if they all together form a rectangular region cover.

For Example :

If the given rectangle is [1, 1, 3, 2]. It means the bottom left corner is at [1, 1] and the top right corner is at [3, 2]. Hence, the top left corner is at [1, 2] and the bottom right corner is at [3, 1].

For the given figure is for N = 4, rectangle[0] = [1, 1, 4, 5], rectangle[1] = [4, 1, 6, 2], rectangle[3] = [4, 2, 6, 5], rectangle[4] = [6, 1, 8, 5].

As they all form a big rectangle [1, 1, 8, 5]. So, the answer is 1.

Note :

Two integers are used to represent Point - x and y coordinates.

Two points are used to represent a Rectangle - Bottom left corner and top right corner.

They asked me about previous company projects that i have done.
I have worked on EIR5g (based on 5g network)

Why you want to join Samsung?
Tell me about your self?
What's your family background?