solves element appearing more than 25% in sorted array

Author: anishLearnsToCode

README.md

@@ -331,7 +331,7 @@
 | 1271 | 🔒 [Hexspeak](https://leetcode.com/problems/hexspeak)                                                                                                |                                                                                                                                                                             |                                                                                                                                   |
 | 1275 | [Find Winner On a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game)                                                 |                                                       [![Java](assets/java.png)](src/FindWinnerOnATicTacToeGame.java)                                                       |                                                                                                                                   |
 | 1281 | [Subtract the Product and Sum of Digits of a Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)            |                                              [![Java](assets/java.png)](src/SubtractTheProductAndSumOfDigitsOfAnInteger.java)                                               |                                                                                                                                   |
-| 1287 | [Element Appearing More Than 25% in Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array)                      |                                                                                                                                                                             |                                                                                                                                   |
+| 1287 | [Element Appearing More Than 25% in Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array)                      |                                             [![Java](assets/java.png)](src/ElementAppearingMoreThan25PercentInSortedArray.java)                                             |                                                                                                                                   |
 | 1290 | [Convert Binary Number In A Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)                 |                                                                                                                                                                             |                                                                                                                                   |
 | 1295 | [Find Numbers With Even Numbers of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits)                                    |                                                                                                                                                                             |                                                                                                                                   |
 | 1299 | [Replace Elements With Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)           |                                                                                                                                                                             |                                                                                                                                   |

src/ElementAppearingMoreThan25PercentInSortedArray.java

@@ -0,0 +1,13 @@
+public class ElementAppearingMoreThan25PercentInSortedArray {
+    public int findSpecialInteger(int[] array) {
+        if (array.length <= 3) return array[0];
+        final int specialIntegerFrequency = array.length / 4 + 1;
+        for (int i = 1, current = 1 ; i < array.length ; i++) {
+            if (array[i] ==array[i - 1]) current++;
+            else current = 1;
+
+            if (current >= specialIntegerFrequency) return array[i];
+        }
+        return -1;
+    }
+}