Great, I'm glad it makes sense. Good luck!

That is not right, as your path starts at the montain of height 1 and ends at the mountain of height 6, so energy it took is at least 6 - 1 = 5. Energy constain in my example is E = 3.

Hi! There is a solution with O(n) time complexity. Good luck!

You are given a mountain range (an array of mountain heights) and your task is to find the longest mountain pass (the longest subarray given the energy constrain).

For example, for a given energy constrain E = 3 and a given mountain range = [2, 5, 1, 2, 3, 4, 6, 6] the longest mountain pass you can take is [5, 1, 2, 3, 4], which has length 5. You would return the tuple (5, 1).

That would be great. looking forward to it.

I don't know what you mean either. Renamed to `Test Cases' to avoid confusion.

I understand. I tried to implement as many languages as possible, but perhaps I should have gone slower and used translations instead :)

Done.

I understand now. Done.

Fixed.

Thanks! Fixed all.