0
Introduction
A popular word puzzle is to convert one word into another via a series of steps which replace only one letter and which always result in a valid word. For example, BAG can be converted to DOG via a path of five steps:
BAG -> BAT -> CAT -> COT -> COG -> DOG
Shorter paths also exist...
Digit Sum of Sum of Digit Sums
Input: An integer from 1 to 1000 (known as N)
Expected behavior: The code will go through the first N integers, and work out the digit sum for each integer, the code will then take these digit sums and add these together. The code will then take this total and work...
Text editor
In this code golf problem, the programmer should make a text editor written in as few bytes of source code as possible. (Either a line editor or a visual editor is okay; it can be non-interactive.) One should implement at least:
Reading content from a file
Inserting text
Deleting t...
Premise:
Your reputation is in Stack-Exchange Form if it can be represented by decomposing your medal counts (gold, silver, and bronze counted separately) into their base-10 digits and joining them in any given order, with a few caveats.
While decomposing, each
Gold medal digit is worth thr...
I need to construct a functor that iterates over the linear representation of a sublattice of size dx,dy,dz,dq embedded in a lattice of size nx,ny,nz,nq. The sublattice corner is shifted by (lx,ly,lz,lq).
Since the functor can be called million of times, the goal is to produce the most efficient...
The prospect of this challenge is:
If your program is run normally, all of the code in the speech marks (" - double quotes) should be printed.
If your program is wrapped in double quotes (in turn inverting the speech marks), the code that is normally not in quotes should be printed.
E.g:
Let...
