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.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
1.6 on my Laptop. I could speed this one up to 1.2 by counting every element you set to n+1. Then:
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.