Task: Find Three Evenly Spaced Ones in Binary String

Task: Find Three Evenly Spaced Ones in Binary String: a task in Terminal-Lego-15k (Harbor dataset). Given an arbitrary binary string of length n, your task is to implement an algorithm that finds three evenly spaced ones within the string, if they exist.