Leetcode 3563. Lexicographically Smallest String After Adjacent Removals

Given a lowercase string, you may repeatedly delete any adjacent pair of letters that are consecutive in the cyclic alphabet (including 'a'↔'z'), with the string compacting after each deletion. Find the lexicographically smallest string obtainable by choosing deletions optimally — a combinatorial/DP-style optimization since removal order affects future adjacencies.