Yes, but kata solutions don't necessarily have to be efficient (unless the kata tests explicitly require them to be such).

this doesnt account for there being no 'needle' though

nice

Assumes all numbers are in range, returns error for if not.

this must be the guy who made chatgpt

https://www.geeksforgeeks.org/python-list-comprehensions-vs-generator-expressions/

??

Here I thought I was being clever... and completely overlooked the simpler solution.

As little-voted as it is right now for best practice, I ran some benchmarks on BenchmarkDotNet out of curiosity and multiplying a number with itself is magnitudes faster than using Pow(n, 2). This is the one

BenchmarkDotNet=v0.13.2, OS=Windows 11 (10.0.22621.819)
AMD Ryzen 5 Microsoft Surface Edition, 1 CPU, 12 logical and 6 physical cores
.NET SDK=7.0.100
  [Host]     : .NET 6.0.11 (6.0.1122.52304), X64 RyuJIT AVX2
  DefaultJob : .NET 6.0.11 (6.0.1122.52304), X64 RyuJIT AVX2

This produces the character for every single element of inp. Kind of slow?

this is a good one

Think of it as any method that returns either a 1 or a 0. The implementation of it in this case is arbitrary since it is implemented by the caller and not within the method that is being tested.

nice :)))

Wouldn't a set be technically faster to check membership than a string, because it's implimented using a hash table (in Python)? e.g. {'a', 'e', 'i', 'o', 'u'}