do you mean to say there is a solution that will run in the same time regardless of alphabet size or that this solution can run with o(n) complexity in some situations

aha, when i began programming i thought i knew everything there was to know, i feel like university has humbled me

im not going to lie, i coded this when i was very new to coding, i barely remember but i believe i was trying to make sure that i passed a string as an argument to String.contains

im still relatively new to learning big O but im pretty sure that this method will always run in <26 iterations so its O(1) isnt it?

that is another option that acheived the same result but adds an extra line - the only difference is that this solution is more line efficient