Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with string
Search options not deleted
user 49161
A competition to solve a particular problem through the usage and manipulation of strings.
2
votes
Coding Convention Conversion
Python 3, 130 bytes
Quick and dirty attempt using regex to split at the caps. Pretty brute force: if anyone can come up with a different approach I'm sure this can be beaten.
import re
lambda s:(' …
- 469
1
vote
To be or not to be
Python, 85 83 bytes
@Manatwork saved me two bytes.
This is pretty brute force, I'll look into regex solutions next.
lambda a,b:a.lower()in'2 to too two t0'.split()and b.lower()in['b','be','bee','b3 …
- 469
4
votes
Spoonerise words
Finally, the implementation of input() seems to have changed between py2 and py3 - it automatically evaluates stdin as a string. …
- 469
0
votes
Say What You See
Python 3, 138 bytes
I used a recursive approach.
def g(a,b):
if b<1:return a
else:
c,n=1,'';f,*a=str(a)+'_'
for i in a:
if i==f:c+=1
else:n+=str(c)+f;f,c=i,1
return g(n,b-1)
The func …
- 469