1.

Number of different paths of shortest distance from A and B to in the grid which do not pass through M, is

Answer»

`.^(11)C_(5)-.^(6)C_(3)`
`262`
`442`
`.^(11)C_(5)-[.^(6)C_(3)xx.^(5)C_(2)]`

SOLUTION :Total path.[number of paths passing through `M`]
`= .^(11)C_(5)-[.^(6)C_(3)xx.^(5)C_(2)] = 462 - 20 xx 10 = 262`


Discussion

No Comment Found

Related InterviewSolutions