Editorial for Minutemen


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

Authors: Tommoa

Editorialist: Tommoa

This is a relatively simple substring search. Much like the previous question, you should make everything lower case, and then just find the substring (C++ string::find(), python str.find() and java string.contains()). Then all you have to do is figure out which set of substrings is the longest, keep them together in an array and you're all set!


Comments

There are no comments at the moment.