AlgoStudyGroup
diff --git a/‎May-LeetCoding-Challenge/17-Find-All-Anagrams-In-A-String/Find-All-Anagrams-In-A-String.java
Copy file name to clipboardExpand all lines: May-LeetCoding-Challenge/17-Find-All-Anagrams-In-A-String/Find-All-Anagrams-In-A-String.java
+32Lines changed: 32 additions & 0 deletions b/‎May-LeetCoding-Challenge/17-Find-All-Anagrams-In-A-String/Find-All-Anagrams-In-A-String.java
Copy file name to clipboardExpand all lines: May-LeetCoding-Challenge/17-Find-All-Anagrams-In-A-String/Find-All-Anagrams-In-A-String.java
+32Lines changed: 32 additions & 0 deletions
@@ -37,4 +37,36 @@ public boolean moveAndCompare(char[] str, int[] strCount, int toRemove, int toAd
         strCount[toAddIdx] += 1;
         return Arrays.equals(strCount, pCount);
     }
+}
+
+class Solution2 {    
+    boolean isAnagram (String a, String b) {
+        int[] arrayA = new int[26];
+        int[] arrayB = new int[26];
+
+        for (int i = 0; i < a.length(); i++) {
+            arrayA[a.charAt(i) - 'a']++;
+        }
+
+        for (int j = 0; j < b.length(); j++) {
+            arrayB[b.charAt(j) - 'a']++;
+        }
+        
+        for (int k = 0; k < 26; k++) {
+            if(arrayA[k] != arrayB[k])  return false;
+        }
+        return true;
+    }
+    
+    public List<Integer> findAnagrams(String s, String p) {
+        List<Integer> res = new ArrayList<>();
+        //List<String> listSubString = new ArrayList<>();
+        String subString = null;
+        for (int i = 0; i < s.length() - p.length() + 1; i++) {
+            subString = s.substring(i, p.length() + i);
+             if(isAnagram(subString, p)) res.add(i);
+        }
+        
+        return res;
+    }
 }