done

Author: Ram swaroop

src/me/ramswaroop/arrays/SubsetOfArray.java

@@ -0,0 +1,44 @@
+package me.ramswaroop.arrays;
+
+import me.ramswaroop.arrays.sorting.QuickSort;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 9/4/15
+ * @time: 11:28 PM
+ */
+public class SubsetOfArray {
+
+    public static boolean isSubsetOfArray(int[] a, int[] b) {
+
+        QuickSort.quickSort(a);
+        QuickSort.quickSort(b);
+
+        int i, j;
+        for (i = 0, j = 0; i < a.length && j < b.length; ) {
+            if (a[i] > b[j]) {
+                return false;
+            } else if (a[i] == b[j]) {
+                i++;
+                j++;
+            } else {
+                i++;
+            }
+        }
+
+        if (i < b.length) {
+            return false;
+        } else {
+            return true;
+        }
+    }
+
+    public static void main(String a[]) {
+        System.out.println(isSubsetOfArray(new int[]{11, 1, 13, 21, 3, 7}, new int[]{11, 3, 7, 1}));
+        System.out.println(isSubsetOfArray(new int[]{1, 2, 2, 3, 4, 5, 6}, new int[]{1, 2, 4}));
+        System.out.println(isSubsetOfArray(new int[]{1, 2, 2, 3, 4, 5, 6}, new int[]{1, 2, 2, 4}));
+        System.out.println(isSubsetOfArray(new int[]{1, 4, 2}, new int[]{1, 4, 4, 2}));
+    }
+}