Can anyone please share a quicker way to solve this:
Pat will walk from X to Y along a route that is confined to the square grid of four streets and three avenues shown. How many routes from X to Y can Pat take that have minimum possible lenght?
A.6
B.8
C.10
D.14
E.16
The OG 12's solution is to list allthe routes with 3 upward and two rightward movements and count them. The correct answer is C. In my opinion this solution takes more than 2 minutes. Does anyone know a faster way to solve this ???
Pat will walk from X to Y along a route that is confined to the square grid of four streets and three avenues shown. How many routes from X to Y can Pat take that have minimum possible lenght?
A.6
B.8
C.10
D.14
E.16
The OG 12's solution is to list allthe routes with 3 upward and two rightward movements and count them. The correct answer is C. In my opinion this solution takes more than 2 minutes. Does anyone know a faster way to solve this ???
