InterviewSolution
Saved Bookmarks
| 1. |
Let A and D be opposite vertices of a square. A frog starts jumping at vertex A. From any vertex of the square except D, it may jump to either of the two adjacent vertices. When it reaches D, the from stop and stays there. The number of distinct path of exactly 6 jumps ending at D are ____________________ |
|
Answer» |
|