2. Divisibility Of Strings 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 string s is said to be divisible by string t if string t can be concatenated some number of times to get string s. Example: s= bcdbcdbcd bcdbcd If string t is concatenated twice, the result is bedbcdbcdbcd > s. String s is not divisible by string t, so the result is -1. Example: s = bcdbcdbcdbcd t = bcdbcd If string t is concatenated twice, the result is bcdbcdbcdbcd = s. String s is divisible by string t. The smallest string x that can be concatenated to create both strings s and t is bcd. 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: string s t: string t Constraints • 1s size of s s 2 x 105 • 1s size of ts 2 x105 size oft s size of s
2. Divisibility Of Strings 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 string s is said to be divisible by string t if string t can be concatenated some number of times to get string s. Example: s= bcdbcdbcd bcdbcd If string t is concatenated twice, the result is bedbcdbcdbcd > s. String s is not divisible by string t, so the result is -1. Example: s = bcdbcdbcdbcd t = bcdbcd If string t is concatenated twice, the result is bcdbcdbcdbcd = s. String s is divisible by string t. The smallest string x that can be concatenated to create both strings s and t is bcd. 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: string s t: string t Constraints • 1s size of s s 2 x 105 • 1s size of ts 2 x105 size oft s size of s
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Asap
![2. Divisibility Of Strings
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 string s is said to be divisible by string tif string t can be concatenated some number
of times to get string s.
Example:
s = bcdbcdbcd
t = bcdbcd
If string t is concatenated twice, the result is bcdbcdbcdbcd > s. String s is not divisible
by string t, so the result is -1.
Example:
s = bcdbcdbcdbcd
t = bcdbcd
If string t is concatenated twice, the result is bcdbcdbcdbcd = s. String s is divisible by
string t. The smallest string x that can be concatenated to create both
strings s and t is bcd. 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):
5: string s
t: string t
Constraints
• 1s size of s s 2 x 105
• 1s size of t s 2 x105
• size of t s size of s](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8db74f28-f02d-4ee1-b523-f77fcc7968f8%2F5f2d3db9-f640-4a66-9d3f-7cd045ce3873%2F4w3msr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:2. Divisibility Of Strings
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 string s is said to be divisible by string tif string t can be concatenated some number
of times to get string s.
Example:
s = bcdbcdbcd
t = bcdbcd
If string t is concatenated twice, the result is bcdbcdbcdbcd > s. String s is not divisible
by string t, so the result is -1.
Example:
s = bcdbcdbcdbcd
t = bcdbcd
If string t is concatenated twice, the result is bcdbcdbcdbcd = s. String s is divisible by
string t. The smallest string x that can be concatenated to create both
strings s and t is bcd. 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):
5: string s
t: string t
Constraints
• 1s size of s s 2 x 105
• 1s size of t s 2 x105
• size of t s size of s
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education