Given two strings in lowercase, your task is to find minimum number of manipulations required to make two strings anagram** without deleting any character**. If two strings contains same data set in any order then strings are called **Anagrams**.

```
Input :
s1 = "aba"
s2 = "baa"
Output : 0
Explanation: Both String contains identical characters
Input :
s1 = "ddcf"
s2 = "cedk"
Output : 2
Explanation : Here, we need to change two characters
in either of the strings to make them identical. We
can change 'd' and 'f' in s1 or 'e' and 'k' in s2.
```

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then **T** test cases follow. First line of each test case contains an integer **N**, denoting the size of the string, next line contains **two strings** to make them anagrams.

**Output:**

Output the minimum number of manipulations required to make two strings anagram. If two strings are Anagram return 0.

**Constraints:**

1<=T<=100

1<=length of string<=10^{3}

**Example:
Input:**

2

3

gfg fgg

5

abcde abcce

0

1

Author: harshitsidhwa

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

murli01 | 343 |

decoder_101 | 274 |

john_wick | 204 |

singhalsaurav1997 | 196 |

Sulagna | 189 |

john_wick | 725 |

PiyushPandey4 | 717 |

ASWATHAMA | 565 |

akhyasharma01 | 547 |

decoder_101 | 512 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.