Very cool kata, and is also a bit different from what we are used with

Right, was a problem with my inputs. The reset buton helped, thank you

Python has an error test:

test: "373049910872815764" -> My script's output: '730439108928157' should equal '330479108928157'

That's totally wrong based on the code description

There is an issue at least in this test: ' remove_smallest(4, [-87, -47, 41, 84, -21, 29, -89, 13, -32, 52, 43, 92, -30, -7, 63, -80, -70, 59, 99, 25, -70, -62, 81, 97]) '

my script does remove: ' -89 , -87, -80, -70 ' without changing the order of the list, but still getting an error! , as the final list is : ' [-47, 41, 84, -21, 29, 13, -32, 52, 43, 92, -30, -7, 63, 59, 99, 25, -70, -62, 81, 97] '

Very clever solution. Good job guyssss

Tried 3 different algorithms, each one build differit, but same timeout error... Pretty hard this kata, but a good one

You can't find the sum(n)-(a+b) == (a*b), (as the problem is saying) if you are not including the n, this should be the first thing you would look into when you start solving this kata. Idk why would you ask this.

I don't find how could i pass this test: ' division, [6, -29, 19, -10, 16, -17] and [-19, 15, -17, 10, 19, 25] ' with division, is there a division - word operator in Python?

Mega weird kata. He focused to write the story about wild west, but forgot to focus on explaination. L

was a very good kata, would be helpful more kata like this where you need to find a better way for increasing the time speed of your algorithm.