I have this challenge :
Your task is to find the longest contiguous subslice of a slice of integers for which each member is 1 higher than its predecessor. For example, given the slice [1, 2, 4, 4, 5, 6, 7, 3, 2, 7, 8, 9, 1], the longest subslice where each member is 1 higher than its predecessor is [4, 5, 6, 7], from indices 3 through 6 inclusive. We provide a function stub: pub fn longest_incrementing_subslice(s: &[u8]) -> &[u8] Note the signature: you should return a subsection of the input slice, not a newly-allocated vector. It is safe to assume that every input contains exactly one longest subslice.
anyone who can help me figure out how I can do that. Please no code only a sort of plan