@Steffan for the infinite candle sequence q, i have a solution thats 64 bytes (saves 12 bytes over ur 76 bytes answer), without just blindly copying over the previous solution :P. not gonna share it immediately to see if u can get the solution (or maybe even find a better golf!)
i was just editing a gradle build script and was typing out freeCompilerArgs. just a few minutes earlier i was researching phytoplankton, and one of them produces "yessotoxin". so with those 2 words in my mind, my fingers ended up typing freeCompilerToxins...
This may be an odd query: Could I have some feedback on this challenge proposal, please? I have had it in the sandbox for merely a day, so this may be premature. What is wrong with it? What can I improve?
@Pyautogui given that im already trying to think of smart ways to solve it, id say its definitely a pretty good looking challenge
i guess my main question, which may have something to do with my already planned answer, is whether the input values for T, F, and U have to be the same as the output values
Task
The input consists of a JSON object, where every value is an object (eventually empty), representing a directory structure. The output must be a list of the corresponding root-to-leaf paths.
Inspired by this question on StackOverflow.
Input specifications
You can assume that that the input...
Thanks for the feedback @user. I will fix those problems. @emanresuA, is the fact that you have a one byte-er solution so quickly a mark of an uninteresting problem, or is it still a challenge worth posting?
My next KoTH will probably be Python (since it involves coordinates and vector math, which I don't want to deal with in Java) so maybe that one? Should submit something to the sandbox in a week or so (want there to be a bit of a break between King of the Holster and this one).
another idea: make all builtins 1-character expressions which LOOK like the whole word, but underlined, so you can have variable in and the 1-byte symbol "in" which can be entered with something like `i.
> another idea: make all builtins 1-character expressions which LOOK like the whole word, but underlined, so you can have variable in and the 1-byte symbol "in" which can be entered with something like `i.
> With const val, const is a modifier on val rather than a keyword. Modifiers > keywords. More examples of this same design are, annotation/enum/data class, private val, inline fun, etc.
The second line, which I'm removing because it's not subtle enough, was this:
IF YOUR FORGOT WHICH DAY YOU FIRST READ IT ON OR IT WAS ON AN AIRPLANE OVER THE NORTH POLE AT MIDNIGHT BETWEEN MONDAY AND TUESDAY YOU HAVE A CHOICE BETWEEN APACHE AND ANY CREATIVE COMMONS WITH AN ODD NUMBER OF BITS IN THE UTF-9 REPRESENTATION OF ITS NAME, WHICH SHOULD BE DECIDED USING A MAGIC 8 BALL OR DIGITAL REPRODUCTION OF ONE
wt...wth...I'm working with a rather complicated recursive sequence, having to do with binary trees with some complicated properties, and there's a closed form formula for it
Create a program that may or may not determine if a list is in this sequence
code-golf sequence code-generation random
Your task is to write a program which returns another program which has a nonzero chance of correctly determining if an inputted list is in a sequence described below. This can e...