Given coordinates of 3 cells (X1, Y1), (X2, Y2) and (X3, Y3) of a matrix. The task is to find the minimum path which connects all three of these cells and print the count of all the cells that are connected through this path.
Note: Only possible moves are up, down, left and right.
Input: X1 = 0, Y1 = 0, X2 = 1, Y2 = 1, X3 = 2 and Y3 = 2
(0, 0), (1, 0), (1, 1), (1, 2), (2, 2) are the required cells.
Input: X1 = 0, Y1 = 0, X2 = 2, Y2 = 0, X3 = 1 and Y3 = 1
Approach: First sort the cells from the one with minimum row number at first to one with maximum row number at last. Also, store minimum column number and maximum column number among these three cells in variable MinCol and MaxCol respectively.
After that, store row number of the middle cell(from sorted cells) in variable MidRow and mark all the cells of this MidRow from MinCol to MaxCol.
Now our final step will be to mark all the column number of 1st and 3rd cell till they reach MidRow.
Here, marking means we will store the required cells coordinate in a set. Thus, our answer will be size of this set.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.