day03.py

from src.common.utils import SolverFunctions

title = 'Day 3: Rucksack Reorganization'
parser_method = 'each_first_item'
handle_data = 'lines'


class SolveTheDay(SolverFunctions):
    @classmethod
    def level_1(cls, data):
        counter = 0
        
        for char in data:
            mid = len(char) // 2
            left = char[:mid]
            right = char[mid:]

            common, = set(left).intersection(right) 

            common = ord(common)
            char_a = ord('a') 
            char_A = ord('A')

            if common > char_a:
                counter += common - char_a + 1
            else:
                counter += common - char_A + 26 + 1

        return counter

    @classmethod
    def level_2(cls, data):
        counter = 0
        
        for char in range(0, len(data), 3):
            step = data[char:char+3]
    
            common, = set(step[0]) & set(step[1]) & set(step[2]) 
    
            common = ord(common)
            char_a = ord('a') 
            char_A = ord('A')
    
            if common > char_a:
                counter += common - char_a + 1
            else:
                counter += common - char_A + 26 + 1

        return counter