SDE - 1

In Ninja Land there are ‘N’ cities numbered from 0 to ‘N’-1. The distance between each pair of cities is given by N * N matrix ‘DIST’ where ‘DIST[i][j]’ denotes the distance between city ‘i’ and ‘j’.

Ninja wants to select ‘K’ (‘K’ <= ‘N’) cities and install Coding Ninjas Server in these cities. He wants to select ‘K’ cities in such a way that the maximum distance of a city from the Coding Ninjas Server is minimized.

Can you help Ninja in finding this maximum distance if he selects ‘K’ cities optimally? You should return this distance.

Note :

1. DIST[i][j] = DIST[j][i].
2. DIST[i][i] = 0.

Example :

Consider that there are 4 cities i.e. ‘N’ = 4, and the distance between each pair of cities is given by the following matrix ‘DIST’:  
             [0, 10, 7, 6]
             [10, 0, 8, 5]
             [7, 8, 0, 12]
             [6, 5, 12, 0]

Graphically, cities can be represented as -:

Assume Ninjas wants to install a server in 2 cities i.e ‘K’ = 2.  Then one optimal choice is to select cities 2 and 3.
After that, the minimum distance of city 0 from the server is  6  (i.e from city 2).
The minimum distance of city 1 from the server is 5  (i.e from city 3).
The minimum distance of cities 2 and 3 from the server is 0, as the server is installed in these cities.
Thus the maximum distance of the city from the server is max (6, 5, 0, 0) = 6.
So, we should return 6.
No selection of two cities can give a maximum distance which is less than 6.

Suppose we are given an empty string “inputString”. We have to convert this “inputString” into a “Beautiful String”

We can perform any number of operations on “inputString” to convert it to “Beautiful String”.

Operation :

You have to insert “abc” to “inputString” in every operation.
If “inputString” is empty just insert “abc” in “inputString”
If “inputString” is not empty, you can insert “abc” in any position in “inputString” in such a way that:
1. “ LEFT PORTION OF “inputString” ” + “ abc ” + “ RIGHT PORTION OF “inputString” ” = “Beautiful String”.
2. “ LEFT PORTION OF “inputString” ” maybe EMPTY OR “a” OR “ab” OR “abc”.
3. “ LEFT PORTION OF “inputString” ” maybe EMPTY OR “c” OR “bc” OR “abc”.

Your task is to find whether the given string “inputString” is a “Beautiful String”, or not.

Note :

The given string "inputString" cannot be empty.

You are given two complex numbers 'NUM1' and 'NUM2' as strings, “A+Bi” where ‘A’ represents the real part and ‘B’ represents the imaginary part.

You have to find the complex multiplication of given numbers and return it as a string “A+Bi”, where ‘A’ represents the real part of the result and ‘B’ represents the imaginary part of the result.

Tell me about yourself.

Why should we hire you?

How do you handle pressure?