Runtime 1105 ms (Top 5.1%) | Memory 43.0 MB (Top 63.9%)

Author: AnasImloul

scripts/algorithms/S/Set Mismatch/Set Mismatch.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int[] findErrorNums(int[] nums) {
+        int n = nums.length;
+        int dup = 0, miss = 0;
+
+        for (int i = 1; i <= n; i++) {
+            int count = 0;
+            for (int j = 0; j < n; j++) {
+                if (nums[j] == i) count++;
+            }
+
+            if (count == 2) dup = i;
+            if (count == 0) miss = i;
+        }
+
+        return new int[] {dup, miss};
+    }
+}
+
+// TC: O(n ^ 2), SC: O(1)