For the third problem, involving the maze: There must be N moves down and M moves to the right. Thus, there is a total of M+N moves, and the number of these is the binomial coefficient (M+N) choose M, which of course equals the binomial coefficient (M+N) choose N. This contradicts the answer involving Catalan Numbers.
Dave On Oct 2, 8:00 am, bittu <shashank7andr...@gmail.com> wrote: > If-a-person-dials-a-sequence-of-numbers-on-the-telephone-what-possible- > words-strings-can-be-formed-from-the-letters > > We are given 4 numbers say n1, n2, n3, n4. We can place them in any > order and we can use mathematical operator +, -, *, / in between them > to have final result as 24. Write an algorithm for this, it will take > 4 numbers and return false or true whether final result 24 is possible > with any combination. > > Pretend there is a robot that has to navigate a maze (N x M). The > robot can only move down or right and the maze can contain walls. > Write an algorithm to determine the number of paths the robot can > take. > > If a person dials a sequence of numbers on the telephone, what > possible words/strings can be formed from the letters associated with > those numbers? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
