There was a prior question about golfing an HQ9+ compiler that translates HQ9+ code into the language it is written in, but that was closed as a duplicate of the interpreter challenge because converting an interpreter to a compiler is seen as trivial. This question is based on the closed one, but...

Night hike We want to go on a night hike with the youth group, but of course not everyone has their torch, even though we told them we planned to split up. What options are there for group formation if n teens have m torches with them, but each group needs at least one torch? Example: Three teens...

Sometimes I see a claim like "80% of respondents agreed" and I think "what was your sample size? 5?" because, of course, with a sample size of 5 it's possible to get 80% to agree on something. If the claim is "47% of respondents agreed" then I know it must be a larger sample size.[1] challenge Gi...

Challenge Create a sorting algorithm in as few bytes as possible. It can be, at worst, O(n^2). No loopholes (such as Stalin Sort). Input An array of numbers. Output You can print an array of numbers in order, or you can print them (ordered) one by one. Rules Program must run in O(n^2) time or be...

Challenge Create a sorting algorithm in as few bytes as possible. It can be, at worst, \$ O(n^2) \$. This can be insertion sort, mergesort, quicksort, or any other sorting algorithm with \$O(n^2)\$ time complexity. Input An array of numbers, such as [1,2,3] or [41,17,8]. Output You can print an a...