Recursion Problem.....:)

Revision en1, by wish_me, 2017-08-28 19:16:31

Given 3 characters a, b, c, find the number of strings of length n that can be formed from these 3 characters given that; we can use ‘a’ as many times as we want, ‘b’ maximum once, and ‘c’ maximum twice

Tags recursion, #dp


  Rev. Lang. By When Δ Comment
en1 English wish_me 2017-08-28 19:16:31 231 Initial revision (published)