aboutsummaryrefslogtreecommitdiff
path: root/challenge-201/lubos-kolouch/python/ch-1.py
blob: 4f638a471933989e2638f93252099b4c6ae8c7c3 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#!/usr/bin/env python
# -*- coding: utf-8 -*-

from typing import List
import unittest


def find_missing_numbers(arr: List[int]) -> List[int]:
    """
    Find all missing numbers in the range 0..n where n is the array size.
    Args:
        arr: A list of unique integers.
    Returns:
        A list of missing integers in the range 0..n where n is the array size.
    """
    n = len(arr)
    s = set(arr)
    missing_numbers = []
    for i in range(n + 1):
        if i not in s:
            missing_numbers.append(i)
    return missing_numbers


# test cases
class TestMissingNumbers(unittest.TestCase):

    def test_example1(self):
        self.assertEqual(find_missing_numbers([0, 1, 3]), [2])

    def test_example2(self):
        self.assertEqual(find_missing_numbers([0, 1]), [2])


if __name__ == '__main__':
    unittest.main()