Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3563. Lexicographically Smallest String After Adjacent Removals
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source