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:
- Find whether there is path between two cells in matrix
- Minimum cells traversed to reach corner where every cell represents jumps
- Minimum cells required to reach destination with jumps equal to cell values
- Find safe cells in a matrix
- Unique cells in a binary matrix
- Print cells with same rectangular sums in a matrix
- Shortest distance between two cells in a matrix or grid
- Number of cells a queen can move with obstacles on the chessborad
- Number of cells in the right and left diagonals passing through (x, y) in a matrix
- Minimum Sum Path in a Triangle
- Minimum odd cost path in a matrix
- Minimum sum falling path in a NxN grid
- Dijkstra's shortest path with minimum edges
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : Ryuga