O(n)
Intuition\n Describe your first thoughts on how to solve this problem. \nTake each number from the array nums and  convert into decimal and check its divisiabli
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nTake each number from the array nums and  convert into decimal and check its divisiablity with 5\n \n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\n- O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:\n        str_arr = []\n        res = []\n        for i in range(0,len(nums)):\n            str_arr.append(str(nums[i]))\n            num = int(\'\'.join(str_arr), 2)\n            if num % 5 == 0:\n                res.append(True)\n            else:\n                res.append(False)\n        return res\n        \n\n        \n```
['Python3']