Available question text
Given pairwise equivalences between characters in s1 and s2, compute character equivalence classes (e.g., with union-find) and replace each letter in baseStr with the smallest lexicographic character in its class to form the lexicographically smallest equivalent string. All strings consist of lowercase letters (lengths up to 1000).
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 1061. Lexicographically Smallest Equivalent String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source