Leetcode Problem 1061. Lexicographically Smallest Equivalent String

1061. Lexicographically Smallest Equivalent String

Leetcode Solutions

Initialize an adjacency matrix adjMatrix of size 26x26 to represent the graph.
Iterate over s1 and s2 and add edges between equivalent characters in the adjacency matrix.
Initialize a visited array to keep track of visited nodes during DFS.
For each character, if it's not visited, perform DFS to find all characters in its connected component and the smallest character within it.
Create a mapping from each character to the smallest character in its connected component.
Iterate over baseStr and build the answer string by replacing each character with its mapped smallest character.
Return the answer string.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen