Leetcode 1437. Check If All 1's Are at Least Length K Places Away #leetcode

O(n) solution: Track last 1, compute gap = i - last - 1, return False if gap less than k.

Dry run + visuals show it returns True for nums = [1,0,0,0,1,0,0,1], k=2.

#coding #interviewpreparation #programming

Видео Leetcode 1437. Check If All 1's Are at Least Length K Places Away #leetcode канала Tanisha Amin