Time: 145 ms (11.64%), Space: 17.1 MB (19.43%) - LeetHub

Author: knockcat

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

@@ -0,0 +1,26 @@
+class Solution {
+public:
+    int minSteps(string s, string t) {
+        
+        map<char, int> mp;
+        
+        int need = 0;
+        
+        for(auto& ele : s)
+            ++mp[ele];
+        
+        for(auto& ele : t)
+        {
+            if(mp[ele] > 0)
+            {
+                --mp[ele];
+                if(mp[ele] == 0)
+                    mp.erase(ele);
+            }
+            else
+                ++need;
+        }
+       
+        return need;
+    }
+};