Question:- A snail is at origin (0,0) and needs to reach the destination (m,n). It can move either right or upwards at an accelerated rate.
For example, 1 unit in 1st minute, 2 units in 2nd minute and so on.
Find the number of ways snail can reach (m,n) from (0,0) ?
My Approach:- I gave a solution similar to "Unique Path" ?
Can anyone tell a better approach?