D. J.:

- Added the leetcode problem and solution for 1018

Author: nobodyPerfecZ

README.md

@@ -278,6 +278,7 @@
 - [933 Number of Recent Cells](https://leetcode.com/problems/number-of-recent-calls/description/)
 - [983 Minimum Cost for Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/description/)
 - [1009 Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/description/)
+- [1018 Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/description/)
 - [1027 Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/description/)
 - [1035 Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/description/)
 - [1137 N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/)

awesome_python_leetcode/_1018_binary_prefix_divisible_by_5.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
+        """
+        You are given a binary array nums (0-indexed).
+
+        We define xi as the number whose binary representation is the subarray
+        nums[0..i] (from most-significant-bit to least-significant-bit).
+
+        - For example, if nums = [1,0,1], then x0 = 1, x1 = 2, and x2 = 5.
+
+        Return an array of booleans answer where answer[i] is true if xi is divisible
+        by 5.
+        """
+        # Time Complexity: O(n)
+        # Space Complexity: O(1)
+        res = []
+        remain = 0
+        for bit in nums:
+            remain = ((remain << 1) | bit) % 5
+            res.append(remain == 0)
+        return res

tests/test_1018_binary_prefix_divisible_by_5.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._1018_binary_prefix_divisible_by_5 import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([0, 1, 1], [True, False, False]),
+        ([1, 1, 1], [False, False, False]),
+    ],
+)
+def test_func(nums: List[int], expected: List[bool]):
+    """Tests the solution of a LeetCode problem."""
+    prefixes = Solution().prefixesDivBy5(nums)
+    assert prefixes == expected