« first day (1323 days earlier)      last day (212 days later) » 

oeuf
oeuf
08:33
I wrote a very long solution to Let's build a Staircase right now. Any suggestions?
Having to use bitly because it was too long: bit.ly/3sf1V7t
oeuf
oeuf
08:45
Managed to golf down from 91 bytes to 84 but still incredibly long: bit.ly/3VNu17q
Also it seems to got the last test case wrong
Golfed once again to 70 bytes: bit.ly/3grSfng
 
4 hours later…
coltim
coltim
12:52
@oeuf I think you can take the input as a list of strings, rather than as a single new-line delimited string
I suspect that there is a better way to strip out the non-alphanumeric characters
one example would be ngn/k, 19 bytes: {("0:"'x)*"a{"'_x}_
coltim
coltim
13:25
Also, you can paste very long links in this chat, you just need to do a Shift+Enter first
You can do t@=#'t instead of t@.=#'t
and generally on the stack exchange code golf the output formats are quite flexible, so you should be okay returning a list of strings (rather than "printing" them out with `0:)
 
4 hours later…
coltim
coltim
17:53
@oeuf you could use a monadicFunction/ "converge-loop" to handle that aspect

« first day (1323 days earlier)      last day (212 days later) »