interesting

sweet

sweet

I like the short circut technique

I like it!

this is too much.

This solves it in 1 pass with the least amount of operations.

avoid the default param in this public call as it could result in the function being called with an unintended accumulator value

No built-in functions.
No converting to indexed list up front.
Recursion ends as soon as first match is found.

Interesting approach with a comprehension. But it finds every match when it only needs to find the first match.

nice work!

Sweet

I totally looked this up. It still hurts my brain to visualize how this works.