Python Solution - Bit shift with mod check
Each time you look you add a bit, you are multiplying the previous sum by 2 and adding the value of the current bit. This can be achieved by a simple left bit s
Each time you look you add a bit, you are multiplying the previous sum by 2 and adding the value of the current bit. This can be achieved by a simple left bit shift by 1. \n\nIt is then just a matter of checking if the total is  divisible by 5 or not. \n\n```\nclass Solution:\n    \n    def prefixesDivBy5(self, A: List[int]) -> List[bool]:\n        \n        answer = [False] * len(A)\n        total = 0\n        \n        for i in range(len(A)):\n        \n            total += A[i] \n            \n            if total % 5 == 0:\n                answer[i] = True\n            \n\t\t\t// Left shift by 1 ==> total * (2**1) \n            total = total << 1\n                \n        return answer\n```
[]