Editorial for Minutemen
Submitting an official solution before solving the problem yourself is a bannable offence.
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++
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!