# This content is archived!

For the 2018-2019 school year, we have switched to using the WLMOJ judge for all MCPT related content. This is an archive of our old website and will not be updated.

Check if each letter $i$ in the range $0, S/2$, where $S$ is the size of the word, is equal to its corresponding letter ($S-i-1$). If it isn’t, then break the loop early and print NAY otherwise print YAY after searching the whole word.

## Time complexity

$\mathcal{O}(S)$, where $S$ is the length of the word.