From d23fbdd681ca2a9b02c5cb2234caa61d5ec32cef Mon Sep 17 00:00:00 2001
From: Packy Anderson <packy@cpan.org>
Date: Fri, 16 Feb 2024 01:14:32 -0500
Subject: Challenge 256 solutions by Packy Anderson

  * Raku
  * Perl
  * Python

1 Blog post
---
 challenge-256/packy-anderson/python/ch-1.py | 36 +++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100755 challenge-256/packy-anderson/python/ch-1.py

(limited to 'challenge-256/packy-anderson/python/ch-1.py')

diff --git a/challenge-256/packy-anderson/python/ch-1.py b/challenge-256/packy-anderson/python/ch-1.py
new file mode 100755
index 0000000000..d5aab629f4
--- /dev/null
+++ b/challenge-256/packy-anderson/python/ch-1.py
@@ -0,0 +1,36 @@
+#!/usr/bin/env python
+
+def maximumPairs(words):
+    count = 0
+    while words:
+        # the the first word off the list
+        first = words.pop(0)
+        # now compare to the rest of the words in the list
+        for i in range(len(words)):
+            second = words[i]
+            if first == second[::-1]:
+                # we found a pair
+                count += 1
+                # remove words[i] from the list
+                words.pop(i)
+                # we don't need to compare
+                # any more words to first
+                break
+    return count
+
+def comma_join(arr):
+    return '", "'.join(arr)
+
+def solution(words):
+    print(f'Input: @words = ({words})')
+    count = maximumPairs(words)
+    print(f'Output: {count}')
+
+print('Example 1:')
+solution(["ab", "de", "ed", "bc"])
+
+print('\nExample 2:')
+solution(["aa", "ba", "cd", "ed"])
+
+print('\nExample 3:')
+solution(["uv", "qp", "st", "vu", "mn", "pq"])
-- 
cgit