Search Results

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. …

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. …

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: …

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. …

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

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 ({}≤ …

Vim, 27 23 keystrokes First vim answer ever, haven't used vim at all really even. A/<esc>:s#//#/\\<cr>:s#\./# .<cr> How it works: It appends a / at the end of line, subs // for /\, subs ./ for .

Python, 129 79 78 bytes Gotta submit fast! lambda n:n.lower()[:3]in" 0 f n no nil fai fal nan not nul off und".split(" ") True is false and false is true; I have a nice rhyme for this, I really do …

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 …

Python 3 2, 79 74 69 65 68 67 bytes Thanks Dennis! def f(n):i=l=len(`n`);s='';exec n/l*"s+=`i`.zfill(l);i+=l;";print s byte count increase from bad output method

Python 3, 114 110 bytes My first code golf. Thanks to Dr Green Eggs and Iron Man for saving 4 bytes. l,x=1,0 f,y,s="ghosGHOS","pelPEL",input() while s[x:]*l:l+=(s[x]in y)-(s[x]in f);x+=l>0 print("_ …

Python 3, 121 124 bytes Fixed stupid mistake s='' for i in input():_=ord(i);s+=("",i)[91>_>64or 47<_<58] x=len(s) c='+'+"-"*x+'+' print(c+"\n|"+s+"|\n"+c+"\n"+" "*x+"v") does not import libraries …

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 +. …

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 " " …

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 …