1.6 on my Laptop. I could speed this one up to 1.2 by counting every element you set to n+1. Then:
k := len(lucky) - counter
No need for the second inner loop (counting up k), then.
Nice. My best Go attempt on an array was 6.5s. I have to think about, why this is faster.
We’re a place where coders share, stay up-to-date and grow their careers.
We strive for transparency and don't collect excess data.