Microsoft Software Development Engineer interview questions

Find the 20 longest strings in a text file.

Imagine there are n cities (say c1, c2....cn) connected circularly and each of them has a petrol bunk (say p1,p2...pn). The distance between each cities are d1, d2...dn. Here 1unit of petrol will be used to travel 1unit of distance. You can start from any city so that you can go through all of them and reach the same location (city). Find from where we've to begin the navigation. FOR EXAMPLE: c1-->c2-->c3-->c1 p1 has 2ltr p2 has 10ltr p3 has 4ltr and the distance between each cities: c1<-->c2: 3 c2<-->c3: 2 c3<-->c1: 8 Here we've to start at c2 in-order to come back again to the same place. Explain the logic to find whether u can come back to the same location. Find where to start. Write a program for the same. Write test cases for the same.