making anagrams: done, some minor javadoc error fixed

Author: rampatra

src/com/hackerrank/algorithms/strings/MakingAnagrams.java

@@ -0,0 +1,53 @@
+package com.hackerrank.algorithms.strings;
+
+import java.util.Arrays;
+
+/**
+ * @author ramswaroop
+ * @version 28/09/2016
+ */
+public class MakingAnagrams {
+
+    /**
+     * Find number of characters to be deleted to make {@param a}
+     * and {@param b} anagrams.
+     * See: https://www.hackerrank.com/challenges/making-anagrams
+     *
+     * @param a
+     * @param b
+     * @return
+     */
+    public static int makeAnagrams(String a, String b) {
+        
+        int i = 0, j = 0, c = 0;
+        char[] s1 = a.toCharArray();
+        char[] s2 = b.toCharArray();
+        Arrays.sort(s1);
+        Arrays.sort(s2);
+
+        while (i < s1.length || j < s2.length) {
+            if (i >= s1.length) {
+                c++;
+                j++;
+            } else if (j >= s2.length) {
+                c++;
+                i++;
+            } else if (s1[i] < s2[j]) {
+                c++;
+                i++;
+            } else if (s1[i] > s2[j]) {
+                c++;
+                j++;
+            } else {
+                i++;
+                j++;
+            }
+        }
+
+        return c;
+    }
+
+    public static void main(String[] a) {
+        System.out.println(makeAnagrams("abc", "cde"));
+    }
+}

src/me/ramswaroop/arrays/RotateArray.java

@@ -46,10 +46,10 @@ public static void rotateNaiveApproach(int[] a, int k) {
      * Reverse B, we get ArBr = [2, 1, 7, 6, 5, 4, 3]
      * Reverse all, we get (ArBr)r = [3, 4, 5, 6, 7, 1, 2]
      * NOTE: Ar = Reverse of A
+     * See: http://www.geeksforgeeks.org/program-for-array-rotation-continued-reversal-algorithm/
      *
      * @param a
      * @param k
-     * @see: http://www.geeksforgeeks.org/program-for-array-rotation-continued-reversal-algorithm/
      */
     public static void rotateReversal(int[] a, int k) {
         ReverseArray.reverseRecursive(a, 0, k - 1);
@@ -59,10 +59,10 @@ public static void rotateReversal(int[] a, int k) {
 
     /**
      * Juggling algorithm for array rotation.
+     * See: http://www.geeksforgeeks.org/array-rotation/
      *
      * @param a
      * @param k
-     * @see: http://www.geeksforgeeks.org/array-rotation/
      */
     public static void rotateGCD(int[] a, int k) {
         int gcd = gcd(a.length, k), temp, i, j, p;