Rust:

From the description:

Where every k_i > 1 and every k_i is maximized ...

The elements in the returned vector ($k_i$) must be strictly greater than 1.

However, your vector does contain 1 at the end.

Not a kata issue.

blue_pulled and red_pulled are always lower than the blue_start and red_start (as per problem definition).

the concept is called a vacuous truth. the tests are correct

>> 1.0 / 0.0
inf
>> 0.0 / 0.0
NaN

according to evcxr, which is a rust REPL

lol i have the same problem like u bro
like i don't even know why best_friend("jtekeh dek wbwclw gykc", "i", "h") should return True, even the string have no "i"

Thank you for the fix. Cheers!

Fixed (the input type was not correct in initial code).

nah, i wish ChatGPT could optimize like that

just asked it to solve this and it produced the same solution as the most upvoted one

With the first digit being 1 you have also ten numbers: 10, 11, 12, 13, 14, 15, 16, 17, 18, 19. And so on. Find me a number between 1 and 100 not being increasing, decreasing or both.

To give you a starting point, there are a grand total of increasing and decreasing numbers as shown in the table:

It doesn't say all numbers under 100 are increasing.

for rust, the tests should look like this

        assert_eq!(barista(vec![]), 0);
        assert_eq!(barista(vec![2, 10, 5, 3, 9]), 85);
        assert_eq!(barista(vec![4, 3, 2]), 22);
        assert_eq!(barista(vec![20, 5]), 32);
        assert_eq!(barista(vec![20, 5, 4, 3, 1, 5, 7, 8]), 211);
        assert_eq!(barista(vec![5, 4, 3, 2, 1]), 55);

My thoughts exactly. While I ~loved it, imho it shouldn't be upvoted for 'Best Practice'

Hmm, thanks for reporting it. I am not familiar with Rust, maybe somebody else can help.

It's a puzzle, I'd say it's pretty much anything goes. But you don't necessarily need to override anything, at least not in Python, my language of choice.

Well explained! Thanks for sharing your knowledge.