Add solution #1051

Author: JoshCrozier

1051-height-checker.js

@@ -0,0 +1,25 @@
+/**
+ * 1051. Height Checker
+ * https://leetcode.com/problems/height-checker/
+ * Difficulty: Easy
+ *
+ * A school is trying to take an annual photo of all the students. The students are asked
+ * to stand in a single file line in non-decreasing order by height. Let this ordering be
+ * represented by the integer array expected where expected[i] is the expected height of
+ * the ith student in line.
+ *
+ * You are given an integer array heights representing the current order that the students
+ * are standing in. Each heights[i] is the height of the ith student in line (0-indexed).
+ *
+ * Return the number of indices where heights[i] != expected[i].
+ */
+
+/**
+ * @param {number[]} heights
+ * @return {number}
+ */
+var heightChecker = function(heights) {
+  return [...heights]
+    .sort((a, b) => a - b)
+    .filter((expected, i) => heights[i] !== expected).length;
+};

README.md

@@ -274,6 +274,7 @@
 1037|[Valid Boomerang](./1037-valid-boomerang.js)|Easy|
 1041|[Robot Bounded In Circle](./1041-robot-bounded-in-circle.js)|Medium|
 1047|[Remove All Adjacent Duplicates In String](./1047-remove-all-adjacent-duplicates-in-string.js)|Easy|
+1051|[Height Checker](./1051-height-checker.js)|Easy|
 1071|[Greatest Common Divisor of Strings](./1071-greatest-common-divisor-of-strings.js)|Easy|
 1081|[Smallest Subsequence of Distinct Characters](./1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1103|[Distribute Candies to People](./1103-distribute-candies-to-people.js)|Easy|