realer than any solution ive ever seen

hows it been?

so wholesome

you're using syntax that only works in list comprehension without defining it as a list. you need the square brackets and even then you have to only return the first instance of x.

thats what i did

literally lolll. is it possible to do a 1kyu in one line? i wonder

i see. thank you

but actually i think you just removed all non digit numbers and then checked if the length is 11 and the first digit is 0. so i think i get it

honestly dont even bother explaining. im new to python and dont understand the re or functools module so i cant really understand this code regardless

how can we determine the outlier type from the first 3 elements? can't it be all even or all odd until lets say the 1000th element?

how can we determine the outlier type from the first 3 elements? can't it be all even or all odd until lets say the 1000th element?

only solution ive seen similar to mine

how does this work? its no guarantee that the alphabet would be in order no? not trying to be ignorant

agree lowkey. cuz what if the alphabet was thousands of letters long yk. i personally used the length of the alphabet (26) and made comparisons from there

all the built in functions exist, you likely implemented it wrong