Platform Name
CodeCheck
Exercise Type
Code Completion
Language
Python
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
URL
https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5
Author
Cay Horstmann
Institution
San José State University
Iframe URL
https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5
LTI URL
https://codecheck.io/files/horstmann/codecheck-python-StringsFindingSubstrings-5
LTI Instructions URL
https://horstmann.com/codecheck/lti.html