Title	Given a string s, find the longest prefix that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end.
Catalog Type	SLCItem
Persistent ID	https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5
Platform Name	CodeCheck
Features	Code Completion
Description	Given a string s, find the longest prefix that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end.
Keywords	Strings , Finding Substrings
Author	Cay Horstmann
Institution	San José State University
Iframe URL	https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5
Protocol	SPLICE, LTI 1.1
Protocol URL	https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5 https://codecheck.io/lti/problem/files/horstmann/codecheck-python-StringsFindingSubstrings-5
License	https://creativecommons.org/licenses/by-nc-nd/4.0/
Programming Language	Python
Natural Language	en

SPLICE Output