Smallest String With Swaps: coding question

Available question text

Given a string and allowed index swap pairs, view pairs as edges in a graph to find connected components where characters can be freely permuted; for each component, sort its characters and place them in the component's indices to produce the lexicographically smallest string. This requires near-linear component-finding (union-find or DFS) and sorting per component to handle up to 1e5 elements.

Continue with questions that share topics or the same question type.

Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Number of Distinct Islands
Coding · Array · Breadth-First Search · Depth-First Search
Smallest Common Region
Coding · Array · Binary Lifting · Breadth-First Search
Evaluate Division
Coding · Array · Bellman–Ford Algorithm · Breadth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Google
Leetcode 1202. Smallest String With Swaps
Reported Oct 1, 2024 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Goldman Sachs
Smallest String With Swaps
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 77.9. This is not an interview probability.
View source
Goldman Sachs
Smallest String With Swaps
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 56.8. This is not an interview probability.
View source

Available question text

Smallest String With Swaps

Available question text

Related questions

Smallest String With Swaps

Available question text

Related questions