solves valid mountain array

Author: anishLearnsToCode

README.md

@@ -254,7 +254,7 @@
 | 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [![Java](assets/java.png)](src/NumberOfRecentCalls.java) |
 | 937 | [Reorder Data In Log Files](https://leetcode.com/problems/reorder-data-in-log-files) | [![Java](assets/java.png)](src/ReorderDataInLogFiles.java) |
 | 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [![Java](assets/java.png)](src/RangeSumOfBST.java) |
-| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | |
+| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [![Java](assets/java.png)](src/ValidMountainArray.java) [![Python](assets/python.png)](python/valid_mountain_array.py) |
 | 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [![Java](assets/java.png)](src/DIStringMatch.java) |
 | 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | |
 | 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | |

python/valid_mountain_array.py

@@ -0,0 +1,16 @@
+from typing import List
+
+
+class Solution:
+    def validMountainArray(self, numbers: List[int]) -> bool:
+        isIncreasing = True
+        index = 1
+        while index < len(numbers):
+            if numbers[index] == numbers[index - 1]: return False
+            if numbers[index] < numbers[index - 1] and isIncreasing:
+                if index == 1: return False
+                isIncreasing = False
+            if numbers[index] > numbers[index - 1] and not isIncreasing:
+                return False
+            index += 1
+        return not isIncreasing

src/ValidMountainArray.java

@@ -0,0 +1,15 @@
+public class ValidMountainArray {
+    public boolean validMountainArray(int[] arr) {
+        boolean isIncreasing = true;
+        for (int index = 1 ; index < arr.length ; index++) {
+            if (arr[index] == arr[index - 1]) return false;
+            if (arr[index] < arr[index - 1] && isIncreasing) {
+                if (index == 1) return false;
+                isIncreasing = false;
+            } else if (arr[index] > arr[index - 1] && !isIncreasing) {
+                return false;
+            }
+        }
+        return !isIncreasing;
+    }
+}