From 67908f77228873714a2022e1a29257f8aedf2e4a Mon Sep 17 00:00:00 2001
From: hltaydn <91338529+hltaydn@users.noreply.github.com>
Date: Tue, 28 Sep 2021 16:23:58 +0200
Subject: [PATCH] Week -3

---
 alphabetic order.py |  7 +++++++
 equal_reverse.py    |  7 +++++++
 hackerrank.py       | 21 +++++++++++++++++++++
 perfect_number.py   | 13 +++++++++++++
 reading_number.py   | 16 ++++++++++++++++
 unique_list.py      |  9 +++++++++
 6 files changed, 73 insertions(+)
 create mode 100644 alphabetic order.py
 create mode 100644 equal_reverse.py
 create mode 100644 hackerrank.py
 create mode 100644 perfect_number.py
 create mode 100644 reading_number.py
 create mode 100644 unique_list.py

diff --git a/alphabetic order.py b/alphabetic order.py
new file mode 100644
index 0000000..cadd02b
--- /dev/null
+++ b/alphabetic order.py	
@@ -0,0 +1,7 @@
+def alphabetical_order():
+    words=input("enter words with -:")
+    words = words.split('-')
+    words.sort()
+    words ='-'.join(words)
+    return words
+print(alphabetical_order())
\ No newline at end of file
diff --git a/equal_reverse.py b/equal_reverse.py
new file mode 100644
index 0000000..96da6b7
--- /dev/null
+++ b/equal_reverse.py
@@ -0,0 +1,7 @@
+def equal_reserve(x):
+    if x[0:]==x[::-1]:
+        return True
+    else:
+        return False
+a =list(map(lambda x: equal_reserve(x),['madam','tacocat','utrecht']))
+print(a)
\ No newline at end of file
diff --git a/hackerrank.py b/hackerrank.py
new file mode 100644
index 0000000..6e8cbf4
--- /dev/null
+++ b/hackerrank.py
@@ -0,0 +1,21 @@
+#find digits
+def findDigits(n):
+    n=str(n)
+    l=len(n)
+    count =0
+    for i in range(l):
+        if int(n[i])==0:
+            continue
+        elif int(n)%int(n[i])==0:
+            count+=1
+    return count
+
+#capitalize
+def solve(s):
+    s=s.split(' ')
+    for i in range(len(s)):
+        if s[i]=='':
+            continue
+        s[i]=s[i][0].capitalize()+s[i][1:]
+    s=' '.join([str(words) for words in s])
+    return s
diff --git a/perfect_number.py b/perfect_number.py
new file mode 100644
index 0000000..e14b2a6
--- /dev/null
+++ b/perfect_number.py
@@ -0,0 +1,13 @@
+## 1-perfect_number.py
+from functools import reduce
+def perfect_number(x):
+    sum = 0
+    for i in range(1,x):
+        if x%i == 0:
+            sum+=i
+    if sum ==x:
+        return True
+perfect_list=list(filter(lambda x: perfect_number(x),range(1,1000)))
+print(perfect_list)
+final_result =reduce(lambda a,b:a+b,list(filter(lambda x: perfect_number(x),range(1,1000))))
+print(final_result)
\ No newline at end of file
diff --git a/reading_number.py b/reading_number.py
new file mode 100644
index 0000000..1172407
--- /dev/null
+++ b/reading_number.py
@@ -0,0 +1,16 @@
+first_digits=['','One','Two','Three','Four','Five','Six','Seven','Eight','Nine']
+second_digits=['','','Twenty','Thirty','Forty','Fifty','Sixty','Seventy','Eighty','Ninety']
+specials=['Ten','Eleven','Twelve','Thirteen','Fourteen','Fifteen','Sixteen','Seventeen','Eighteen','Nineteen']
+def read_num():
+    a=input("enter a number with two digits: ")
+    if a.isdigit()==False:
+        result = a
+    elif int(a)<10 or int(a)>99:
+        result= a
+    elif 20>int(a)>=10:
+        result='{}--------->{}'.format(a,specials[int(a[1])])
+        
+    else:
+        result='{}--------->{} {}'.format(a,second_digits[int(a[0])],first_digits[int(a[1])])
+    return result
+print(read_num())
\ No newline at end of file
diff --git a/unique_list.py b/unique_list.py
new file mode 100644
index 0000000..120bd77
--- /dev/null
+++ b/unique_list.py
@@ -0,0 +1,9 @@
+def unique_list(list):
+    new_list=[]
+    for i in list:
+        if i in new_list:
+            continue
+        else:
+            new_list.append(i)
+    return new_list
+unique_list([1,2,3,3,3,3,4,5,5])
\ No newline at end of file