Split a string into two strings, wherein the first string has all alphabetic letters and the second string has all the remaining characters, maintaining the same order as in the original string.
If test #1 is correct, there is something about this problem I don't understand:
length(Ly)+Length(Ln) = 23
length(LynLyn) = 25
yes,the space should all be in the remaining characters.
Thank you Peter.
Why didn't I think of that? I used the relatively more elaborate regexp. I guess I didn't realize that isletter existed as a function. Well, that's why we work with Cody.
652 Solvers
Find state names that start with the letter N
415 Solvers
277 Solvers
203 Solvers
253 Solvers