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 89233
A competition to solve a particular problem through the usage and manipulation of strings.
1
vote
Make me speak L33T
T-SQL, 127 bytes
print replace(replace(replace(replace(replace(replace(replace(replace(@,'e',3),'E',3),'b',8),'B',8),'i',1),'I',1),'s',5),'S',5)
Assuming "@" the input. Not very efficient, though. :) …
- 187
-12
votes
8
answers
547
views
Write "tut-tut-tut" without using "tut"
Following this question: Tut-tut-tut-tut-tut
Write a program that writes "tut-tut-tut" without using the characters "t", "u" or "-" in the code itself.
This is code golf, shortest code in bytes wins.
- 187
2
votes
Average Two Letters
T-SQL, 64 bytes
declare @ char='Z',@2 char='a'print char((ascii(@)+ascii(@2))/2)
assuming @ and @2 the input.
37 bytes if only put:
print char((ascii('B')+ascii('C'))/2)
- 187