Add exercises from Codility

Author: akafael

src/binary_period.py

@@ -0,0 +1,16 @@
+def calc_binary_period(n):
+    binary_digits = [0] * 30
+    l = 0
+    while (n > 0):
+        binary_digits[l] = n % 2
+        n //= 2
+        l += 1
+    for p in range(1, 1 + l):
+        ok = True
+        for i in range(l//2):
+            if binary_digits[l-i] != binary_digits[l - i - p]:
+                ok = False
+                break
+        if ok:
+            return p
+    return -1

src/ex_phonebill.py

@@ -0,0 +1,63 @@
+'''
+Challenge from past interview
+'''
+import re
+
+def calc_bill_value(S):
+    '''
+    Calculate the Bill value for a fictions phone call register list
+    Length call, phone Number in the format "HH:MM:SS,000-000-000\n"
+    Conditions
+        1. time less then 5 min : cost 3 cents/s
+        2. time greater then 5 min : cost 150 cents/min
+        3. all the calls from the number longest call time overall are free
+    :param S:
+    :return:
+    '''
+
+    value = 0
+
+    # Convert Data to (hour,minute,second,phonenumber)
+    regexpdata = r'([0-9][0-9]):([0-9][0-9]):([0-9][0-9]),([0-9][0-9][0-9]-[0-9][0-9][0-9]-[0-9][0-9][0-9])'
+    data = re.findall(regexpdata, S)
+
+    ddata = {}
+    # Store Phone with longest call time
+    phonemaxcalls = ""
+    timemaxcalls = 0
+    # Get Duration
+    for item in data:
+        # Convert Time to s
+        timeSeconds = int(item[0]) * 3600 + int(item[1]) * 60 + int(item[2])
+
+        # Add Time to phonenumber register
+        if item[3] not in ddata:
+            ddata[item[3]] = timeSeconds
+        else:
+            ddata[item[3]] += timeSeconds
+
+        # Get Longest Call time
+        if ddata[item[3]] > timemaxcalls:
+            phonemaxcalls = item[3]
+            timemaxcalls = ddata[item[3]]
+        # elif ddata[item[3]] == timemaxcalls:
+        #     # Check smallest Number in case of tier if the right number is needed to show up in the bill
+        #     if item[3] < phonemaxcalls:
+        #         phonemaxcalls = item[3]
+        #         timemaxcalls = ddata[item[3]]
+
+    # Remove Longest Call time (dont check smallest tier number since the value it dont change de value)
+    del (ddata[phonemaxcalls])
+
+    # Generate Bill
+    for phonenumber, time in ddata.items():
+        pricecall = 0
+        if time < 300:
+            pricecall = time * 3
+        else:
+            pricecall = (time // 60 + 1) * 150
+
+        value += pricecall
+
+    # Return
+    return value

src/local_maxmin.py

@@ -0,0 +1,38 @@
+"""
+Find local max and min
+ @author Akafael
+"""
+
+def count_local_minmax(A):
+    """
+    Count local max and min
+     @author Akafael
+    """
+
+    n = len(A)
+
+    # Trivial Solution
+    if n <= 1:
+        return 1
+
+    # Calculate the diff
+    B = []
+    count = 0
+    isRising = False
+    isFalling = False
+    for i in range(1, n - 1):
+        B.append(A[i + 1] - A[i])
+
+        # Count Pikes
+        if B[i] > 0:
+            isRising = True
+            if isFalling == True:
+                count += 1
+                isFalling == False
+        elif B[i] < 0:
+            isFalling = True
+            if isRising == True:
+                count += 1
+                isRising == False
+
+    return count

src/pythonic_data_structures.py

@@ -0,0 +1,7 @@
+# List Comprehensions
+
+# Generate a list with square numbers from 0 to 10
+squares = [x ** 2 for x in range(10)]
+
+# List with element that are not equal to 4
+not4s = [x for x in squares if x != 4]

src/template.py

@@ -0,0 +1,20 @@
+import unittest
+
+
+def solution(A):
+    """
+    Solution
+    :type A: object
+    """
+    return A
+
+
+class TestSolution(unittest.TestCase):
+
+    def test_example1(self):
+        self.assertEqual(5, solution(5))
+
+
+if __name__ == '__main__':
+    unittest.main()
+    solution(1)