Auto comment: topic has been updated by vivek034 (previous revision, new revision, compare).

Check this slight update to your code.

47347385

Your code should have the if-condition (i > 0 and p[i] == q[i-1]) to avoid accessing q[-1] when i = 0. The updated code did not pass test case 19 as it computed the n-letter string to be "babab" whereas the correct string should be "ababa", as both prefix and suffix of length 1 are "a".

You may check the the following solution as well as the tutorial for hints on how the correct string is computed.

47236313

gaurav172 You must see this code. It must be little familiar to you. #chandela xD