« first day (4777 days earlier)      last day (50 days later) » 

9:16 AM
Can I golf this further? {b.sort();b[27]>1||b[32]<1}. Wonder if I can get rid of the || somehow
Values are guaranteed to be between 0 and 4 inclusive
3 hours later…
12:15 PM
Q: Code Golf Polish Notation Javascript

Dark KillPolish notation is a way of writing mathematical expressions that do not require parentheses. For example, + 3 4 is equivalent to 3 + 4. Where the advantage is seen is in expressions like * - 5 6 7, which is equivalent to (5 - 6) * 7. Builds an anonymous function in JavaScript (version ES2017 or ...

1:00 PM
Q: Pareto-optimal shortest paths

user1502040Given a directed graph on the nodes 0, 1, ..n, where each node has two non-negative integer edge costs, return the set of all possible Pareto Optimal path costs between node 0 and node n. These are the costs of paths which are optimal for some positive linear combination of the two given costs, o...

1:55 PM
@NewPosts The answer to this question was good, shame it got deleted
2:23 PM
hmm, best I could do using eval was 70 bytes in Charcoal
for some reason I was reminded of the joke "What's purple and commutes?"
I'm now unsure as to whether I got the lamer half of the pun originally
I can transpile it to infix notation in 42 bytes of PCRE regex
2:43 PM
@NewPosts i wonder what the answer to this is
i got NzAwMGRjOTUz
i think it is correct
4 hours later…
6:45 PM
Is there is an easy way to test that all edges in a graph are in a 3+cycle? (In python)
2 hours later…
8:20 PM
@Simd Not sure about easy, but "all edges are part of some cycle" is equivalent to "the graph contains no bridges" or "the edge connectivity of each connected component of the graph is >= 2". You might be able to find some algorithms using that terminology.
should i put jelly on my resume
@UnrelatedString Absolutely
@UnrelatedString No, you should keep your resume clean and not spill food on it
8:36 PM
@cairdcoinheringaahing Could you please unfreeze The Tarpit?
1 hour later…
9:43 PM
A: Sandbox for Proposed Challenges

emanresu AReconstruct a list from its prefixes A list \$[a_1,a_2,a_3 \cdots a_n]\$ can be uniquely represented as the set of its prefixes - \$ \{\{a_1\},\{a_1, a_2\}, \{a_1,a_2,a_3\} \cdots \{a_1,a_2,a_3 \cdots a_n\}\} \$. This can be in any order - for example, \$[1, 2, 3]\$ could be represented by any of...


« first day (4777 days earlier)      last day (50 days later) »