Leetcode 2957. Remove Adjacent Almost-Equal Characters

Given a lowercase string, find the minimum number of single-character edits so that no adjacent characters are "almost-equal" (equal or consecutive letters in the alphabet). The core challenge is minimizing edits under local adjacency constraints, i.e., choosing replacements for each position so neighbors are never equal or alphabetically adjacent.