Create 1347-minimum-number-of-steps-to-make-two-strings-anagram.java

jelonmusk · Jan 13, 2024 · b98a126 · b98a126
1 parent c3ebddb
commit b98a126
Showing 1 changed file with 22 additions and 0 deletions.
diff --git a/java/1347-minimum-number-of-steps-to-make-two-strings-anagram.java b/java/1347-minimum-number-of-steps-to-make-two-strings-anagram.java
@@ -0,0 +1,22 @@
+/*-------------------------------
+ Time Complexity: O(n)
+ Space Complexity: O(n)
+--------------------------------*/ 
+class Solution {
+ public int minSteps(String s, String t) {
+ Map<Character, Integer> map1 = new HashMap<>();
+ for(char c: s.toCharArray())
+ map1.put(c, map1.getOrDefault(c, 0) + 1);
+
+ int res = 0;
+ for(char c: t.toCharArray()){
+ if(map1.containsKey(c) && map1.get(c) > 0){
+ map1.put(c, map1.get(c)-1);
+ }
+ else{
+ res++;
+ }
+ } 
+ return res;
+ }
+}