0
/ 50
Given a string str and a non-empty substring sub, compute recursively the largest substring which both starts and ends with sub and...
X165: strDist
Given a string str and a non-empty substring sub, compute recursively the largest substring which both starts and ends with sub and return its length.
Your Answer:
Feedback
Your feedback will appear here when you check your answer.