Hi, thanks for the fix! But are you sure this is the correct way to address the issue? The article describes a suffix array on the looped string (that is, it sorts cyclic shifts of the string rather than its suffixes). With this in mind, shouldn't we instead take i and j modulo n after additions? So, instead of adding i < n && j < n check we would do c[k][i % n] == c[k][j % n] check inside the loop?

By the way, i < n && j < n doesn't seem to be a valid break condition for non-cyclic string, as it can provide an answer which is larger than it should be.

Yes, you're absolute right. Checking for i < n && j < n does not really make sense outside of that particular coding problem was working on. Thanks for noticing and pointing that out!

Thanks for the quick fix! Merging it now.