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.
394
votes
50
answers
59k
views
Covfefify a string
In this challenge, you must take a string matching the regex ^[a-zA-Z]+$ or whatever is reasonable (you don't have to consider uppercase or lowercase letters if you want) (you may assume the string is … You can assume that this consonant is not at the end of the string. …
28
votes
24
answers
3k
views
Which ghosts are missing?
You must do it in as few bytes as you can
Input
Input will consist of a string or list, which will include a number ghosts, which could include:
Blinky
Inky
Pinky
Clyde
However, input may also include … It can be assumed that no invalid items will be in the list
Output
Output will consist of a string, or list. This will include of all the ghosts that are not in the input, in any order. …
8
votes
5
answers
4k
views
Is it Covfefey?
Based on this challenge, you must determine if a string is covfefey, that is, could it have been produced as output from a covfefifier? … The string will be composed of only alphabet chars (^[a-z]\*$, ^[A-Z]\*$ are possible schemes for input. change the regexs appropriately if using caps)
To do this, there are a few checks you must do: …
6
votes
"Hello, World!"
Sad-Flak, 199+3 bytes = 202 bytes
3 bytes for the -A arg. This lang uses a "codepage", where ≤≥ are one byte each (that is, I have a thing that replaces ` and ~ with those chars and runs it)
32
({}≤ …
7
votes
Draw diagonal lines of text
Explanation
(write means writing to the cell on the grid, pointed char means char in input the string pointer points to)
! … _+ write * if end of input, else ' ', increment string pointer
_ will always write ' ', since it will always point at start char
note trailing space. …
1
vote
1, 2, Fizz, 4, Buzz
Turtlèd, 221 bytes
99;,:[*,l]u[*d{*u,dr}ul' l[ l]ru]u3;[ [ r]l[ ' l]ll"Fizz";]<97:>5[ (*[ r]l[ ' l]ll)(zr)"Buzz";]<104:>[ lll'0rrr[ r]l{*' l{*l}{ l}(9'0l( r"1!")(9"10!"))(8'9)(7'8)(6'7)(5'6)(4'5)(3'4 …
1
vote
Element of string at specified index
input the string into the string variable
? input the number into the number variable
: this command takes the number variable and moves right that many. … pointer. the string pointer is used with the string var;
when you want to write something from the string, you use `.`, which writes
the pointed char. the pointed char is the n-th …
4
votes
Trick or Treat polyglot
Turtlèd, Python, 23 bytes
"Treat";print('Trick' )
Produces Treat in Turtlèd, Trick in Python
probably also produces "Treat" in foo
Explanation:
Turtlèd
"Treat" Write Treat
…
2
votes
Fill in the Minesweeper clues
Turtlèd, 99 bytes
(whoops I keep forgetting the link :| )
Takes inputs with brackets around each line
Turtlèd cannot take multi-line input, so after the last line, write | to signal end of input
N …
6
votes
Take a ride on the Reading, If you pass Go, collect $200
Turtlèd, 72 bytes
"K C I I B A V W M G">"GPNCPSCPLBG">"G M C B I R O C V C J">"JSESVPSCTNF
Try it online
> rotates turtle, "foo" writes strings on grid. last " was elidable
2
votes
N(e(s(t))) a string
Take a string as input
- decrement the string pointer, so it points at last char
l move left
[* ] while the current cell is not * … +.r increment string pointer and write the pointed char, move right
'(r write (, move right
_ write * if pointed char is last char, else " " …
2
votes
Vertically collapse text
Take string input
l Move left, off the asterisk at the start of grid
[* ] Until cell is *
,+r_ write *, string pointer+=1, move right, write * if … decrement string pointer, write pointed char
+. …
1
vote
Is it an Odd Word?
Turtlèd, 91 65 64 52 47 67 bytes
More bytes because now takes case insensitive input
Changed approach again
does * for even, else o for odd
(trailing space)
!-u[*+.(a,)(e,)(i,)(o,)(u,)(A,)(E,)(I, …
1
vote
Wave-Particle Duality Laterally Programmatically
take input into string var, char pointer=0, 1st char
- decrement char pointer, mod length input
[* ] while current cell isn't *: … increment string pointer, and write the pointed char
r_ move right, write * if pointed char is last char, else " "
l move left …
1
vote
Esolang-Comment-Template-Generator
take input into string variable
' write space over current cell
[* ] while cell is not *
.+ write pointed … char of string, stringpointer+1 (starts 0)
(| ) if current cell is |
' dl write space (over |), move down, left
r_ …