Add solution #1018

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,092 LeetCode solutions in JavaScript
+# 1,093 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -826,6 +826,7 @@
 1015|[Smallest Integer Divisible by K](./solutions/1015-smallest-integer-divisible-by-k.js)|Medium|
 1016|[Binary String With Substrings Representing 1 To N](./solutions/1016-binary-string-with-substrings-representing-1-to-n.js)|Medium|
 1017|[Convert to Base -2](./solutions/1017-convert-to-base-2.js)|Medium|
+1018|[Binary Prefix Divisible By 5](./solutions/1018-binary-prefix-divisible-by-5.js)|Easy|
 1022|[Sum of Root To Leaf Binary Numbers](./solutions/1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1023|[Camelcase Matching](./solutions/1023-camelcase-matching.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|

solutions/1018-binary-prefix-divisible-by-5.js

@@ -0,0 +1,29 @@
+/**
+ * 1018. Binary Prefix Divisible By 5
+ * https://leetcode.com/problems/binary-prefix-divisible-by-5/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean[]}
+ */
+var prefixesDivBy5 = function(nums) {
+  const result = new Array(nums.length);
+
+  for (let i = 0, current = 0; i < nums.length; i++) {
+    current = (current * 2 + nums[i]) % 5;
+    result[i] = current === 0;
+  }
+
+  return result;
+};