You start with A. In every step, A gets transformed to AB and B get transformed to BA. You are supposed to tell how many ‘BB’ will occur at Nth iteration. E.G. A AB ABBA ABBABAAB … So on

Question

Accepted Answer

The number of 'BB' occurrences at the Nth iteration of the transformation sequence.

At each iteration, A gets transformed to AB and B gets transformed to BA.
To find the number of 'BB' occurrences at the Nth iteration, we need to count the number of 'BB' substrings in the transformed string.
The transformation sequence follows a pattern: AB, ABA, ABAAB, ABAABABA, ...
The number of 'BB' occurrences doubles with each iteration: 0, 0, 1, 2, 4, 8, 16, ...
To calculate the number of 'BB' occurrences at the Nth iteration, we can use the formula: 2^(N-2), where N >= 2.

You start with A. In every step, A gets transformed to AB and B get transformed to BA. You are supposed to tell how many ‘BB’ will occur at Nth iteration. E.G. A AB ABBA ABBABAAB … So on

Top Directi Software Engineer interview questions & answers

Popular interview questions of Software Engineer