{"id":"balanced-substring-single-pass-counter","text":"`longestBalancedSubstring` uses a single-pass O(n) time, O(1) space counter technique — tracking running counts of consecutive zeros and ones — rather than checking all substrings or using groupby.","truth_value":"IN","source":"entries/2026/06/06/find-the-longest-balanced-substring-of-a-binary-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"balanced-substring-single-pass-counter","truth_value":"IN","reason":"premise"}]}}