Full Stack Engineering Intern

Given two unsorted arrays of non-negative integers, 'arr1' and 'arr2' of size 'N' and 'M', respectively. Your task is to find the pair of elements (one from each array), such that their absolute (non-negative) difference is the smallest, and return the difference.

Example :

N = 3, arr1 = [10, 20, 30]
M = 2, arr2 = [17, 15]
The smallest difference pair is (20, 17) with an absolute difference of 3. So, the answer is 3.

Note :

Both the arrays are unsorted, and all array elements are non-negative integers.

You are given an infinite array consisting of only ones and zeroes, in sorted order. You have to find the index of the first occurrence of 1.

Example:

If the array is 0 0 0 0 1 1 1 1… then, the first occurrence of 1 will be at index 4 therefore the answer here is 4.

Note:

As the array size is infinite, the actual array won’t be given to you. Instead, you will be able to access the array elements by calling a method named ‘get’.

get(i) : returns the value present at index I.

Indexing is 0-based. 

Instead of representing an infinite array in the input, we give the index of the first occurrence of 1 in the input itself. However, this input will be completely hidden from the user.

It is guaranteed that the answer will fit in a 64-bit integer.

She asked me about differences between C++ & JAVA, ACID properties, DBMS languages, 4 pillars of oops.
What is a Join? List its different types. (Learn)

I was asked more about the 4 pillars of OOPS, BCNF form, STL, what is JVM, differences between overloading and overriding, startup sequence of computers, etc.

Then he had put a situation like a client wants a health application, how many team members would you require and then he had put conditions like if the client reduces the amount to be paid, reduces the deadline and one of the team members resigns, then what would you do? This was a little challenging to explain. He asked me if I had any questions. I asked about the work culture and about the tech stacks used there.