low amount of lines but time complexity higher than mine :P

The drunk friend from this instructions is definitely a bit crazy guy 😂 it's unbelievable to make such substitution immediately in the head

Enabled in this fork

Kata retired.

the sorting approach is too much extra work.

good

Nice

Ok sooo for task with Large array what is the type of Sort you advises ?

The sorting approach is generally less efficient for this specific task, especially when dealing with large arrays, due to the higher time complexity of the sorting algorithm. The looping approach focuses on finding only the two smallest numbers, resulting in better performance for this particular requirement.

how dose the code runs? your code gives me sort is not a function 😕

what is the point in storing the result of running sort method on the array if it's an 'in-place' algorithm?

Approved

python new test framework is required. updated in this fork

He did not do the same thing. The .sort() method has a time complexity of O(n log(n)). This algo can be solved with one simple for loop as seblm described with a time complexity of O(n), which will be far more performant as your array grows in size.