They asked me about my project and that how would i be an asset for them.

Samsung wants to explore some of the rare elements for its semiconductor manufacturing. Scientists use one vehicle to explore the region in order to find the rare elements. The vehicle can move only in explored region where roads have already been constructed. The vehicle cannot move on unexplored region where roads are not there. In the current situation, rare elements are present in explored region only. Unexplored regions do not contain any rare elements. Square region is provided for exploration. Roads are represented by 1 and where roads are not present that area is represented by 0. Rare elements will only be on the roads where regions have already been explored. Vehicle can move in four directions – up, down, left and right. The shortest path for vehicle to a rare element position is called Moving Path. The longest of the paths to all rare elements from a region called Longest Distance. Scientists need to construct one research center so that the research center will be at the position where the longest path to the rare elements will be shortest. This is called Shortest Longest Distance. Constraints: The region provided will be square region i.e. NxN (where 5 <= N <= 20). There can be minimum of 2 rare elements and maximum of 4 rare elements, i.e. 2 <= C <= 4. Roads are represented by 1 while no road area is represented by 0. Vehicle can move only on roads in explored area. The rare elements will only be present where road are there. Rare elements will not be present where roads are not present. Vehicle can move in UP, DOWN, LEFT and RIGHT directions. The starting index for rare element is considers as 1.

Peak in rotated sorted array