Making Anagrams

/*

 Alice is taking a cryptography class and finding anagrams to be very useful. We consider two strings to be anagrams
 of each other if the first string's letters can be rearranged to form the second string. In other words, both strings
 must contain the same exact letters in the same exact frequency For example, bacdc and dcbac are anagrams, but
 bacdc and dcbad are not.
Alice decides on an encryption scheme involving two large strings where encryption is dependent on the minimum
number of character deletions required to make the two strings anagrams. Can you help her find this number?
Given two strings, a and b, that may or may not be of the same length, determine the minimum number of
character deletions required to make a and b anagrams. Any characters can be deleted from either of the strings.
This challenge is also available in the following translations:
Chinese
Russian
Input Format
The first line contains a single string,a .
The second line contains a single string, b.
Constraints
1<=|a|,|b|<=10^4
It is guaranteed that a and b consist of lowercase English letters.
Output Format
Print a single integer denoting the number of characters which must be deleted to make the two strings anagrams
of each other.
Sample Input
cde
abc
Sample Output
4
Explanation
We delete the following characters from our two strings to turn them into anagrams of each other:
Remove d and e from cde to get c.
Remove a and b from abc to get c.
We had to delete  characters to make both strings anagrams, so we print 4 on a new line.

 */

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace HackerDemo

{

    class MakingAnagrams

    {

      public void MakingAnagramsMain()

        {

            string fStr = Console.ReadLine();

            string sStr = Console.ReadLine();

            string delFStr = DeleteExtrachar(fStr, sStr);

            string delSStr = DeleteExtrachar(sStr, fStr);

            int delCount = delFStr.Count() + delSStr.Count();

            Console.WriteLine(delCount);

        }

        public string DeleteExtrachar(string str1, string str2)

        {

            List<char> charList = str2.ToCharArray().ToList();

            foreach(char c in str1)

            {

                charList.Remove(c);

            }

            return new string(charList.ToArray());

        }

    }

}