Personally, I think people should be nominating any and all posts they think could be deserving. Worst case scenario is that you don't win the bounty, no-one's gonna think "Oh look at this self-aggrandizing fool" because you think an answer/challenge of yours is cool
So yeah, @Lyxal, @Bubbler, go ahead and post your nominations, I'm dropping upvotes to pretty much everything that gets nominated :P
Background
A little while ago, someone posted an interesting puzzle on Math.SE:
What is the smallest digraph (directed graph) G where the following eight graphs are all distinct:
G, the original graph
Reflexive closure of G
Symmetric closure of G
Transitive closure of G
Reflexive symmetric clos...
Our school has a great overestimation of their cooking abilities
It's supposedly "healthy", although the joke is of course that there's half as much sugar/fat/salt because they give us half the amount of food we need
I mean I'm mostly fine with the food at my school but if you blindfolded me and had me eat something from there I probably wouldn't be able to tell you what it was supposed to be
My main complaint is just that there's so little, and that the amount stays the same each year despite the cost increasing
Challenge
The goal of this challenge is to make a function that takes two paragraphs and output a merged result with removing duplicated lines. Each input paragraph is with the follows specifications.
The leading/trailing spaces in each line have been removed.
No empty line.
The output merged...
CMC: Given a floating-point (or double if your language doesn't support float) number, return (any or all of) the nearest floating-point number that is not equal. Example: for a double of 2**53 return 2**53-1 (because it's closer than 2**53+2)
Input
A short string of length at most 10 with characters from a-z.
Output
The approx count that Google reports for the number of hits.
Example
Input: "fish".
Output: 2280000000
Input: "quantock"
Output: 1350000
You may use any regional Google you like.
This is code-golf, so the shortest code in ...
@RedwolfPrograms Personally, I'm in favour of occasional reposts, and the circumstances around this one basically negates the concerns/counterarguements (e.g. OP's original work, answers can be ported, etc.), so regarding the reposting side, I say go for it, and VTC the old one as dupe
CMC (reposting because not many people answered last time): Find all increasing and decreasing runs of an array, and reverse each. Earlier runs take precedence.
@Anush Even for the most experienced challenge writers, hard challenges can be difficult to get right. I know it’s often a bit of a hassle, but using the Sandbox really is the best way to avoid VTCs and downvotes when posting a challenge
3
Also, we now only have 5 categories that are “uncontested” for the Best Of 2020! Let’s see if we can get to 0!
@cairdcoinheringaahing it'll be 4 when I'm next at my computer
@RedwolfPrograms whenever I see a chrome book on display in technology stores, I like to go over to it, push random buttons on the keyboard and say "hehe look at me I'm redwolf"
Background
A little while ago, someone posted an interesting puzzle on Math.SE:
What is the smallest digraph (directed graph) G where the following eight graphs are all distinct:
G, the original graph
Reflexive closure of G
Symmetric closure of G
Transitive closure of G
Reflexive symmetric clos...
Challenge
The goal of this challenge is to make a function that takes two paragraphs and output a merged result with removing duplicated lines. Each input paragraph is with the follows specifications.
The leading/trailing spaces in each line have been removed.
No empty line.
The output merged...
