Missing Number

Missing Number

Simple

You are given a sequence of integers, which are elements of arithmetic progression - the difference between the consecutive elements is constant. But this sequence is unsorted and one element is missing...good luck!

example

Input: List of integers (int).

Output: An integer (int).

Examples: 

assert missing_number([1, 4, 2, 5]) == 3
assert missing_number([2, 6, 8]) == 4

Preconditions:

  • length of sequence > 2;
  • missing element is always between two elements in sequence.

    • 40
    freeman_lex
    Solve as a guest
    Sign in to your account