Time: 50 ms (73.99%), Space: 16.9 MB (82.29%) - LeetHub

1347-minimum-number-of-steps-to-make-two-strings-anagram/1347-minimum-number-of-steps-to-make-two-strings-anagram.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int minSteps(string s, string t) {
+        vector<int> nums(26,0);
+        int ans=0;
+        for(int i=0;i<s.size();i++)
+        {
+            nums[s[i]-'a']++;
+        }
+        for(int i=0;i<t.size();i++)
+        {
+            int k=t[i]-'a';
+            if(nums[k]!=0)nums[k]--;
+        }
+        for(int i=0;i<26;i++)
+        {
+            ans+=nums[i];
+        }
+        return ans;
+
+    }
+};