1347. Minimum Number of Steps to Make Two Strings Anagram

class Solution {
    public int minSteps(String s, String t) 
    {
/*

    int[] count = new int[26];

    for (char c : s.toCharArray())
    {
        count[c - 'a']++;

    }

    for (char c : t.toCharArray())
    {
        count[c - 'a']--;

    }

    return Arrays.stream(count).map(Math::abs).sum() /2;



*/

        int[] countS = new int[26];
        int[] countT = new int[26];

        for (char ch : s.toCharArray()) 
        {

            countS[ch - 'a']++;
        }

        for (char ch : t.toCharArray()) 
        {
            countT[ch - 'a']++;
        }

        int steps = 0;
        for (int i = 0; i < 26; i++) 
        {
            steps += Math.abs(countS[i] - countT[i]);
        }

        return steps / 2;  






        
    }
}