I'll look into it. There are 39 testcases in the validation process, 30 of which are randomly generated. There are only 5 example testcases, but they cover the full-range of the functionality required of the program. If I can think of other possible testcases covering alternate flows not covered, I'll be sure to update the test suite.

I missed that. I took it off. Thanks!

True. I changed the description.

The built-in function max does exactly what is required: return 1 as a minimum. However the wording 'max', I thought could be clarified a little bit more: what is required
for specifying the stack would be a bound, that is between 1-->floor(1/10 * n) and 1-->floor(1/2 * length(list_one)). 'With two or more arguments, return the largest argument' is how max is specified in Python's help doc. However, the word 'maximum(floor(1/10n),1)' could be interpreted as a ceiling of 1 or floor(1/10n); so values like 0.9 or 0.8 are permissible. I am talking about the general specification of the problem for someone who is not familiar with the function max(). So I decided to word it as greater(floor(1/10*n),1) to explicitly specify that 1 is a lower-bound.

I'm a little bit confused:

[Example: pickPeaks([3, 2, 3, 6, 4, 1, 2, 3, 2, 1, 2, 3]) should return {pos: [3, 7], peaks: [6, 3]} (or equivalent in other languages)]

How is 7 a peak?

https://www.wolframalpha.com/input?i=plot+%5B3%2C+2%2C+3%2C+6%2C+4%2C+1%2C+2%2C+3%2C+2%2C+1%2C+2%2C+3%5D

<~~~It's about the WingSpan~~~>

So Loaded... Didn't know It's that.

The Chosen One always gets the Pan, Number 26

It started in the 90s with MSN Messenger, huh?

I love this problem. It's not about mincing words but 'pythonesqueezing' them. I went for the maximum vibe.