There's an interesting operator (atom?) in Jelly which is an m with a dot over it. It's called mould left like right. Essentially, it takes in two inputs, where the left one is an array and the right one is an array of arrays; they have same number of total elements when flattened, and makes the ...
Which stall will be used
Introduction
In the building where I work, each washroom has 2 doors and somewhere between 5 and 10 stalls. After sometime, I realized that I and most of other people choose which stall to use base on 2 criteria, in decrease priority:
The one with minimum number of oc...
Display a clock face code-golfascii-artkolmogorov-complexity
Display the 12 numbers on a clock face exactly like this.
12
11 1
10 2
9 3
8 4
7 5
6 ...
Expand the Binomial
code-golf math
Challenge
Given three numbers a, b, and n, you must expand (a + bx)^n in ascending powers of x up to x^3.
Binomial Expansion
The binomial expansion works like so:
(a + bx)^n = a^n(1 + bx/a)^n
= a^n(1 + n(bx/a) + n(n -1)(bx/a)^2/2! + n(n-1)(n-1)(...
One Expression, Many Values code-golfnumberarithmetic
Using our familiar mathematical symbols: +, x, parenthesis, and any rational number, it's easy to create expressions that evaluates to some desired number. For example: 1+(2x3)=7, (1+2)+(3x6.5)=22.5 and so on. Boring enough.
In this challeng...
My latest question was well received but has sat idle for a few days now. That's pretty much what I'd expect, since it's quite involved, but I was hoping it might get at least 1 answer over the week.
I have my own solution which I created before posting the question to check if there were any go...
How can an iterative dfs topological sort be accomplished on a directed acyclic graph?
Here is a vertex
class Vertex {
List<Vertex> adj = new ArrayList<>();
char val;
Vertex(char val) {this.val = val;}
}
A recursive solution is straightforward and looks like this:
List<Vertex> sortR...
