Lexicographically Smallest Equivalent String - LeetCode Solution in Java | THE CODE WIZARD

Welcome to my channel.
In this video, I have solved the "Lexicographically Smallest Equivalent String" problem from LeetCode. This problem is tagged as a medium-level question on Leetcode. This problem has been asked on Daily LeetCoding Challenge on 14th January 2023 and I solved it using Java. This is the faster solution to this "Lexicographically Smallest Equivalent String" problem in Java.

Problem: You are given two strings of the same length s1 and s2 and a string baseStr. We say s1[i] and s2[i] are equivalent characters.
For example, if s1 = "abc" and s2 = "cde", then we have 'a' == 'c', 'b' == 'd', and 'c' == 'e'.
Equivalent characters follow the usual rules of any equivalence relation:
Reflexivity: 'a' == 'a'.
Symmetry: 'a' == 'b' implies 'b' == 'a'.
Transitivity: 'a' == 'b' and 'b' == 'c' implies 'a' == 'c'.
For example, given the equivalency information from s1 = "abc" and s2 = "cde", "acd" and "aab" are equivalent strings of baseStr = "eed", and "aab" is the lexicographically smallest equivalent string of baseStr.

Return the lexicographically smallest equivalent string of baseStr by using the equivalency information from s1 and s2.


I have used the Disjoint Set data structure to solve this problem efficiently.


I hope you found this video helpful! If you have any questions or suggestions, please leave them in the comments below.
Thank you for watching!??

Problem Link: https://leetcode.com/problems/lexicographically-smallest-equivalent-string/description/

Keywords relevant to this problem:
Lexicographically Smallest Equivalent String
Lexicographically Smallest Equivalent String Disjoint Set Approach
Lexicographically Smallest Equivalent String LeetCode
Disjoint Set problem
Java Programming
Daily Leetcoding Solution

#disjointsets #leetcode #leetcodesolution #problemsolving #problemsolvingskills #set #dailyleetcoding #javaprogramming #leetcodejava #fastest #solution #coding #map