Given two strings A and B, find the minimum number of characters that need to be deleted from these 2 strings to make them anagrams of each other.

Sure, here is a step-by-step solution in Python:

1. Import the Counter class from the collections module.

from collections import Counter

2. Define a function that takes two strings as input.

def min_deletions_to_make_anagrams(str1, str2):

3. Inside the function, create two Counter objects for the two strings. The Counter class creates a dictionary where keys are the characters in the string and values are their counts.

    counter1 = Counter(str1)
    counter2 = Counter(str2)

4. Subtract the second counter from the first one. This will give a new counter with the counts of characters that are extra in the first string.

    counter1.subtract(counter2)

5. The sum of the absolute values of the counts in the counter will give the minimum number of deletions required to make the two strings anagrams.

    return sum(abs(count) for count in counter1.values())

6. Call the function with two strings.

print(min_deletions_to_make_anagrams('abc', 'cde'))

This will print 4, which is the minimum number of deletions required to make 'abc' and 'cde' anagrams of each other.