As part of an assignment, a student is required to find whether a given string s is divisible by string t. If it is divisible, the student needs to find the length of the smallest string x such that if x is concatenated any number of times, we get both s and t. If this is not possible, the student needs to print -1. Help find the length of the smallest string x. A strings is said to be divisible by string t if string t can be concatenated some number of times to get strings
Example:
s = bcdbcdbod
t = bedbod
If string tis concatenated twice, the result is bcdbcdbcdbod > s. Strings is not divisible by stringt, so the result is -1.
Example:
s = bedbedbedbod
t = bedbod
If string tis concatenated twice, the result is bedbodbcdbcd = s. Strings is divisible by string t. The smallest string x that can be concatenated to create both strings s and t is bod. Its length is 3.
Function Description
Complete the function findSmallestDivisor in the editor below. The function should return a single integer denoting the length of smallest string x.
findSmallestDivisor has the following parameter(s):
s: strings
t: stringt Constraints
• 1 s size of s s 2 x 105
• 1 s size oft s 2 x105
• size of t s size of s