/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

4 votes150 views2 answers
C# merge two lists different types
TypeScript
0 vote149 views1 answer
Input type file in html events angular
TypeScript
0 vote100 views1 answer
Amcharts angular
TypeScript
0 vote151 views1 answer
Distributed Cron Job
TypeScript
0 vote175 views2 answers
Fibonacci counter in typescript
TypeScript
0 vote161 views1 answer
In javaWrite a plan that prints all the perfect numbers in the range of 1 to 1000
TypeScript
2 votes143 views2 answers
File_get_contents follow redirect
TypeScript
2 votes156 views2 answers
Constraints in database
TypeScript
6 votes146 views1 answer
Check all existing virtial environments python mac
TypeScript
0 vote128 views1 answer
How many elements can be stored in an array
TypeScript