Solve Hackerrank problem

https://www.hackerrank.com/challenges/java-anagrams/problem

Author: anitsh

src/main/java/hackerrank/java/Anagrams.java

@@ -0,0 +1,36 @@
+package hackerrank.java;
+
+import hackerrank.java.Anagrams;
+
+import java.util.Arrays;
+
+public class Anagrams {
+    String first;
+    String second;
+
+    public Anagrams(String first, String second) {
+        this.first =  first;
+        this.second =  second;
+    }
+
+    public boolean isAnagram() {
+
+        if (first.length() != second.length())
+            return false;
+
+        // sort
+        char[] firstCharArr =  first.toUpperCase().toCharArray();
+        char[] secondCharArr =  second.toUpperCase().toCharArray();
+        Arrays.sort(firstCharArr);
+        Arrays.sort(secondCharArr);
+
+        // compare all the characters
+        for (int i=0; i<first.length(); i++){
+
+            if (  firstCharArr[i] != secondCharArr[i])
+                return false;
+        }
+
+        return true;
+    }
+}

src/main/java/main/main.java

@@ -1,6 +1,9 @@
 package main;
 
+import hackerrank.java.Anagrams;
 import hackerrank.java.CompareSubstrings;
+import hackerrank.string.Anagram;
+
 import java.util.Scanner;
 
 /**
@@ -17,16 +20,30 @@ public class main {
      * @param args
      */
     public static void main(final String[] args) {
+//        twoStrings();
+        oneStringOneInt();
+    }
 
+    public static void oneStringOneInt() {
         try (Scanner scan = new Scanner(System.in)) {
             final String randomString = scan.next();
             final int substringLength = scan.nextInt();
 
             final CompareSubstrings compareSubstrings =
                     new CompareSubstrings(randomString, substringLength);
 
-            compareSubstrings.createSubstrings();
-
+            System.out.println( compareSubstrings.createSubstrings() );
         }
     }
+
+    public static void twoStrings() {
+        Scanner scan = new Scanner(System.in);
+        String a = scan.next();
+        String b = scan.next();
+        scan.close();
+        Anagrams obj = new Anagrams(a, b);
+
+        boolean ret = obj.isAnagram();
+        System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
+    }
 }

src/test/java/hackerranktest/java/AnagramTest.java

@@ -0,0 +1,44 @@
+package hackerranktest.java;
+
+import hackerrank.java.Anagrams;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+/**
+ *
+ * Problem
+ * https://www.hackerrank.com/challenges/java-anagrams/problem
+ *
+ */
+public class AnagramTest {
+
+    @ParameterizedTest
+    @CsvSource({
+            "anagram, margana",
+            "don, don",
+            "Hello, hello"
+    })
+    void givenAllAnagramsShouldBeTrue(
+            String first, String second) {
+
+        Anagrams obj = new Anagrams(
+                first, second);
+
+        Assertions.assertTrue(obj.isAnagram());
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+            "test, testt",
+            "don, ddd"
+    })
+    void givenAllNotAnagramsShouldBeFalse(
+            String first, String second) {
+
+        Anagrams obj = new Anagrams(
+                first, second);
+
+        Assertions.assertFalse(obj.isAnagram());
+    }
+}