1 files changed, 58 insertions, 0 deletions
diff --git a/challenge-204/paulo-custodio/cpp/ch-1.cpp b/challenge-204/paulo-custodio/cpp/ch-1.cpp
new file mode 100644
index 0000000000..116518bb22
--- /dev/null
+++ b/challenge-204/paulo-custodio/cpp/ch-1.cpp
@@ -0,0 +1,58 @@
+/*
+Challenge 204
+
+Task 1: Monotonic Array
+Submitted by: Mohammad S Anwar
+
+You are given an array of integers.
+
+Write a script to find out if the given array is Monotonic. Print 1 if it is otherwise 0.
+
+    An array is Monotonic if it is either monotone increasing or decreasing.
+
+Monotone increasing: for i <= j , nums[i] <= nums[j]
+Monotone decreasing: for i <= j , nums[i] >= nums[j]
+
+
+Example 1
+
+Input: @nums = (1,2,2,3)
+Output: 1
+
+Example 2
+
+Input: @nums = (1,3,2)
+Output: 0
+
+Example 3
+
+Input: @nums = (6,5,5,4)
+Output: 1
+*/
+
+#include <iostream>
+#include <vector>
+
+int is_monotonic(const std::vector<int>& data) {
+    if (data.size() < 2)
+        return 1;
+    else {
+        int climb = 0, descend = 0;
+        for (size_t i = 0; i < data.size() - 1; i++) {
+            int delta = data[i+1]-data[i];
+            if (delta > 0) climb++;
+            else if (delta < 0) descend++;
+            if (climb && descend) return 0;
+        }
+        return 1;
+    }
+}
+
+int main(int argc, char* argv[]) {
+    argv++; argc--;
+    std::vector<int> data;
+
+    for (int i = 0; i < argc; i++)
+        data.push_back(atoi(argv[i]));
+    std::cout << is_monotonic(data) << std::endl;
+}