Practice Binary Prefix Divisible By 5
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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). Return an array of booleans answer where answer[i] is true if xi is divisible by 5.
Source: Binary Prefix Divisible By 5 on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [0,1,1]
Output
[true,false,false]
# Example 2
Input
nums = [1,1,1]
Output
[false,false,false]
Constraints
1 <= nums.length <= 10^5
nums[i] is either 0 or 1.
Related LeetCode Problems
Practice more problems similar to Binary Prefix Divisible By 5.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.