**Consecutive Sequences and Permutations Challenge Solved with O(n) Complexity**
The Weekly Challenge, a Perl and Raku programming challenge, has been tackled by Matthias Muth with solutions for Task 1 (Consecutive Sequences) and Task 2 (Next Permutation). Muth's approach solves both tasks in linear time complexity (O(n)), leveraging efficient algorithms to manipulate sequences and permutations.
Source: https://dev.to/muthm/consecutive-sequences-of-permutations-anyone-pwc-294-2dbf