Create a binary wall code-golf Given an array of positive integers, n > 0, output their representation of a binary wall. How does this work? Convert each number to it's binary representation. Pad the representation with leading zeroes to the length of the longest one i.e. 1, 2 -> 1, 10 -> 01...

This is similar to Making an acronym, but there are several key differences, including the method of fetching the acronym, and this challenge including flexible output. Task Given a string containing only printable ASCII, output all capital letters in the input that are either preceded by a spa...

(Despite 60+ questions tagged chess, we don't have a simple n-queens challenge.) In chess, the N-Queens Puzzle is described as follows: Given an n x n chessboard and n queens, arrange the queens onto the chessboard so that no two queens are threatening each other. Below is an example solution fo...

Multiplying strings Inspired by this challenge, your task is to take two printable ASCII strings and multiply them element-wise with a certain rule. How does it work? Given two strings (for example hungry and wood) you will first, truncate the longer one such that they have equal length and th...

Let us define a sequence. We will say that a(n) is the smallest number, x, that has the following properties: x and n are co-prime (they share no factor) x does not appear earlier in the sequence |n - x| > 1 Unlinke most sequences the domain and range of our sequence are the integers greater...