I understand the entire solution except the part " The probability of reaching any particular green square is the same for all but the green square in the last row", I don't get it why the last row is any different? ↵
↵
My understanding of the solution : We take all the squares which the extension of the diagonal of the rectangle part. We have to pass through one of these squares in order to reach the destination and once we get to these squares the probability of reaching destination is 1. Since there cannot be interesction between these paths, we individually find the probability of reaching each of these squares and add them.↵
↵
Can anyone please explain how the last row is any different?↵
↵
[Problem Link ](https://codingcompetitions.withgoogle.com/kickstart/round/000000000019ffc8/00000000002d8565)↵
↵
My code : https://ideone.com/FIGKWD (got WA)
↵
My understanding of the solution : We take all the squares which the extension of the diagonal of the rectangle part. We have to pass through one of these squares in order to reach the destination and once we get to these squares the probability of reaching destination is 1. Since there cannot be interesction between these paths, we individually find the probability of reaching each of these squares and add them.↵
↵
Can anyone please explain how the last row is any different?↵
↵
[Problem Link ](https://codingcompetitions.withgoogle.com/kickstart/round/000000000019ffc8/00000000002d8565)↵
↵
My code : https://ideone.com/FIGKWD (got WA)
