Skip to content

Latest commit

 

History

History
55 lines (31 loc) · 916 Bytes

Find_the_middle_element.md

File metadata and controls

55 lines (31 loc) · 916 Bytes

CodeWars Python Solutions


Find the middle element

Task

As a part of this Kata, you need to create a function that when provided with a triplet, returns the index of the numerical element that lies between the other two elements.

The input to the function will be an array of three distinct numbers (Haskell: a tuple).

For example:

gimme([2, 3, 1]) => 0

2 is the number that fits between 1 and 3 and the index of 2 in the input array is 0.

Another example (just to make sure it is clear):

gimme([5, 10, 14]) => 1

10 is the number that fits between 5 and 14 and the index of 10 in the input array is 1.



Given Code

def gimme(input_array):
    pass

Solution

def gimme(input_array):
    return input_array.index(sorted(input_array)[1])

See on CodeWars.com