Monday Mini-Golf: A series of short code-golf challenges, posted (hopefully!) every Monday. (Sorry this one's a little late.) I'm sure most of you folks have heard of Levenshtein distance, an algorithm for calculating the distance between two strings. Well, this challenge is about implementing a...

Write a function which takes in a list of positive integers and returns a list of integers approximating percent of total. All values in the returned list must add up to 100 exactly and you can assume the sum of integers passed in is greater than 0. p([1,0,2]) -> [33,0,67] p([1000,1000]) ->

Cramming The Gramming - 14 Tasks In 140 Bytes Your boss has just emailed you a list of 14 programming tasks he needs done as soon as possible. The tasks are simple enough but your boss, being a young software tycoon suckled by social media, insists that you Tweet your solutions back to him in a ...

Counting Abelian groups of a given size code-golf math abstract-algebra Groups In abstract algebra, an Abelian group is a tuple (G, ∗), where G is a set and ∗ is a function G × G -> G such that the following holds: For all x, y, z in G, (x ∗ y) ∗ z = x ∗ (y ∗ z). For all x, y in G, x ∗ y = y ∗...

This reminds me when a few years ago someone uploaded a torrent "Hacker tool: complete list of all IP addresses". This was, of course, just a generated list of the ~4 billion IPv4 addresses, but thousands of "h4xx0rz" downloaded it. Look mum, imahacker! This was then, but nowadays everybody ...

Have you ever wanted to ask the compiler "Why?" Most of us have been frustrated when the code isn't working as it should. Mathworks has therefore implemented a nice little function, why, that answers the question. To give a few examples from MATLAB: why The programmer suggested it. why To fool ...

I wrote this answer in this challenge using Vim script. I think I was really creative and got very proud of my solution. But I am not so sure if this is legal because this program does not print its output to stdout but opens a Vim session with the output of the program. This command will run t...

Output n number of lines (where n is from 10 to 30, each run is random) where each line is either Array of n chars (or String with n characters) int divisible by n double whose first two decimal digits is n boolean No two consequent lines may be same type (so you can't have true followed by f...

The Drunken Knight Inputs a: Starting location of the knight, e.g. A2 b: Target location of the knight, e.g. B4. The starting and target locations may be the same. n: An integer equal to or greater than 0. Output The probability that a knight starting at a, moving at random for n turns, end...