about summary refs log tree commit diff
path: root/data_structures_and_algorithms/find-duplicate-optimize-for-space-beast.py
blob: 93fdd9eed2d6afc70f7391af218963cb72ca6e62 (plain) (blame)
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
import unittest


################################################################################
# Solution
################################################################################
def find_duplicate(xs):
    self_ref_count = 0
    for i in range(len(xs)):
        if xs[i] == i + 1:
            self_ref_count += 1
    hops = len(xs) - 1 - self_ref_count
    current = xs[-1]
    while hops > 0:
        current = xs[current - 1]
        hops -= 1
    return current


################################################################################
# Tests
################################################################################
class Test(unittest.TestCase):
    # TODO: Debug why this fails.
    def test_darren_from_interview_cake(self):
        actual = find_duplicate([4, 1, 8, 3, 2, 7, 6, 5, 4])
        expected = 4
        self.assertEqual(actual, expected)

    def test_just_the_repeated_number(self):
        actual = find_duplicate([1, 1])
        expected = 1
        self.assertEqual(actual, expected)

    def test_short_list(self):
        actual = find_duplicate([1, 2, 3, 2])
        expected = 2
        self.assertEqual(actual, expected)

    def test_last_cycle(self):
        actual = find_duplicate([3, 4, 2, 3, 1, 5])
        expected = 3
        self.assertEqual(actual, expected)

    def test_medium_list(self):
        actual = find_duplicate([1, 2, 5, 5, 5, 5])
        expected = 5
        self.assertEqual(actual, expected)

    def test_long_list(self):
        actual = find_duplicate([4, 1, 4, 8, 3, 2, 7, 6, 5])
        expected = 4
        self.assertEqual(actual, expected)


unittest.main(verbosity=2)