Most Similar Words Codeforces Solution | Codeforces Problem Solution 2022

Most Similar Words Codeforces Solution | Codeforces Problem Solution 2022

C. Most Similar Words

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given 𝑛$n$ words of equal length 𝑚$m$, consisting of lowercase Latin alphabet letters. The 𝑖$i$-th word is denoted 𝑠𝑖$s_i$.

In one move you can choose any position in any single word and change the letter at that position to the previous or next letter in alphabetical order. For example:

• you can change 'e' to 'd' or to 'f';
• 'a' can only be changed to 'b';
• 'z' can only be changed to 'y'.

Solution Click Below:-  CLICK HERE

The difference between two words is the minimum number of moves required to make them equal. For example, the difference between "best" and "cost" is 1+10+0+0=11$1+10+0+0=11$.

Find the minimum difference of 𝑠𝑖$s_i$ and 𝑠𝑗$s_j$ such that (𝑖<𝑗)$(i<j)$. In other words, find the minimum difference over all possible pairs of the 𝑛$n$ words.

Input

The first line of the input contains a single integer 𝑡$t$ (1≤𝑡≤100$1\le t\le 100$) — the number of test cases. The description of test cases follows.

Lucky? Codeforces Solution

Equal Candies Codeforces Solution

Most Similar Words Codeforces Solution

X-Sum Codeforces Solution

Eating Queries Codeforces Solution

Longest Strike Codeforces Solution

White-Black Balanced Subtrees Codeforces Solution

Maximum Crossings (Easy Version) Codeforces Solution

Maximum Crossings (Hard Version) Codeforces Solution

The first line of each test case contains 2$2$ integers 𝑛$n$ and 𝑚$m$ (2≤𝑛≤50$2\le n\le 50$, 1≤𝑚≤8$1\le m\le 8$) — the number of strings and their length respectively.

Then follows 𝑛$n$ lines, the 𝑖$i$-th of which containing a single string 𝑠𝑖$s_i$ of length 𝑚$m$, consisting of lowercase Latin letters.

Output

For each test case, print a single integer — the minimum difference over all possible pairs of the given strings.

Join Now for Solution:-