[Solution] Equal Strings CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Equal Strings CodeChef Solution | CodeChef Problem Solution 2022

Given a string A$A$ of length N$N$ consisting of lowercase English alphabet letters.

You are allowed to perform the following operation on the string A$A$ any number of times:

• Select a non-empty subsequence S$S$ of the array [1,2,3,…,N]$[1,2,3,\dots ,N]$ and any lowercase English alphabet α$\alpha$;
• Change Ai$A_i$ to α$\alpha$ for all i∈S$i\in S$.

Find the minimum number of operations required to convert A$A$ into a given string B$B$ of

Solution Click Below:-  CLICK HERE

 length N$N$ consisting of lowercase English alphabet letters.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The description of T$T$ test cases follow.
• The first line of each test case contains an integer N$N$ - the length of the string A$A$ and B$B$.

Chairs Requirement CodeChef Solution

Subscriptions CodeChef Solution

Alternate Additions CodeChef Solution

Equal Strings CodeChef Solution

Divisible by i CodeChef Solution

Possible GCD CodeChef Solution

Reduce to zero CodeChef Solution

Full Path Eraser CodeChef Solution

Expected move CodeChef Solution

• The second line of each test case contains the string A$A$.
• The third line of each test case contains the string B$B$.

Output Format

For each test case, output the minimum number of operations required to convert string A$A$ into string B$B$.

Constraints

• 1≤T≤104