Use a static array to only pay the o(n) cost once for initalizing the array of size n. Nice! O(1) constant time depending on size of n; as array n grows O(1) -> O(n).

I know this doesnt matter, but im trying to apply the discrete math skills. Thanks!

blud responding to a 5 year old comm 😭😭😭🙏🙏🙏🙏🙏

Well, it's part of the spirit: you create hand-crafted solutions to learn from people who just know how to avoid reinventing the wheel. After all, the more you practice, the better you become.

We don't need dsa for this.
.map is just a transformation function.

Nice!

Using Math.min with .map is an extra loop instead of just using .reduce

Very nice solution. Loved it. I think we need to know DSA for this right?

Thanks @o2001!

Thanks for your clarification!

Curious why you spread the input since it's a string and you could just split it right?
Or, like me, you wherent sure the input is a string or array (question wasn't too clear on that)?

Try to run this test -> yield return new TestCaseData("man i need a taxi tbwi up to ubud").Returns("taxi");

it's good