What actually happens when you don't provide a default label?

Very nice brevity and presentation

That's ok

Ah ok I see. IterTools.step is depricated, so one should use std.step.by() instead, and then no imports are needed.

I just retested, removing extern crate itertools is possible, but if I remove use itertools::Itertools; I get the error:

error[E0599]: no method named `step` found for struct `std::slice::Iter` in the current scope
 --> src/lib.rs:4:22
  |
4 |         array.iter().step(2).sum(),
  |                      ^^^^ method not found in `std::slice::Iter<'_, u32>`

error[E0599]: no method named `step` found for struct `Skip` in the current scope
 --> src/lib.rs:5:30
  |
5 |         array.iter().skip(1).step(2).sum()
  |                              ^^^^ method not found in `Skip<std::slice::Iter<'_, u32>>`

error: aborting due to 2 previous errors

For more information about this error, try `rustc --explain E0599`.
error: could not compile `challenge`


NOTE: Line numbers in error messages can be incorrect due to concatenation.

I would guess that when the solution was made extern crate itertools; was nessesary. Rust 2018 removed the need for extern crate in a lot of cases.
Thanks for the comment!

You have the ability to refactor before, and to fork after submitting :)

Doesn't need itertools. I'm guessing you just forgot to remove it. It's too bad CodeWars doesn't let us edit our solutions

A perfect and classy solution.

I love how declarative this solution is.

This code will not return 0 on empty array

Not sure if I am blind. But does this code return first index that satisfies (left == right) or does it return the lowest index that satisfies that condition.

Very good o(n) solution!

Please check this code for input {any two random values} and length (2).
I think it won't work fine as such test case is not in the provided test cases so your code passed test.