about summary refs log tree commit diff
path: root/universe/data_structures_and_algorithms/which-appears-twice.py
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-01-29T14·29+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-01-29T14·29+0000
commitfb9380ba268b3cd27372acadb87b14cc96163374 (patch)
treef65d7fc8d8726499165a0949af39afd1abc8118c /universe/data_structures_and_algorithms/which-appears-twice.py
parent15110e6de9f85537c7847267caa35fa068aea001 (diff)
parent8ad51b24dd8719840aac47134835ea25cfe1b0b8 (diff)
Add 'universe/' from commit '8ad51b24dd8719840aac47134835ea25cfe1b0b8'
git-subtree-dir: universe
git-subtree-mainline: 15110e6de9f85537c7847267caa35fa068aea001
git-subtree-split: 8ad51b24dd8719840aac47134835ea25cfe1b0b8
Diffstat (limited to 'universe/data_structures_and_algorithms/which-appears-twice.py')
-rw-r--r--universe/data_structures_and_algorithms/which-appears-twice.py33
1 files changed, 33 insertions, 0 deletions
diff --git a/universe/data_structures_and_algorithms/which-appears-twice.py b/universe/data_structures_and_algorithms/which-appears-twice.py
new file mode 100644
index 000000000000..e9a4f0eb24d0
--- /dev/null
+++ b/universe/data_structures_and_algorithms/which-appears-twice.py
@@ -0,0 +1,33 @@
+import unittest
+
+
+################################################################################
+# Solution
+################################################################################
+# find_repeat :: [Int] -> Int
+def find_repeat(xs):
+    n = len(xs) - 1
+    return sum(xs) - ((n**2 + n) / 2)
+
+
+################################################################################
+# Tests
+################################################################################
+class Test(unittest.TestCase):
+    def test_short_list(self):
+        actual = find_repeat([1, 2, 1])
+        expected = 1
+        self.assertEqual(actual, expected)
+
+    def test_medium_list(self):
+        actual = find_repeat([4, 1, 3, 4, 2])
+        expected = 4
+        self.assertEqual(actual, expected)
+
+    def test_long_list(self):
+        actual = find_repeat([1, 5, 9, 7, 2, 6, 3, 8, 2, 4])
+        expected = 2
+        self.assertEqual(actual, expected)
+
+
+unittest.main(verbosity=2)