solves set mismatch

Author: anishLearnsToCode

README.md

@@ -167,7 +167,7 @@
 | 633 | [Sum Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [![Java](assets/java.png)](src/SumOfSquareNumbers.java) [![Python](assets/python.png)](python/sum_of_squares_numbers.py) |
 | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | |
 | 643 | [Maximum Average SubArray I](https://leetcode.com/problems/maximum-average-subarray-i) | [![Java](assets/java.png)](src/MaximumAverageSubArrayI.java) [![Python](assets/python.png)](python/maximum_average_subarray_I.py) |
-| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | |
+| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [![Java](assets/java.png)](src/SetMismatch.java) [![Python](assets/python.png)](python/set_mismatch.py) |
 | 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | |
 | 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | |
 | 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | |

python/set_mismatch.py

@@ -0,0 +1,14 @@
+from typing import List
+
+
+class Solution:
+    def findErrorNums(self, nums: List[int]) -> List[int]:
+        repeated, missing = 0, 0
+        for number in nums:
+            if nums[abs(number) - 1] < 0: repeated = number
+            else: nums[abs(number) - 1] *= -1
+        for index in range(len(nums)):
+            if nums[index] > 0:
+                missing = index + 1
+                break
+        return [abs(repeated), missing]

src/SetMismatch.java

@@ -0,0 +1,16 @@
+public class SetMismatch {
+    public int[] findErrorNums(int[] array) {
+        int repeated = 0, missing = 0;
+        for (int number : array) {
+            if (array[Math.abs(number) - 1] < 0) repeated = number;
+            else array[Math.abs(number) - 1] *= -1;
+        }
+        for (int index = 0 ; index < array.length ; index++) {
+            if (array[index] > 0) {
+                missing = index + 1;
+                break;
+            }
+        }
+        return new int[] {Math.abs(repeated), missing};
+    }
+}