Convert A String To Shorthand Shorthand has been used for hundreds of years to compress and speed up the speed at which someone can write down what is said. It does this using several abbreviating methods; three of which will be used here to compress a sentence. Challenge When given a sentence, a...

Modular Chain Compression code-challenge optimization A common trope in some compression challenges is to use repeated application of the modulo operator in order to compress large integers or string hashes into some range. For example, we can squash the numbers \$13,4,16\$ into \$0,1,2\$ by taki...

Task Given an integer \$n\in[0,10^{12})\$ in any convenient format, return the number of strokes needed to write that character in simplified Chinese. Background Chinese numerals are expressed in base 10 with a system of digits and places, with an important distinction that digits are in groups o...

Similar in spirit to Number of distinct tilings of an n X n square with free n-polyominoes and Partition a square grid into parts of equal area, this challenge will have you count ways of partitioning a triangle in a triangular grid. The goal of this code-golf challenge is to write a program that...

Background Two number \$a\$ and \$b\$ are said to be connected by a brussels choice operation* if \$b\$ can be reached from \$a\$ by doubling or halving (if even) a substring (the substring must not be empty and may not contain any leading 0s but it can be 0) in the base-10 representation of \$a\...

what is the difference between these two sentences? Sentence 1: they could've been done to organize the logistics. Sentence 2: they could've done to organize the logistics. Will there be any difference if we skip been from the sentence?

Up to 450 rep for answering Fewest (distinct) characters for Turing Completeness in Whispers I'm offering a 150 rep bounty to anyone who posts a competitive (in my view) answer to Fewest (distinct) characters for Turing Completeness using Whispers. In addition, I will award a further 300 reputati...

Longest Repeated Substring code-golf string Given a string, determine the longest substring that appears at least twice in that string. If there is more than one longest substring, output the first one that appears in the input. Repeated substrings may overlap with each other. Output an empty s...

Is $input almost-prime? codegolf Definition: A positive integer n is almost prime, if it can be written in the form n=a^k where a and k are also positive integers. In other words, the prime factorization of n contains only the same number. Input: A positive integer n<=2<=2^31-1 Output: a distinct...