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.
Solution Stats
Problem Comments
-
2 Comments
Andrew Newell
on 18 Apr 2017
If test #1 is correct, there is something about this problem I don't understand:
length(Ly)+Length(Ln) = 23
length(LynLyn) = 25
yao gang
on 18 Jul 2017
yes,the space should all be in the remaining characters.
Solution Comments
-
1 Comment
Pavan Toraty
on 20 Nov 2013
Thank you Peter.
-
1 Comment
Peter Wittenberg
on 1 Jan 2013
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.
Recent Solvers204
Suggested Problems
-
Maximum running product for a string of numbers
774 Solvers
-
525 Solvers
-
187 Solvers
-
1564 Solvers
-
Duplicate each element of a vector.
443 Solvers
More from this Author100
Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)