Lexicographically Smallest Equivalent String Leetcode 1061 - January Challenge 2023 ( Day 14 )

#leetcode #cpp #solution

Lexicographically Smallest Equivalent String Leetcode 1061 - January Challenge 2023 ( Day 14 )

Problem Description:
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.

#placement #arrays #programming #coding #code #programmer #coder #technology #codinglife #tech #computerscience #software #softwaredeveloper #faang #potd #gfg #gfgdailychallenges #geeksforgeeks #problemoftheday #gfgpractice #leetcode #leetcodedailychallenge #leetcodesolution #codingcontest #algorithms #dailycoding

Comments down if u have any doubts.

Show your support Subscribe and share this video with your friends. Press the bell icon to get updated.
✅ check out cool videos ✅
🔔SUBSCRIBE🔔