Search Results

Pyret, 65 bytes {(x):string-from-code-points(string-to-code-points(x).reverse())} Unfortunately Pyret doesn’t have a built in string reverse function, so you have to convert it to a list, reverse i …

Racket, 39 bytes ((λ(x)(x x))(λ(x)(x x)))

Haskell, 9 bytes main=main Defines the main function (required to run) recurring on itself, resulting in an infinite loop.

Pyret, 7 bytes a=_ + 0 Returns exactly what is passed to it. Underscore paired with an operand implicitly makes a function.

Haskell, 3 bytes sum Function that takes an argument as a list e.g. sum[1,2,3] and returns the sum of the list.

Racket, 46 bytes (λ(x)(if(eq? x"google")(-)(string-length x))) Try it online! Gives an arity mismatch error on the input "google" since - needs at least one argument.

Racket, 63 bytes #lang racket (display(file->string(find-system-path'run-file))) Try it online! Pretty straightforward - just finds the current file, reads it, and prints it back out.

Haskell, 18 bytes f s=s>>= \c->[c,c] Try it online!

Racket, 15 bytes (display "(y)") Try it online!

Racket, 202 bytes, Safe #lang racket (define (h z) (when (procedure? z) (error "you lose")) (define a (λ (x) (not x))) ((λ (f) (call/cc (λ (k) (k (or (a z) (set! a ((eval f) k))))))) z) (and …

Python 3, 11 bytes print('K')# The average value is 75.09, which rounds to 75 - K.

Racket, 37 18 bytes (λ(x)(apply = x)) Try it online! -19 thanks to Wezl This takes advantages of the fact that = in Racket can take any number of arguments. Note that the tio seems to run an old ver …

Racket, 30 bytes (λ(f g x)(apply g (map f x))) Try it online! Takes a and b as a list i.e. '(a b).

Python 3, 88 bytes import sys s=945 if sys.argv[1:] else 913 for i in range(s,s+25): print(chr(i),end='')

Haskell, 47 bytes a 0 n=n+1 a m 0=a(m-1)1 a m n=a(m-1)(a m (n-1)) (Run using ghci <filename>) Almost directly copies from the problem definition (thank you pattern matching!).