Search
Given a string, convert all of its letters using ROT13, and all of its digits using ROT5. This is sometimes referred to as ROT13.5. Input A sequence of printable ASCII characters (character cod...
The problem Someone has created an encoding format for square bit matrices, however they have found it isn't perfect! One encoding may not decode to exactly one matrix, or it may not even be possi...
Scala 3 and Python 3.8 (pre-release), 2 languages (385 bytes) def String():Any=0 def Int():Any=0 def f(s:String):Any=print(s.replace(chr(81),chr(34)*3+s+chr(34)*3)) class M: f("""def Strin...
Programs may output via exit code Exit codes are to programs what return values are to functions, so it makes sense that exit codes would be allowed.
Abusing native number types It's common to restrict inputs, outputs, intermediate algorithm values, etc. to fit into the native number type of the language. This can be a problem for languages li...
Numerical I/O may be given as a character code Input 64 may be given as @ instead. This mostly exists for languages like Brainfuck that only take input through character codes.
Unless explicitly asking for exactly two values, you may use any truthy/falsey values in decision problems For instance, considering the hypothetical challenge "Determine if a number is non-divisi...
Every outcome must be possible For example, if the challenge requires a random number from 1-5, all 5 numbers must be possible. It does not need to be uniformly random (unless otherwise specified)...
Storing information in the platform specs We should disallow requiring the program to be run on some platform to store information for the challenge. An extreme example would be Nullary, in which ...
Free access must not be finite There has to be a time-unlimited, free way to run the language in question.
Languages with free online interpreters are free This includes all languages currently on tio.run, for example.
Introduction What is the Caesar shift cipher (ROT$n$)? It's basically a cipher sequence that changes a letter's value from the number chosen. If we use ROT1 on "games", we get "hbnft". The basic i...
Today, I have posted my first challenge in Code Golf. I have made the Job in 202 byte. Someone in comments, have changed variables name. e.g: From rot to o, and this renaming have saved 2 bytes. ...
Ruby, 67 65 bytes -2 from Razetime ->s,a{[s.center(l=a.map(&:size).max),*a,"BOTTOM TEXT".center(l)]} Takes the art and outputs as a list of lines. Try it online!
Somewhere Else, there was a long-standing rule that to answer a challenge, you couldn't use languages, language versions, or features that were created or introduced after the challenge was posted....
Answering with languages newer than the challenge should absolutely be allowed Most of the time, when a language is newer than a challenge, it's just a coincidence. By not allowing people to answe...
Haskell, 24 bytes Probably the optimal solution. Credits go to nimi from PPCG. f n=elem n$map(^2)[0..n] Try it online! My original solution, 25 bytes f a=any((==a).(^2))[0..a] Try it ...
APL (Dyalog Extended), 3 bytes √∊… Try it online! Is the square root in the range?
Python 3.8+, 51 byte lambda n:((i:="IVXLCDM".index(n))%2*4+1)*10**(i//2) Testing the code: f=lambda n:((i:="IVXLCDM".index(n))%2*4+1)*10**(i//2) for s in "IVXLCDM": print(s, f(s)) T...
Given a list of non-negative integers the function $f$ replaces every integer with the number of identical integers preceding it (not necessarily contiguously). So f [1,1,2,2,1,3,3] = [1,2,1,2,3,1...
Given a string of Roman numerals, decide whether it forms a valid Roman number. If not, output the substring that proves this, from the list of 50 strings described below. Relevant fact This chal...
HTML, 16 bytes <body bgcolor=0> an attribute that works well for this challenge. tested on Mozilla Firefox. -3 from [Object object]
Javascript V8, 888 bytes $=-~[] *~-((~-~ [])** -~- ~[]); _$=$+ ~[];$$_=_$...
SOGL, 10 bytes ╥‰~⅜,(ε ‘ū Try it here! Built-in compression of "hello"; ", "; "world"; "!", with first letters of words uppercased.
