Solutions to Dictionaries and Hashmaps section

Interview Preparation Kit/Dictionaries and Hashmaps/Sherlock and Anagrams/Solution.java

@@ -0,0 +1,51 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    // Complete the sherlockAndAnagrams function below.
+    static int sherlockAndAnagrams(String s) {
+        HashMap<String, Integer> map = new HashMap<>();
+
+        int totalCount = 0;
+
+        for (int i = 0; i < s.length(); i++) {
+            for (int j = i + 1; j <= s.length(); j++) {
+                String currentSubString = s.substring(i, j);
+
+                char[] chars = currentSubString.toCharArray();
+                Arrays.sort(chars);
+                currentSubString = String.valueOf(chars);
+
+                int value = map.getOrDefault(currentSubString, 0);
+                if (value > 0) {
+                    totalCount += value;
+                }
+                map.put(currentSubString, ++value);
+            }
+        }
+        return totalCount;
+    }
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) throws IOException {
+        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+
+        int q = scanner.nextInt();
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+        for (int qItr = 0; qItr < q; qItr++) {
+            String s = scanner.nextLine();
+
+            int result = sherlockAndAnagrams(s);
+
+            bufferedWriter.write(String.valueOf(result));
+            bufferedWriter.newLine();
+        }
+
+        bufferedWriter.close();
+
+        scanner.close();
+    }
+}