Create minimum-number-of-steps-to-make-two-strings-anagram-ii.cpp

Author: kamyu104

C++/minimum-number-of-steps-to-make-two-strings-anagram-ii.cpp

@@ -0,0 +1,25 @@
+// Time:  O(n)
+// Space: O(1)
+
+// freq table
+class Solution {
+public:
+    int minSteps(string s, string t) {
+        const auto& count1 = counter(s);
+        const auto& count2 = counter(t);
+        int result = 0;
+        for (int i = 0; i < count1.size(); ++i) {
+            result += abs(count1[i] - count2[i]);
+        }
+        return result;
+    }
+    
+private:
+    vector<int> counter(const string& s) const {
+        vector<int> count(26);
+        for (const auto& c : s) {
+            ++count[c - 'a'];
+        }
+        return count;
+    }
+};