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 |
A competition to solve a particular problem through the usage and manipulation of strings.
2
votes
Don't google "google"
Befunge-93, 59 characters
<+1\_v#+1:~
vp00$<
<*_v#:\
v_v>$"google"*****-!#
< >00g.@>1
Befunge has no way to actually throw an error, so I just push an "infinite" number of 1s onto the stack. An error …
3
votes
Type uniqchars!
Befunge-93, 124 bytes
v
<v1p02-1
0_v#`g00: <0_@#+1::~p
1>:1+10p2+0g-!#v_v
g `#v_10g0^ >:10g00
^0g 00$ <
^ >:,00g1+:00p1+:1+01-\0p
Test it in this online interpreter.
This was more d …
2
votes
Type uniqchars!
Minkolang 0.10, 13 bytes
This language was made after this challenge but not for this challenge.
Much thanks to Sp3000 for pointing me the way to this much shorter solution.
od?.dd0q?Od0p
Try it here …
3
votes
Simple cat program
Befunge-93, 9 6 bytes
This solution (thanks to ninjalj!) depends on 0 % 0 throwing an error and halting, thus it will not work in all interpreters (like this one, where it's NaN instead and does not h …
0
votes
Longest Common Prefix of 2 Strings
Minkolang 0.10, 21 bytes
(od" "=,)x(0gdo=?.O1)
Expects input as two words, space-separated, like so: department depart. Try it here.
Explanation
(od" "=,) Loops through input until a space is en …
1
vote
Who is the sleepiest of them all?
Minkolang 0.12, 119 bytes
At first, I tried doing this short and really golfy. I gave up and went for something a bit more "fun", but still relatively golfy.
>2@fv$oI2:[9[i$z3[iciz1+q=]++3=tt"^"3zpt]$ …
2
votes
Find the center
Minkolang 0.13, 23 20 bytes
$oI2$%d$z,-Xz3&+2:O.
Try it here.
Explanation
$o Read in the whole stack as characters
I2$% Push I,2, then pop them and push I//2,I%2
d$z Duplicate top o …
2
votes
Reverse stdin and place on stdout
Minkolang 0.10, 6 bytes (non-competitive)
This language was created after this challenge, but not for this challenge.
$or$O.
$o reads in all of the input as characters, r reverses the stack, $O outpu …
3
votes
Halloween Golf: The 2spooky4me Challenge!
Explanation
(dl%"0"+$rl:d) does the job of converting an int to a string. If this were replaced by a single character (like Z), then my solution would be just 23 bytes.
"me"nd2+Z"spooky"2gZ$O. …
1
vote
Full Width Text
Minkolang 0.15 - 9 bytes
od?.O" "O
Try it here!
Explanation
o Take character from input
d Duplicate top of stack
?. Pop top of stack and jump over the . if truthy, sto …
5
votes
StringgnirtSStringgnirtSStringgnirtS
Minkolang, 17 bytes:
$oId$z$Dz[rz[O]].
Try it here!
Explanation
$o Read in whole input as characters
Id Push the length of stack and duplicate
$z …
6
votes
Simple cat program
Minkolang, 5 bytes
od?.O
Try it here.
Explanation
o reads in a character from input and pushes its ASCII code onto the stack (0 if the input is empty). d then duplicates the top of stack (the charact …
3
votes
Remove all occurrences of the first letter of a string from the entire string
Minkolang 0.9, 23 33 bytes
No way this will win but eh, it's fun!
" Z"od0c`1c*-$I[odd0c`1c*-2c=?O].
Try it here.
Explanation
" Z" Makes it easier to uppercase
od …
1
vote
Reverse and Invert a String
Minkolang 0.11, 26 bytes
od?.(d2%,$r2:d)xrI1-[2*+]O
Try it here.
Explanation
od?. Takes input as character, halting if empty
(d2%,$r2:d)x Converts to binary, inverting digits on the way …
1
vote
N Slab Slanted Slash Cake
Minkolang 0.14, 46 bytes
I'm sure this could be golfed, but it's 4 am here and I need to go to bed.
n$z"/\"z$D$OlOz[" /"zi-$Dlr$d"\"zi1+-3&5$X$O].
Try it here.
Explanation
n$z Take numb …