Triangular honeycomb numbers code-golf math sequence From the infinite triangular array of positive integers, suppose we repeatedly select all numbers at Euclidean distance of \$\sqrt{3}\$, starting from 1: $$ \underline{1} \\ \;2\; \quad \;3\; \\ \;4\; \quad \;\underline{5}\; \quad \;6\; \\ \;\u...

Lengthy numbers easy code-golfdecision-problem Given a positive integer number n > 0 less than 10 digits tell if it can be erased by repeatedly removing #every# occurrence of the length of that number from it. Easy version of Lengthy numbers. The full challenge is more heavy because it requires ...

This challenge requires a small amount of knowledge about chess. A description of the details required can be found at the bottom if you are not familiar with chess or want a refresher. For a certain board configuration consisting only of queens we can say that each queens threat number is the n...

Box blur the string code-golf string Box blur is a simple operation for blurring images. To apply box blur, simply replace each pixel with the average of its and the surrounding 8 pixels' values. Consider, for example, the following example, in which each "pixel" has a one-digit value: \begin{arr...

Following last year's event, we're doing Advent of Code Golf 2022! On each day between Dec 1st and Dec 25th (inclusive), a new challenge will be posted at UTC midnight1. It is a free-for-all and just-have-fun-by-participation event, no leaderboards and no prizes for solving them fast or solving t...