Inspired by this challenge, as well as a problem I've been working on
Problem:
Given a non-empty set of points in 3D space, find the diameter of the smallest sphere that encloses them all. The problem is trivial if the number of points is three or fewer so, for the sake of this challenge, the num...
The Goal
The goal of this question is to put a twist on this question. Your answer should be able to convert an array of words associated with integers into those integers. As an extra challenge, allow support for , +, -, and _ in between numbers such as sixty seven, sixty+seven, sixty-seven, or...
Partial sums of the kempner series code-golf math sequence
The Kempner series is a series which sums the inverse of all positive integers which doesn't contain 9 in their base 10 representation (\$\frac{1}{1} + \frac{1}{2} + \frac{1}{3} + .. + \frac{1}{8} + \frac{1}{10} + ...\$).
It can be shown ...
Disclaimer: I do not condone or commit war crimes. The above messages are a very cringe and edgy attempt at humour and should not be taken seriously. Please don't cancel me on twitter
Task
Given a positive integer number and a threshold, split into every possible way without generating any numbers above the threshold.
Examples
Input: 15008
Threshold: 400
Valid Output:
[[1, 5, 0, 0, 8], [15, 0, 0, 8] [1, 50, 0, 8], [150, 0, 8]]
Invalid outputs:
[[1, 5, 0, 0, 8], [15, 0, 0, 8...
```Traceback (most recent call last): File "C:\Users\kidss\Desktop\leveshain.py", line 20, in <module> print(len(a(a(strs)))) File "C:\Users\kidss\Desktop\leveshain.py", line 18, in a new = set(new) TypeError: unhashable type: 'list'```
@ReedsShorts For future reference, we usually recommend editing your existing, deleted answers the fix them, then undeleting them, rather than posting a new answer
Task
Given a positive integer number and a threshold, split into every possible way without generating any numbers above the threshold.
Examples
Input: 15008
Threshold: 400
Valid Output:
[[1, 5, 0, 0, 8], [15, 0, 0, 8] [1, 50, 0, 8], [150, 0, 8]]
Invalid outputs:
[[1, 5, 0, 0, 8], [15, 0, 0, 8...
