200-400 rep for discompassionate geometry
Construct a pentagon avoiding compass use is about finding a compass-and-straightedge construction of a regular pentagon while minimizing the number of circles drawn.
The Poncelet-Steiner theorem says that any construction possible with a compass and st...
Character Frequency in a Random String
Tags: code-golfrandomstringcounting
Given a random string of printable ASCII, output the frequency of each character in that string.
The Challenge
Input is given as a string of random, printable ASCII characters (decimal [32-126] inclusive).
Output the ...
Modern regular expressions (regexes) have many features (\d, {n,m}, \1, etc.), but to define a regular language (modern regexes can define broader classes of languages, in their defense), all you need are three operators: concatenation (+), union (|), and the Kleene star (*). Here are some exampl...
Bits and Bytes constant generation
In this challenge, you have to generate the shortest Bits and Bytes program that outputs an integer input. For the simplicity of the challenge, you only have to search with ! and <.
Input / Output
Input will be one integer. Your program should output the shor...
At work I've been acting as quality control on our public documents, to make sure that they are WCAG 2.0 compliant. Given the length of some of these documents there tend to be issues, and so I record the issues and the pages they occur on.
The challenge: Given a string input, output a count of...
The other day, our team went to an escape room. One of the puzzles involved a board of six mechanical switches where you had to find the correct combination of on and off in order to unlock a box, somewhat like this:
-v-v-v-
-v-v-v-
Being developers, we decided it would be more efficient to tr...
I have two lists. Both are sorted lists of numbers. Say:
A = [1.1, 5.2, 12.3, 12.6]
B = [2.3, 2.7, 5.2, 11.1, 12.1, 15.6, 16.6]
For each number in A I find the nearest value in B. E.g.
1.1 -> 2.3
5.2 -> 5.2
12.3 -> 12.1
12.6 -> 12.1
I would now like to split B into a list of lists using t...
Like Brainfuck would be one of the most efficient in terms of number of characters needed, but what languages would have the highest amount of information per character?
I'm thinking of APL, and J (scraped from code golf forum), but there must be more.
