1061. Lexicographically Smallest Equivalent String || Java || Union Find || Leetcode

This is a variation of union find problem.
You are given two strings of the same length s1 and s2 and a string baseStr.
Return the lexicographically smallest equivalent string of baseStr by using the equivalency information from s1 and s2.

Start: 00:00
Problem Walkthrough: 00:35
Reduction to Union Find: 06:15
Coding: 11:25

🤝🏻 Connect with me:

[urstrulycharan.]

literally it helped me a lot to understand thank you so much for this