« first day (849 days earlier)      last day (80 days later) » 

2:01 PM
@UnrelatedString hm, have you solved a challenge (oftentimes called "CMC") in here completely?
it looks like you've been trying a lot, but I haven't really found anything you've completed, however I've seen that you've solved challenges outside of this room
you can try one or more of these ;)
 
 
6 hours later…
8:09 PM
I've tried some of the ones there but I'm not sure I've recorded my solutions, and I've definitely not tried them all
Here's my solution to "Create an N×M 2D array"
 
@UnrelatedString alright, I've upped you a level :P
 
basically that's why I asked, because it seemed a bit odd to have you at level 0 while knowing you're doing a lot here ;)
 
8:58 PM
And a similar solution for "Draw a square with side length N"
 
9:13 PM
Now I've solved "Find the largest list of consecutive positive integers that sum to N", but it's 2 bytes longer than the minimum, and I have no idea why I need a second .
 
 
1 hour later…
10:42 PM
@UnrelatedString Maybe this will clarify why you need a second . To put it simply, I think the first actually operates on the input - right argument - which then gets passed as a right operand to the dyad in the filter (so it does inputṪ, which in Jelly happens to coincide with input itself for integer input), then the second gets the tail of the filtered list.
Or just start a new monadic link instead to see the difference.
 
11:27 PM
Ah, that makes a lot of sense.
 
11:47 PM
...and I just realized that my square solution doesn't quite work right for inputs greater than 9
 

« first day (849 days earlier)      last day (80 days later) »