Editorial for SAC '22 Code Challenge 3 Junior P1 - Normal Problem


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.

Author: maxcruickshanks

Subtask 1

It suffices to output liar.

Time Complexity: \mathcal{O}(1)

Subtask 2

Common built-in string finding functions in languages should be sufficient to check for demello in S; alternatively, check each 7-letter substring in S for demello and output the answer.

Time Complexity: \mathcal{O}(7 \times |S|)


Comments

There are no comments at the moment.