You have a N*N grid consisting of \'S\' (Source) , \'D\' (Destination) and \'X\' **(Blocked)** values in the indexes. You have to find the minimum distance between any pair of source and destination nodes, keeping in mind that you cannot travel through the X (Blocked) nodes.\n\nEg: n = 3\nS X D\nS D D\nS X X\n\nans = 1 unit

You have a NN grid consisting of \'S\' (Source) , \'D\' (Destination) and \'X\' (Blocked)* values in the indexes. You have to find the minimum distance between 