Top new questions this week:
|
|
Let’s say I have this string: s = “Code Golf! I love Code Golf. It is the best.” I want to replace all the vowels with repeated “aeiou”. Notes: …
|
|
Challenge Given a string of any length which contains only digits from 0 to 9, replace each consecutive run of the digit …
|
|
Part of Code Golf Advent Calendar 2022 event. See the linked meta post for details. Santa and the Elves are secretly preparing for a new tourist train service, called “North Pole Railroads”….
|
|
Part of Code Golf Advent Calendar 2022 event. See the linked meta post for details. Oh no, Santa spilled wine all over his great book. Now most of the letters are illegible. How will Santa now know …
|
|
Scientists have made contact with a parallel universe. Just one problem: They write math differently. Help the scientists make a program that can convert normal math expressions to their equivalent in …
|
|
Given an 8086 segmented (“logical”) memory address, output its actual linear physical address. A segmented memory address has format xxxx:xxxx, where each …
|
|
Challenge: Given the input number n. It should give me nested sublists of n layers with the power of two numbers for each level. …
|
Greatest hits from previous weeks:
|
|
This year’s UEFA Euro 2016 is over and besides a couple of negative headlines there has been a very positive surprise as well – the Iceland national football team. Let’s draw their national flag. …
|
|
The challenge is simple: Print the last, middle, and first character of your program’s source code, in that order. The middle character is defined as follows, assuming a source length of …
|
|
Hold up….. this isn’t trolling. Background These days on YouTube, comment sections are littered with such patterns: …
|
|
NPM’s sloc is a moderately popular tool for counting source lines of code in a file. The tool will attempt to strip out both single and multiline comments and count the remaining lines in order to get …
|
|
In Fewest (distinct) characters for Turing Completeness, the goal is to find the minimum number of characters which make a language Turing Complete…in other words, allow it to do any computation …
|
|
Polygons are named after the number of sides that they have. A pentagon has 5 sides, an octagon has 8 sides. But how are they named? What’s the name for a 248-sided polygon? All polygons are suffixed …
|
|
There are some pretty cool challenges out there involving regex (Self-matching regex, Regex validating regex) This may well be impossible, but is there a regex that will ONLY match itself? NOTE, …
|
Can you answer these questions?
|
|
Strassen’s algorithm was the first method of matrix multiplication in subcubic time complexity, namely O(n**log2(7)) for a pair of …
|
|
Presumably everybody here knows that for the legacy BIOS, the tiniest bootable disk image is 512 bytes (the lower bound is due to the 2-byte magic at offset 510), and there is a bootsector demoscene …
|
