Add solution #2042

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,703 LeetCode solutions in JavaScript
+# 1,704 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1565,6 +1565,7 @@
 2038|[Remove Colored Pieces if Both Neighbors are the Same Color](./solutions/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js)|Medium|
 2039|[The Time When the Network Becomes Idle](./solutions/2039-the-time-when-the-network-becomes-idle.js)|Medium|
 2040|[Kth Smallest Product of Two Sorted Arrays](./solutions/2040-kth-smallest-product-of-two-sorted-arrays.js)|Hard|
+2042|[Check if Numbers Are Ascending in a Sentence](./solutions/2042-check-if-numbers-are-ascending-in-a-sentence.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./solutions/2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./solutions/2053-kth-distinct-string-in-an-array.js)|Medium|
 2071|[Maximum Number of Tasks You Can Assign](./solutions/2071-maximum-number-of-tasks-you-can-assign.js)|Hard|

solutions/2042-check-if-numbers-are-ascending-in-a-sentence.js

@@ -0,0 +1,29 @@
+/**
+ * 2042. Check if Numbers Are Ascending in a Sentence
+ * https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/
+ * Difficulty: Easy
+ *
+ * A sentence is a list of tokens separated by a single space with no leading or trailing spaces.
+ * Every token is either a positive number consisting of digits 0-9 with no leading zeros, or a
+ * word consisting of lowercase English letters.
+ * - For example, "a puppy has 2 eyes 4 legs" is a sentence with seven tokens: "2" and "4" are
+ *   numbers and the other tokens such as "puppy" are words.
+ *
+ * Given a string s representing a sentence, you need to check if all the numbers in s are strictly
+ * increasing from left to right (i.e., other than the last number, each number is strictly smaller
+ * than the number on its right in s).
+ *
+ * Return true if so, or false otherwise.
+ */
+
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var areNumbersAscending = function(s) {
+  const numbers = s.split(' ').filter(token => !isNaN(token)).map(Number);
+  for (let i = 1; i < numbers.length; i++) {
+    if (numbers[i] <= numbers[i - 1]) return false;
+  }
+  return true;
+};