Add solution #1535

Author: JoshCrozier

README.md

@@ -411,6 +411,7 @@
 1512|[Number of Good Pairs](./1512-number-of-good-pairs.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1528|[Shuffle String](./1528-shuffle-string.js)|Easy|
+1535|[Find the Winner of an Array Game](./1535-find-the-winner-of-an-array-game.js)|Medium|
 1550|[Three Consecutive Odds](./1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./1551-minimum-operations-to-make-array-equal.js)|Medium|
 1566|[Detect Pattern of Length M Repeated K or More Times](./1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|

solutions/1535-find-the-winner-of-an-array-game.js

@@ -0,0 +1,35 @@
+/**
+ * 1535. Find the Winner of an Array Game
+ * https://leetcode.com/problems/find-the-winner-of-an-array-game/
+ * Difficulty: Medium
+ *
+ * Given an integer array arr of distinct integers and an integer k.
+ *
+ * A game will be played between the first two elements of the array (i.e. arr[0] and arr[1]).
+ * In each round of the game, we compare arr[0] with arr[1], the larger integer wins and
+ * remains at position 0, and the smaller integer moves to the end of the array. The game
+ * ends when an integer wins k consecutive rounds.
+ *
+ * Return the integer which will win the game.
+ *
+ * It is guaranteed that there will be a winner of the game.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} k
+ * @return {number}
+ */
+var getWinner = function(arr, k) {
+  let result = arr[0];
+
+  for (let i = 1, count = 0; i < arr.length && count < k; i++) {
+    if (result < arr[i]) {
+      result = arr[i];
+      count = 0;
+    }
+    count++;
+  }
+
+  return result;
+};