{"id":"lhs-one-directional-check","text":"`findLHS` only checks `k + 1` in the counter (never `k - 1`), ensuring each valid adjacent pair is counted exactly once without double-counting","truth_value":"IN","source":"entries/2026/06/06/longest-harmonious-subsequence-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"lhs-one-directional-check","truth_value":"IN","reason":"premise"}]}}