Available question text
Given a string of digits, you may perform at most one swap of adjacent digits that share the same parity (both even or both odd); return the lexicographically smallest string obtainable by choosing the best such adjacent-parity swap (or none).
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 3216. Lexicographically Smallest String After a Swap
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source