There is a river and there are n number of steps between two banks of the river to cross the river.
A frog wants to cross the river with the condition that he can jump max one step. Find the number of ways he can cross the river? For e.g. if there are 3 steps in between, frog can go from paths: _123_, _2_, _13_ so there are 3 different ways frog can cross the river (in the example _ is two ends of the river) Can this question be done using Dynamic Programming ? If yes, please tell how . -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/4HJq5yRGXboJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
