aboutsummaryrefslogtreecommitdiff
path: root/challenge-283/pokgopun/python/ch-1.py
blob: 4f40b561ec6f35120b36c9dc8fd202ace13418b8 (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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
### https://theweeklychallenge.org/blog/perl-weekly-challenge-283/
"""

Task 1: Unique Number

Submitted by: [45]Mohammad Sajid Anwar
     __________________________________________________________________

   You are given an array of integers, @ints, where every elements appears
   more than once except one element.

   Write a script to find the one element that appears exactly one time.

Example 1

Input: @ints = (3, 3, 1)
Output: 1

Example 2

Input: @ints = (3, 2, 4, 2, 4)
Output: 3

Example 3

Input: @ints = (1)
Output: 1

Example 4

Input: @ints = (4, 3, 1, 1, 1, 4)
Output: 3

Task 2: Digit Count Value
"""
### solution by pokgopun@gmail.com

def uniqNum(ints):
    return sorted(
            (ints.count(e),e) for e in ints
            )[0][1]

import unittest

class TestUniqNum(unittest.TestCase):
    def test(self):
        for inpt,otpt in {
                (3, 3, 1): 1,
                (3, 2, 4, 2, 4): 3,
                (1,): 1,
                (4, 3, 1, 1, 1, 4): 3,
                }.items():
            self.assertEqual(uniqNum(inpt),otpt)

unittest.main()