write an efficient algo to compute no. of sequences of n binary digits that do not contain 2 1's in a row. eg 1100001 is invalid whereas 1001001 is valid..
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
