| /* | |
| Mr. Kim has to deliver refrigerators to N customers. From the office, he is going to visit all the customers and then return to his home. Each location of the office, his home, and the customers is given in the form of integer coordinates (x,y) (0≤x≤100, 0≤y≤100) . The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office, his home, and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his among all the possibilities. | |
| You are given the locations of the office, Mr. Kim’s home, and the customers; the number of the customers is in the range of 5 to 10. Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his home. Your program only have to report the distance of a (the) shortest path. | |
| Constraints | |
| 5≤N≤10. Each location (x,y) is in a bounded grid, 0≤x≤1 |
Generally, there are two major types of technical interviews that companies have in India:
If you're aiming the traditional giants like Google, Microsoft, Amazon, etc, then you should focus solely on problem-solving & data structures (PS/DS).
