00:00 - 19:0019:00 - 00:00
Challenge
For any string that is composed of lower cased alphabetical characters, make a function that returns a list of all of it's variations, empty strings returns empty list.
Test Cases
"" -> []
"a" -> ['a', 'A']
"ab" -> ['ab', 'Ab', 'aB', 'AB', 'ba', 'Ba', 'bA', 'BA']
"abc" -> ['abc', 'A...
Introduction
There are lots of challenges asking for a shortest program to calculate mathematical constants. I saw some with restrictions like banning the literals 3.14 and PI etc. However, there seems no such challenges using the number of distinct characters as one of the criteria.
The Challe...
I call this sequence "the Jesus sequence", because it is the sum of mod.</pun>
For this sequence, you take all the positive integers m less than the input n, and take the sum of n modulo each m. In other words:
For example, take the term 14:
14 % 1 = 0
14 % 2 = 0
14 % 3 = 2
14 % 4 = 2
14 % 5...
0
I wrote a challenge about sampling a probability distribution: Sample the Pareto Distribution
This probability distribution is defined over the real numbers. However, submissions do not have access to true real numbers, but merely imprecise approximations of real numbers. I wanted to allow submi...
Unary numbers typically only represent nonnegative integers, but we can extend them to represent all integers as follows:
A positive integer N is represented as N 1's: 5 -> 11111
A negative integer -N is represented as a 0 followed by N 1's: -5 -> 011111
Zero is represented as 0
We can then r...
In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations) that starts with the unary operation of successor (n = 0), then continues with the binary operations of addition (n = 1), multiplication (n = 2), and exponentiation (n = 3), after which the sequence proceeds with further binary operations extending beyond exponentiation, using right-associativity. For the operations beyond exponentiation, the nth member of this sequence is named by Reuben Goodstein after the Greek prefix of n suffixed with -ation (such as tetration (n = 4), pentation...
Anonymous
Anonymous
Anonymous
Given a nonnegative integer, return whether it is a three digit number ending in one, in any consistent integer base. In other words, the number needs to be represented in base-N, N being an integer greater than zero.
Rules
This is code-golf, so shortest answer wins.
Since unary behaves weirdl...
Anonymous
Anonymous
I am new to Python. I am getting indentation error whenever i run my script.
The error looks like this
$python main.py
File "main.py", line 181
audior = pyaudio.PyAudio()
^
IndentationError: unexpected indent
Here's that part of my script where the error is being encountered
def onO...
1
00:00 - 19:0019:00 - 00:00
