Watch 10 video solutions for Check If All 1's Are at Least Length K Places Away, a easy level problem involving Array. This walkthrough by Code with Alisha has 771 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given an binary array nums and an integer k, return true if all 1's are at least k places away from each other, otherwise return false.
Example 1:
Input: nums = [1,0,0,0,1,0,0,1], k = 2 Output: true Explanation: Each of the 1s are at least 2 places away from each other.
Example 2:
Input: nums = [1,0,0,1,0,1], k = 2 Output: false Explanation: The second 1 and third 1 are only one apart from each other.
Constraints:
1 <= nums.length <= 1050 <= k <= nums.lengthnums[i] is 0 or 1