SDE - 1

You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

1)The amount of petrol that is available at this particular petrol pump.
2)The distance to reach the next petrol pump.

You are on a truck having an empty tank of infinite capacity. You can start the tour from any of the petrol pumps. Your task is to calculate the first petrol pump from where the truck will be able to complete the full circle or determine if it is impossible to do so.

You may assume that the truck will stop at every petrol pump and it will add the petrol from that pump to its tank. The truck will move one kilometre for each litre of petrol consumed.

You are given an array arr consisting of ‘N’ integers. Your task is to find the largest number, ‘K’, such that both the values ‘K’ and -‘K’ are present in the given array 'arr'. If no such number exists, then return '-1'.

For example:

Consider ‘arr’ = [1,2,-2,-1], the largest value of ‘K’ is 2, since a negative of 2 is also present in the array. Hence, the answer is 2.

He asked me The riddle of the farmer.

Just suppose you had a farmer who needs to transport a fox, a chicken and some corn across a river.

He only has a small boat that can only carry him and one of them with him per crossing. The farmer needs to get all three items across the river in one piece.

But there is a problem. He can't leave the fox and chicken alone as the fox will eat the chicken. Likewise, he can't leave the chicken with the corn as the chicken will munch down on the corn.

What is your preferred language?
What is OS? Is it software or hardware?
What is the use of virtual functions?

What will you do if you are not provided with your preferred location?
Do you have any other offers?