Question

Hi, I have Python programming problem as follow:

Write a function solution that, given two integers A and B, returns a string containing exactly A letters 'a' and exactly B letters 'b' with no three consecutive letters being the same in other words, neither "aaa" nor "bbb" may occur in the returned string). Examples: 1. Given A = 5 and B = 3, your function may return "aabaabab". Note that "abaabbaa" would also be a correct answer. Your function may return any correct answer. 2. Given A = 3 and B = 3, your function should return "ababab", "aababb", "abaabb" or any of several other strings. 3. Given A = 1 and B = 4, your function should return "bbabb", which is the only correct answer in this case. Assume that: A and B are integers within the range [0..100); • at least one solution exists for the given A and B. In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.

Thank you.

Best Regards.

Answer 1

Python:

def solution(A,B):
str1="" # string will contain the answer string.
if A>B: #A greater than B
while A/2<B and A>0 and B>0:
str1=str1+"ab" #concat the 'ab'
A=A-1
B=B-1
while A/2>=B and A>0 and B>0:
str1=str1+"aab" #concat the 'aab'
A=A-2
B=B-1
elif B >= A: #B greater than A
while B/2<A and A>0 and B>0:
str1=str1+"ba" #concat the 'ba'
A=A-1
B=B-1
while B/2>=A and A>0 and B>0:
str1=str1+"bba" #concat the 'bba'
B=B-2
A=A-1
  
while A>0 and B<=0:
str1=str1+'a' #concat 'a' if B less than equal 0
A=A-1
while B>0 and A<=0:
str1=str1+'b' #concat 'b' if A less than equal 0
B=B-1
return str1   

print (solution(5,3)) #print the string
print (solution(3,3)) #print the string
print (solution(1,4)) #print the string

Output:

abaabaab bababa bbabb