While it does look nice. The time complexity of this solution is O(n2) as many have stated. @abe.dillon is correct with a list as he described it took 2:36 vs 24.6 ms with an O(n) implementation. Even at the specified Precondition: 0 < len(data) < 1000 this implementation took ~190 times longer se More

I knew this was possible... Should have researched it more mine is UGLY. More

This is a good solution. The lowering of the case of text can be done in line without re-assignment of text(ie). if word in text.lower(): More