There are many ideas of code-golf challenges out there that are abandoned because a part of them are just too hard to implement with a reasonable amount of effort. For instance, requiring to parse complicated stuff (this can be avoided by flexible input format), big number arithmetic (avoided by ...

Challange Make a triangle of number like below. How to? Let say we get a number in the form of ab, for example 12. We then create a triangle like below: Sorry for my bad drawing! First we have 12, and we take sum of the two number 1 and 2, which is 3. In case the sum of two number are greater th...

Description Chicken McNugget numbers are numbers that can be expressed as a sum of 6, 9 or 20 - the initial sizes of the famous Chicken McNuggets boxes sold by McDonald's. In that sum, a number may occur more than once, so 6 + 6 = 12 is such a number too, and the number must "contain" at least o...

Write a netquine There are a lot of online interpreters, for a lot of languages. For example, there's the ubiquitous TIO, but there are also smaller, more specific ones that others have made, such as interpreters for Vyxal, ngn/k, or Grok. Your goal today is to write a netquine, or a program whos...

This is a code golf challenge. Only the shortest user-defined function in a language counts. This function should output (input/2)+2 for even numbers, and (input+1)/2 for odd numbers.

Given an integer \$ n \$ \$ (n \ge 1) \$, return/output the total sum of set bits between \$ 1 \$ and \$ n \$ inclusive. To make the problem more interesting, your solution must run with a time complexity of \$ \mathcal{O}(\log n) \$ or better. This is OEIS A000788, not including \$ n = 0 \$. Her...

Consider a program of a length \$2^n\$ (where \$n\$ is a positive integer) which outputs its own length. However, when split down the middle into two equally sized pieces of code, each of these pieces of code outputs \$2^{n-1}\$ i.e. their own length. For example, if abcdefgh output 8, then abcd ...