Challenge Given a positive integer n, you must calculate the nth digit of \$e\$, where \$e\$ is Euler's number (2.71828...). Rules The format of the output can be a number or a string (e.g., 3 or '3') You cannot use any external libraries or constants Example # e = 2.71828... nthDigit(3) =>...

Omit needless spaces for me code-golfpython A great Python golfing tip is to omit needless spaces. But if you are like me, you don't always have the time to search for which spaces to remove. If only there was a way to speed up the process... Task Given a single line of Python, as input, retur...

I came across an interesting tiling of the plane using squashed hexagons in a popular math book. All the six edges of the squashed hexagon are the same length. Two opposite corners are right angles and the rest four corners are 135 degrees each. This shape allows four squashed hexagons be arrange...

Bilibili AV/BV Code Conversion code-golfconversion Background Bilibili is a China-based video sharing platform, similar to Nico Nico Douga in Japan, and Youtube around the world. Since the establishment, Bilibili had been using the AV code to reference a video. An AV code is a string of 3 or ...

There are \$a\$ honest man(always tell the truth), \$b\$ dishonest man(always tell lie), and \$c\$ random man(tell random T/F). How many times at least should you ask one of them a question to guarantee you get knowledge of who they are? You may assume that it's possible. Notes: I don't know i...

Help with a complex piece of code that should say "Happy birthday", not overtly so from looking at the code, but rather from running it.

Currently I have a plot that shows all the shortest paths between all the nodes in my network and my target: Now I would like to make a colormap, where I would color the origin nodes and the edges based on the distance of the shortest path. Can anyone help me? Here is what I have: import netw...

The task Given an integer c, output two integers a and b where a * b = c and each a and b is closest to sqrt(c) while still being integers. Test cases Input: 136 Output: 17 8 Input: 144 Output: 12 12 Input: 72 Output: 9 8 Input: 41 Output: 41 1 Input: 189 Output: 21 9 Rules a, b an...

We define \$a(n)\$ as the 1-indexed position of \$n\$ in the sequence of positive integers with the same binary weight, i.e. the same number of 1's in their binary representation. This is A263017. Given a positive integer \$n\$, your task is to determine how many positive integers \$k\$ satisfy:...

The variable star designation is an identifier for a variable star (a star that fluctuates in brightness). It consists of either a 1-2 letter code or (when the letter code is no longer sufficient) a 'V' followed by a number. This code is followed by the genitive of the star constellation the star...

Challenge You have been given a string of digits 0-9.1 Your task is to shuffle this string, but every index must have a different value than it did before the string was shuffled. For example: In : 287492 Out: 892247 If this is not possible, return false or something similar. (null, undefine...

If you are given an array of numbers between 1 and 100 and an integer n, you must remove any instances of an item that appear greater than n times. For example: In : [92, 41, 81, 47, 28, 92, 84, 92, 81], n = 1 Out: [92, 41, 81, 47, 28, 84] The most aesthetic/simple algorithm wins. And since t...