chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2025-11-24-1018-Binary-Prefix-Divisible-By-5/explanation.md

@@ -0,0 +1,28 @@
+# Binary Prefix Divisible By 5 (Easy)
+
+**Problem ID:** 1018  
+**Date:** 2025-11-24  
+**Link:** https://leetcode.com/problems/binary-prefix-divisible-by-5/
+
+## Approach
+
+To solve the problem of determining whether the binary prefixes of a given binary array are divisible by 5, we can adopt an efficient approach that avoids constructing large integers directly from binary representations.
+
+### Approach:
+
+1. **Understanding Binary Representation**: Each prefix can be interpreted as a binary number. For instance, the binary number represented by the array `nums[0..i]` can be computed incrementally. Instead of converting the entire prefix to a decimal number at each step, we can maintain a running total.
+
+2. **Incremental Calculation**: As we iterate through the array, we can maintain a variable `current` that represents the decimal value of the binary number formed by the prefix `nums[0..i]`. We update this variable using the formula:
+   \[
+   \text{current} = (\text{current} \times 2 + \text{nums}[i]) \mod 5
+   \]
+   This allows us to keep track of the value modulo 5, which is sufficient for our divisibility check.
+
+3. **Divisibility Check**: For each prefix, after updating `current`, we check if `current` is equal to 0. If it is, it means the binary number represented by the prefix is divisible by 5, and we append `true` to our result array; otherwise, we append `false`.
+
+4. **Data Structures**: We will use a simple list to store the boolean results for each prefix.
+
+5. **Complexity**: The time complexity of this approach is O(n), where n is the length of the input array `nums`, since we make a single pass through the array. The space complexity is O(n) for the output array.
+
+### Summary:
+By leveraging the properties of binary numbers and modular arithmetic, we can efficiently determine the divisibility of binary prefixes by 5 without constructing large integers. This results in a straightforward and optimal solution to the problem.

Easy/2025-11-24-1018-Binary-Prefix-Divisible-By-5/solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public List<Boolean> prefixesDivBy5(int[] nums) {
+        List<Boolean> result = new ArrayList<>();
+        int current = 0;
+        
+        for (int num : nums) {
+            current = ((current << 1) + num) % 5;
+            result.add(current == 0);
+        }
+        
+        return result;
+    }
+}

Easy/2025-11-24-1018-Binary-Prefix-Divisible-By-5/solution.js

@@ -0,0 +1,11 @@
+var prefixesDivBy5 = function(nums) {
+    let result = [];
+    let current = 0;
+
+    for (let num of nums) {
+        current = ((current << 1) + num) % 5;
+        result.push(current === 0);
+    }
+
+    return result;
+};

Easy/2025-11-24-1018-Binary-Prefix-Divisible-By-5/solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
+        result = []
+        current = 0
+        
+        for num in nums:
+            current = (current << 1) | num
+            result.append(current % 5 == 0)
+        
+        return result

README.md

@@ -288,3 +288,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2025-11-21 — [Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) (Medium) → `Medium/2025-11-21-1930-Unique-Length-3-Palindromic-Subsequences`
 - 2025-11-22 — [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/) (Easy) → `Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three`
 - 2025-11-23 — [Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/) (Medium) → `Medium/2025-11-23-1262-Greatest-Sum-Divisible-by-Three`
+- 2025-11-24 — [Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) (Easy) → `Easy/2025-11-24-1018-Binary-Prefix-Divisible-By-5`