Return to Question

I am trying to solve https://www.interviewbit.com/problems/stringoholics/ InterviewBit problem.

I am trying to solve this InterviewBit problem.

You are given an array A consisting of strings made up of the letters ‘a’ and ‘b’ only. Each string goes through a number of operations, where:

1. At time 1, you circularly rotate each string by 1 letter.
2. At time 2, you circularly rotate the new rotated strings by 2 letters.
3. At time 3, you circularly rotate the new rotated strings by 3 letters.
4. At time i, you circularly rotate the new rotated strings by i % length(string) letters.

Eg: String is "abaa"

1. At time 1, string is "baaa", as 1 letter is circularly rotated to the back
2. At time 2, string is "aaba", as 2 letters of the string "baaa" is circularly rotated to the back
3. At time 3, string is "aaab", as 3 letters of the string "aaba" is circularly rotated to the back
4. At time 4, string is again "aaab", as 4 letters of the string "aaab" is circularly rotated to the back
5. At time 5, string is "aaba", as 1 letters of the string "aaab" is circularly rotated to the back

After some units of time, a string becomes equal to it’s original self. Once a string becomes equal to itself, it’s letters start to rotate from the first letter again (process resets). So, if a string takes t time to get back to the original, at time t+1 one letter will be rotated and the string will be it’s original self at 2t time. You have to find the minimum time, where maximum number of strings are equal to their original self. As this time can be very large, give the answer modulo 109+7.

Note: Your solution will run on multiple test cases so do clear global variables after using them.

Input:

A: Array of strings. Output:

Minimum time, where maximum number of strings are equal to their original self. Constraints:

1 <= size(A) <= 10^5 1 <= size of each string in A <= 10^5 Each string consists of only characters 'a' and 'b' Summation of length of all strings <= 10^7

You are given an array A consisting of strings made up of the letters ‘a’ and ‘b’ only. Each string goes through a number of operations, where:

1. At time 1, you circularly rotate each string by 1 letter.
2. At time 2, you circularly rotate the new rotated strings by 2 letters.
3. At time 3, you circularly rotate the new rotated strings by 3 letters.
4. At time i, you circularly rotate the new rotated strings by i % length(string) letters.

Eg: String is "abaa"

1. At time 1, string is "baaa", as 1 letter is circularly rotated to the back
2. At time 2, string is "aaba", as 2 letters of the string "baaa" is circularly rotated to the back
3. At time 3, string is "aaab", as 3 letters of the string "aaba" is circularly rotated to the back
4. At time 4, string is again "aaab", as 4 letters of the string "aaab" is circularly rotated to the back
5. At time 5, string is "aaba", as 1 letters of the string "aaab" is circularly rotated to the back

After some units of time, a string becomes equal to it’s original self. Once a string becomes equal to itself, it’s letters start to rotate from the first letter again (process resets). So, if a string takes t time to get back to the original, at time t+1 one letter will be rotated and the string will be it’s original self at 2t time. You have to find the minimum time, where maximum number of strings are equal to their original self. As this time can be very large, give the answer modulo 10⁹+7.

Note: Your solution will run on multiple test cases so do clear global variables after using them.

Input:

A: Array of strings. Output:

Minimum time, where maximum number of strings are equal to their original self. Constraints:

1 <= size(A) <= 10^5 1 <= size of each string in A <= 10^5 Each string consists of only characters 'a' and 'b' Summation of length of all strings <= 10^7