From 592752b24e8a00f5b61a35cfc5a6f29246cb42a5 Mon Sep 17 00:00:00 2001
From: Paulo Custodio <pauloscustodio@gmail.com>
Date: Fri, 20 Sep 2024 10:56:05 +0100
Subject: Add Python solution to challenge 071

---
 challenge-071/paulo-custodio/python/ch-1.py | 39 +++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 challenge-071/paulo-custodio/python/ch-1.py

(limited to 'challenge-071/paulo-custodio/python/ch-1.py')

diff --git a/challenge-071/paulo-custodio/python/ch-1.py b/challenge-071/paulo-custodio/python/ch-1.py
new file mode 100644
index 0000000000..01cbebfece
--- /dev/null
+++ b/challenge-071/paulo-custodio/python/ch-1.py
@@ -0,0 +1,39 @@
+#!/usr/bin/env python3
+
+# Challenge 071
+#
+# TASK #1 > Peak Element
+# Submitted by: Mohammad S Anwar
+# You are given positive integer $N (>1).
+#
+# Write a script to create an array of size $N with random unique elements
+# between 1 and 50.
+#
+# In the end it should print peak elements in the array, if found.
+#
+# An array element is called peak if it is bigger than it's neighbour.
+#
+# Example 1
+# Array: [ 18, 45, 38, 25, 10, 7, 21, 6, 28, 48 ]
+# Peak: [ 48, 45, 21 ]
+# Example 2
+# Array: [ 47, 11, 32, 8, 1, 9, 39, 14, 36, 23 ]
+# Peak: [ 47, 32, 39, 36 ]
+
+import sys
+
+def peek_elem(n):
+    out = []
+    if len(n) < 2:
+        return out
+    if n[0] > n[1]:
+        out.append(n[0])
+    for i in range(1, len(n) - 1):
+        if n[i] > n[i-1] and n[i] > n[i+1]:
+            out.append(n[i])
+    if n[-1] > n[-2]:
+        out.append(n[-1])
+    return out
+
+n = list(map(int, sys.argv[1:]))
+print(", ".join(map(str, peek_elem(n))))
-- 
cgit