you have a path of N steps.... at every step, you can take onl;y 1 step or 2 steps.....
how to print all the possible paths that you can take...... PS: please dont give the exact code.....your approaches will be appreciated....:) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
