0
/ 2.0
Given a string str
and a non-empty substring sub
, compute recursively the largest substring which both starts and ends with sub
and...
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 feedback will appear here when you check your answer.