Emigna

It's implemented that way to handle negative values. So 2(L would be [1,0,-1,-2] for example. I don't recall having needed that functionality though. Ÿ is probably better suiting for handling negatives since L can only ever start at 1.

So 3L2Q = [0,1,0] but 3L2.Q = 0

Actually, .Q does not vectorize

I am not aware of a difference between .Q and Q either. Every time I've tried .Q it has behaved exactly like Q, but costs a byte extra

@Grimy ‚Θà would be a byte shorter

Most commands are there

The language bar Adám made is very helpful

ZÊ is technically better since it's easier to type ;)

And that as well yes :)

@Grimy this would be 22

Ah OK. Never used ÅL so I did wonder why it existed :P

‚à works as a 2-byte alternative

All very good ideas. I can't say I've ever needed P/O to work on mixed lists, but I can't see a drawback to them having this function. The suggestion for à/ß might need some consideration as they could no longer be used to pop the largest digit in a number. Doing Ws\ over ß is a bit clunky. Haven't personally used ß a lot though, but I've seen it used by others more.

14 without lazy-eval

Actually it was 18, but still way too long

@KevinCruijssen First attempt at 23 bytes. There has to a better way though

Ah, I think I understand you question about the list. I'll have a look and see if I can do it

@KevinCruijssen I had these as alternatives. Where the last one was the most interesting imo printing backwards, but unfortunately finding out the direction to start with got quite expensive

@KevinCruijssen: Interesting. None of my alternative versions were the same as yours. I really thought we'd have some in common

I've got 4 different solutions as well. Feels like there are many ways to do this, so very fun to golf. I'm sure some of ours align :)

Ah yeah, that makes it clearer. It aligns the characters in one string with characters from another, filling with spaces

Like this. Seems like it could be useful at times

@KevinCruijssen hadn't seem overlap before, but it seems to pad a word with spaces the amount of another word

@KevinCruijssen I assume it's due to vectorization. It might be logical to have a special case for the empty list, but maybe that is not what you'd expect in some cases. Unsure of what the best behavior for that would be.

@KevinCruijssen I vote yes. I don't really see what else it should do.

It was Grimy's idea :) Very clever use of a word I'd never heard of before (ubridal)

Awh, doubt I can beat that

Aye :) I'll see if I can beat it

Yeah, I forgot about the case-insensitive part

I'll add an explanation after I've tried getting it down some more. Not happy with the last part

I'm sure you can improve it more. You can't let 05AB1E win on a challenge like this ;)

@Adám 05AB1E, 4 bytes: ΣÄ}θ

@Anush Yeah

Allowing both nth digit, first n digits and output indefinitely is pretty common among oeis-sequence challenges and no one complains on that

It definitely is harder making questions asking for optimized programs in time/memory

The standard-ish way of "must complete test-cases within x seconds" seem to work decently. Although there is always the question of on what specs

@Anush Inefficient code is short code ;)

I changed it to a a number beginning with 2

@Anush: yes, but for a different number (1 higher than your example)

You should probably change the wording on the sandbox post to show that it is "a possible solution". Sounds like it's the only one right now

512, 1024 also works for last 2 ofc

Yeah, there are a few different solutions

code

So not that hard just to take the first 9 2**x numbers and increase one

Well, it was a 2**x number

@Anush [1, 2, 4, 8, 16, 32, 64, 128, 4096]

yes

I didn't immediately realize that we should include 1 (although it should be obvious since we're maximizing factors)

I would add the actual numbers to the output example, like (1, 17, 59, 127) for the 127381 example, to make it a bit clearer

The player-bit at the start makes it feel a bit like we're making koth bots