there are no tests for Haskell, annoying

Finding thepeaks is not difficult, but your wanted solution with a Map and List is confusing, why not use a Map and put a position and a peakheight together?

Thanks, found my mistake. i need to make it better because its too slow

1. your code is not efficient enough
2. very carefully (re)read the entire description

it keeps saying timed out. -_- i am new can someone help me

sorry, i am quite new and now that i saw the solutions i get it.
I would still leave the comment up, if others run in the same issue.

thanks

Read the description:

NOTE on performance: There are no fancy optimizations required, but still the most trivial solutions might time out. Numbers go up to 2^31 ( or similar, depending on language ). Looping all the way up to n, or n/2, will be too slow.

And that's what your code does, so, no wonder it will fail.

The kata works fine in Java (your language). Your code timing out is not a kata issue. You need to write a more efficient algorithm.