Solve Problem 1051. Height Checker

README.md

@@ -138,6 +138,7 @@ LeetSpace serves as a dedicated workspace and archive for my [LeetCode](https://
 | [1026. Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | Medium | [C++](./old-problems/1026/solution.cpp) |
 | [1043. Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/) | Medium | [C](./old-problems/1043/c/solution.c) [C++](./old-problems/1043/solution.cpp) |
 | [1048. Longest String Chain](https://leetcode.com/problems/longest-string-chain) | Medium | [C++](./problems/1048/solution.cpp) |
+| [1051. Height Checker](https://leetcode.com/problems/height-checker/) | Easy | [C++](./old-problems/1051/solution.cpp) |
 | [1081. Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters) | Medium | [C++](./problems/1081/solution.cpp) |
 | [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | [C](./old-problems/1137/c/solution.c) [C++](./old-problems/1137/solution.cpp) |
 | [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [C](./old-problems/1143/c/solution.c) [C++](./old-problems/1143/solution.cpp) |

old-problems/1051/CMakeLists.txt

@@ -0,0 +1,2 @@
+get_dir_name(id)
+add_problem_test(test-${id} test.yaml)

old-problems/1051/solution.cpp

@@ -0,0 +1,17 @@
+#include <algorithm>
+#include <vector>
+
+class Solution {
+ public:
+  int heightChecker(std::vector<int>& heights) {
+    std::vector<int> sortedHeights{heights};
+    std::sort(sortedHeights.begin(), sortedHeights.end());
+
+    int diff{0};
+    for (int i = heights.size() - 1; i >= 0; --i) {
+      if (heights[i] != sortedHeights[i]) ++diff;
+    }
+
+    return diff;
+  }
+};

old-problems/1051/test.yaml

@@ -0,0 +1,26 @@
+name: 1051. Height Checker
+
+types:
+  inputs:
+    heights: std::vector<int>
+  output: int
+
+solutions:
+  cpp:
+    function: heightChecker
+
+test_cases:
+  example_1:
+    inputs:
+      heights: [1, 1, 4, 2, 1, 3]
+    output: 3
+
+  example_2:
+    inputs:
+      heights: [5, 1, 2, 3, 4]
+    output: 5
+
+  example_3:
+    inputs:
+      heights: [1, 2, 3, 4, 5]
+    output: 0