solves n repeated elements in size n array

Author: anishLearnsToCode

README.md

@@ -259,7 +259,7 @@
 | 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [![Java](assets/java.png)](src/DeleteColumnsToMakeSorted.java) |
 | 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | |
 | 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [![Java](assets/java.png)](src/VerifyAnAlienDictionary.java) |
-| 961 | [N-Repeated Elements in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | |
+| 961 | [N-Repeated Elements in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | [![Java](assets/java.png)](src/NRepeatedElementInSizeNArray.java) |
 | 965 | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree) | |
 | 970 | [Powerful Integers](https://leetcode.com/problems/powerful-integers) | |
 | 976 | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle) | |

src/NRepeatedElementInSizeNArray.java

@@ -0,0 +1,10 @@
+public class NRepeatedElementInSizeNArray {
+    public int repeatedNTimes(int[] nums) {
+        for (int k = 1 ; k < 4 ; k++) {
+            for (int i = 0 ; i < nums.length - k ; i++) {
+                if (nums[i] == nums[i + k]) return nums[i];
+            }
+        }
+        return -1;
+    }
+}