:) glad you liked it!

to @author
Thanks for this Kata. It is good to train/check the understanding the features of the language.
Me personnaly, I have bunch of various more difficult (from algorithmistic pov) katas solved in my portfolio, but with this kata I've struggled for a long time and finaly it's done))
And as I expected the soultion - of course - is very simple

Too smarty for this kata I think... Not clear how does it work. The code mustn't be magic :)

Possibility 1: dig through the Internet and search for some hints or algorithms aimed specifically at this kind of problems.
Possibility 2: come to #help-solve channel of Codewars Discord for some help.

Size of huge tests for Rust has been slightly reduced. I will mark the issue as resolved, and I would kindly ask you if your solution passes consistently now.

My Solution works too :-)

Would someone please help assess the efficiency of this algorithm (memory, performance)?

Your "else" part manages the case!...

In my solution I handle when h less than radius and h more than radius, but I don't handle when h=radius and still pass all the tests..
I mean I think the kata author might wanr to add testcases, maybe

Awesome.
I thought \w is for word, but it is for word character...

Kadane's algorithm

I also think parallel not needed here