the k tree

3:15 PM

how to find the longest run of 1s in a boolean array?

so 1 0 1 1 1 0 will give 3

3:30 PM

ok i think i came up with something

ngn/k, 15 bytes: 1++/{x=y+1}':&:

idk if that works for every case

2 hours later…

5:41 PM

you can do |/{y*x+y}\ ngn.codeberg.page/k/#eJxLs6rRr67UqtCurI3h4kpzMFQwUDAEQQBjqgaN

Transcript for

Jul '221

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC