Summer analyst

You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.

Note: Take absolute difference between the elements of the array.

You have been given a sorted array/list 'arr' consisting of ‘n’ elements. You are also given an integer ‘k’.

Now, your task is to find the first and last occurrence of ‘k’ in 'arr'.

Note :

1. If ‘k’ is not present in the array, then the first and the last occurrence will be -1. 
2. 'arr' may contain duplicate elements.

Example:

Input: 'arr' = [0,1,1,5] , 'k' = 1

Output: 1 2

Explanation:
If 'arr' = [0, 1, 1, 5] and 'k' = 1, then the first and last occurrence of 1 will be 1(0 - indexed) and 2.

What is deadlock and how you can prevent it? 
What is difference between process and thread?
Explain critical section.

There is a city with bad roads. You have to repair the roads. How will you find the roads which are in bad condition? What parameters you will take to check if the road is in good condition? How will you collect that information? Now you have all the information, how will you prioritise which road will you repair first? What will be the order for repairing?

I mentioned front-end web developer internship in my resume, so he asked me which data structures I have used in frontend web development