/TypeScript/What is lexicographically smallest string

What is lexicographically smallest string

Input: A = "hello", B = "world", S = "hold"
Output: "hdld"
Explanation:  Based on the equivalency information in A and B, we can group their characters as [h,w], [d,e,o], [l,r]. So only the second letter 'o' in S is changed to 'd', the answer is "hdld".

-1

Source: leetcode.com

Similar codes

3 votes111 views1 answer
Squash commits in remote branch
TypeScript
0 vote99 views1 answer
Style type in typescript in react
TypeScript
0 vote109 views1 answer
Youtube comments scrape r
TypeScript
11 votes107 views1 answer
Properties of all electromagnetic waves
TypeScript
0 vote105 views1 answer
Check if drive exists c#
TypeScript
5 votes109 views1 answer
Benefits of multiprogramming
TypeScript
0 vote104 views1 answer
What types of troop advancements were involved, and why were both needed in dday
TypeScript
1 vote107 views1 answer
Adonisjs decrement
TypeScript
0 vote119 views1 answer
Write in file in typescript
TypeScript
0 vote120 views1 answer
InsertSheet() at the beginning of active sheets google script
TypeScript