## MNYC '17: Hurontario

View as PDF

Points: 10 (partial)
Time limit: 0.6s
Memory limit: 256M

Author:
Problem type

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

• commented on Dec. 22, 2020, 4:03 p.m. edited

is linear time complexity too slow?

• commented on Dec. 22, 2020, 7:46 p.m.

Linear time is intended, your solution runs in quadratic time (checking string equality is linear in the length of the string)

• commented on May 29, 2017, 10:47 p.m.

what the output will be if the input is TROUBLE OUBE ??

• commented on May 30, 2017, 4:11 p.m.

TROUBLEOUBE

There is no common suffix of A and prefix of B

• commented on April 17, 2017, 9:43 p.m. edited

Can anyone tell me why I am getting an index error on Batch #1, Case #15?

• commented on April 18, 2017, 3:36 p.m.

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

• commented on April 17, 2017, 8:55 p.m. edit 6

For the constraints, do they apply to the input strings or the output string?