Charcoal, 9 bytes ≔¹ξＷ¹«ξＲ⁰ Try It Online! Link is to verbose version of code. Explanation: ≔¹ξ Assign 1 to X Ｗ¹« Start The Infinite Loop ξ Print X without Casting Ｒ⁰ Refresh with min 0 secs [Implicit increment] Every number splits by [2J[0;0H I think the The output with trailing separator...

Move the next greater number, with fewest fails to take everything Your task is to move the next greater number, with fewest fails to take everything A fail counts if a step is the lower number (not counting equal) The starting point is the top left corner Example: 1234 Can do like this >>> Bec...

Write a program that takes two lists of strings and generates a javascript regex that fully matches all the strings in the first list and matches none of the strings in the second list. To be specific when for all stings in the first list str.match(\[your-output]\) must produce a match for the fu...

TLDR: This is the hexagonal version of Is this square symmetrical? Given a hexagonal grid, decide if it is symmetric. The shape of the grid is a regular hexagon. Each cell in the grid has two possible states. Let's only consider reflections and rotations. Here are all the possible symmetries: Re...

Given a variable a (non array) or (any[]) convert to (any[]) function example(s: string | string[]) { const e = [...(Array.isArray(errors) ? errors: [errors])] return e }

Let's have an list of positive integers [6,1,9,3,7,4,6,3,2,7,6,6] this will represent a river. We would like to skip a stone across this river. We can throw the stone as far as we want and whatever number it lands on it will skip that many places. So if we start by throwing it 2 spaces, it wi...

code-golf Trap the hero in a maze You are an evil wizard, doing evil wizard business when suddenly your crystal ball alerts you of a hero on their way to defeat you. To crush their hopes and dreams, you decide to trap the hero in a maze. You could just make a big maze, but where would be the fun ...

Move the next greater number, with fewest fails to take everything Your task is to move the next greater number, with fewest fails to take everything A fail counts if a step is the lower number (not counting equal) The starting point is the top left corner Example: 1234 Can do like this >>> Bec...

For example, take a look at this answer, This answer is another answer but translated\$^1\$. What I should do if there is a translated Copy answer, Should I flag? 1 Only Language derivatives

Caves and Cliffs edition Part 1, Very related You're given a piece of ASCII art representing a piece of land, like so: /‾\ _ __ __/ _/ \‾ _/ __/‾\ | / / ‾\ | \_/‾ \_/ But unlike in the previous challenge, the terrain is mountainous, with caves and...

Only one from each set Your input is a set of sets of positive integers. For example: {{1}, {2, 3}, {2,4}, {1,4}} Your task is to output the maximal number of elements that can be picked from the sets with the following conditions: You can only pick at most 1 element from a set You can't pick t...