Might help those who get stuck:
Isn't a particularly difficult Kata, but just don't modify the original map or unexpected error may occur since the same map is reused between tests.
Just create a copy of the original map and modify it as you want will work.

Tried several different approaches, literally dynamic planned everything possible, and replacing all 2 ** to 1 << to get it passed in time.

Passed with Python 2.7.6.

Just ignore the sample tests and assume that you are right; Go for the attempt.

@wenima: The description of the task is to return "a matching list in the reverse order.", not to reverse the list in-place.

look at this error plz
Test Results:
Testing empty list
Test Passed
Testing single element list
1 should equal 1 ????????????

you said pickpeaks should not ignore peaks.
Did you change your mind? Cause when I'm trying to submit I get:
" should support finding peaks, despite the plateau
✘ {'pos': [2, 3], 'peaks': [3, 2]} should equal {'pos': [2], 'peaks': [3]} "

is this a bug? The instructions don't mention this and it would at least need another parameter to determine whether ignore peaks is on or off for that special case. Definitely not solvable without a proper set of instructions for this case.

Just a reminder:
The return type is a dict rather than a struct for Python, if you are new to Python and it confused you...

Currently Codewars platform is experiencing issues.

https://github.com/Codewars/codewars.com/issues/893

Currently Codewars platform is experiencing issues.

https://github.com/Codewars/codewars.com/issues/893