- Added solutions by Eric Cheung.

2 files changed, 35 insertions, 0 deletions

diff --git a/challenge-307/eric-cheung/python/ch-1.py b/challenge-307/eric-cheung/python/ch-1.py
new file mode 100755
index 0000000000..4929e89e49
--- /dev/null
+++ b/challenge-307/eric-cheung/python/ch-1.py
@@ -0,0 +1,10 @@
+

+## arrInts = [5, 2, 4, 3, 1]  ## Example 1

+## arrInts = [1, 2, 1, 1, 3]  ## Example 2

+arrInts = [3, 1, 3, 2, 3]  ## Example 3

+

+arrSorted = sorted(arrInts)

+

+arrOutput = [nIndx for nIndx, (nOrig, nSort) in enumerate(zip(arrInts, arrSorted)) if nOrig != nSort]

+

+print (arrOutput)

diff --git a/challenge-307/eric-cheung/python/ch-2.py b/challenge-307/eric-cheung/python/ch-2.py
new file mode 100755
index 0000000000..6d867fd239
--- /dev/null
+++ b/challenge-307/eric-cheung/python/ch-2.py
@@ -0,0 +1,25 @@
+

+## Ref.:

+## https://www.geeksforgeeks.org/python-sorted-check-two-strings-anagram-not/

+

+def IsAnagrams (strInput_01, strInput_02):

+    return (sorted(strInput_01) == sorted(strInput_02))

+

+## arrWords = ["acca", "dog", "god", "perl", "repl"]  ## Example 1

+arrWords = ["abba", "baba", "aabb", "ab", "ab"]  ## Example 2

+

+## arrIndxToDel = []

+## for nIndx in range(len(arrWords) - 2, -1, -1):

+    ## if IsAnagrams (arrWords[nIndx], arrWords[nIndx + 1]):

+        ## arrIndxToDel.append(nIndx)

+

+arrIndxToDel = [nIndx for nIndx in range(len(arrWords) - 2, -1, -1) if IsAnagrams (arrWords[nIndx], arrWords[nIndx + 1])]

+

+## print (arrIndxToDel)

+

+## for nIndx in arrIndxToDel:

+    ## del arrWords[nIndx]

+

+## print (len(arrWords))

+

+print (len(arrWords) - len(arrIndxToDel))