Longest Common Prefix After Rotation

You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.

Explanation:

Your task is to calculate the minimum number of left shift operations needed to achieve the longest common prefix between strings 'A' and 'B'.

Note:

A left shift operation is defined as a circular rotation of the string, where the first character is moved to the last position and all other characters are moved one index to the left.

Example:

Input:

A = "an"
B = "can"

Output Explanation:

After one left shift, B = "anc".
After two left shifts, B = "nca".
It takes two left shift operations for the longest common prefix.

Constraints:

• 1 <= T <= 100
• 1 <= |A|, |B| <= 5 * 10⁴
• Characters in A and B are lowercase English letters only.
• Time limit: 1 second

Input:

T, followed by T test cases where each test case comprises two lines:
1. First line contains string A
2. Second line contains string B

Output:

The minimum number of left shift operations needed for each test case.

Note:

You should implement the function that computes the result; printing is handled separately.