Hurontario is a cool street name. It contains both Huron and Ontario. They share two letters, on
. Given two strings and
, create the smallest string that starts with
and ends with
.
Constraints
For of the points, the length of each string is at most
.
For the remaining of the points, the length of each string is at most
.
Input Specification
A single line will contain two space separated strings consisting of only uppercase Latin characters, and
.
Output Specification
A single string described in the problem statement.
Sample Input 1
HURON ONTARIO
Sample Output 1
HURONTARIO
Sample Input 2
NEW YEARS
Sample Output 2
NEWYEARS
Sample Input 3
YEAR EARWIG
Sample Output 3
YEARWIG
Comments
Since the original data were weak,
more test cases were added to the second batch.
An additional test case was added to both subtasks, making
new test case for the first batch and
new test cases for the second batch.
is linear time complexity too slow?
Linear time is intended, your solution runs in quadratic time (checking string equality is linear in the length of the string)
what the output will be if the input is TROUBLE OUBE ??
TROUBLEOUBE
There is no common suffix of A and prefix of B
Can anyone tell me why I am getting an index error on Batch #1, Case #15?
I think it's due to your second forloop. I can't pinpoint your exact issue but try troubleshooting with the test case BAHAHABA HAHA
For the constraints, do they apply to the input strings or the output string?