diff --git a/.history/Arrow_pattern_20221006232536.py b/.history/Arrow_pattern_20221006232536.py
new file mode 100644
index 00000000..e69de29b
diff --git a/.history/Arrow_pattern_20221006232540.py b/.history/Arrow_pattern_20221006232540.py
new file mode 100644
index 00000000..3490f8eb
--- /dev/null
+++ b/.history/Arrow_pattern_20221006232540.py
@@ -0,0 +1,17 @@
+n = int(input())
+n1 = (n+1)//2
+n2 = n-n1
+
+for i in range(1,n1+1):
+    for j in range(1,i):
+        print(' ',end='')
+    for k in range(1,i+1):
+        print('* ',end='')
+    print()    
+
+for i in range(n2,0,-1):
+    for j in range(1,i):
+        print(' ',end='')
+    for k in range(1,i+1):
+        print('* ',end='')
+    print()        
\ No newline at end of file
diff --git a/.history/Reverse_each_word_20221006232357.py b/.history/Reverse_each_word_20221006232357.py
new file mode 100644
index 00000000..e69de29b
diff --git a/.history/Reverse_each_word_20221006232401.py b/.history/Reverse_each_word_20221006232401.py
new file mode 100644
index 00000000..7a137680
--- /dev/null
+++ b/.history/Reverse_each_word_20221006232401.py
@@ -0,0 +1,11 @@
+def reverseword(s): 
+   
+   w = s.split(" ")        
+                           
+   nw= [i[::-1] for i in w]
+                          
+   ns = " ".join(nw)
+   return ns
+# Driver's Code 
+s = input()
+print(reverseword(s))
\ No newline at end of file
diff --git a/.history/compress_string_20221006232318.py b/.history/compress_string_20221006232318.py
new file mode 100644
index 00000000..e69de29b
diff --git a/.history/compress_string_20221006232322.py b/.history/compress_string_20221006232322.py
new file mode 100644
index 00000000..38ecdf00
--- /dev/null
+++ b/.history/compress_string_20221006232322.py
@@ -0,0 +1,17 @@
+def ab(a):
+    i=0
+    x=''
+    while(i<len(a)):
+        j=i+1
+        c=1
+        while j<len(a) and (a[i]==a[j]):
+            j+=1
+            c+=1
+        if c==1:
+            x+=a[i]
+        else:
+            x+=a[i]+str(c)
+        i=j
+    return x
+a=input()
+print(ab(a))
\ No newline at end of file
diff --git a/Arrow_pattern.py b/Arrow_pattern.py
new file mode 100644
index 00000000..3490f8eb
--- /dev/null
+++ b/Arrow_pattern.py
@@ -0,0 +1,17 @@
+n = int(input())
+n1 = (n+1)//2
+n2 = n-n1
+
+for i in range(1,n1+1):
+    for j in range(1,i):
+        print(' ',end='')
+    for k in range(1,i+1):
+        print('* ',end='')
+    print()    
+
+for i in range(n2,0,-1):
+    for j in range(1,i):
+        print(' ',end='')
+    for k in range(1,i+1):
+        print('* ',end='')
+    print()        
\ No newline at end of file
diff --git a/Reverse_each_word.py b/Reverse_each_word.py
new file mode 100644
index 00000000..7a137680
--- /dev/null
+++ b/Reverse_each_word.py
@@ -0,0 +1,11 @@
+def reverseword(s): 
+   
+   w = s.split(" ")        
+                           
+   nw= [i[::-1] for i in w]
+                          
+   ns = " ".join(nw)
+   return ns
+# Driver's Code 
+s = input()
+print(reverseword(s))
\ No newline at end of file
diff --git a/compress_string.py b/compress_string.py
new file mode 100644
index 00000000..38ecdf00
--- /dev/null
+++ b/compress_string.py
@@ -0,0 +1,17 @@
+def ab(a):
+    i=0
+    x=''
+    while(i<len(a)):
+        j=i+1
+        c=1
+        while j<len(a) and (a[i]==a[j]):
+            j+=1
+            c+=1
+        if c==1:
+            x+=a[i]
+        else:
+            x+=a[i]+str(c)
+        i=j
+    return x
+a=input()
+print(ab(a))
\ No newline at end of file
diff --git a/pairstar.py b/pairstar.py
new file mode 100644
index 00000000..d34c2f57
--- /dev/null
+++ b/pairstar.py
@@ -0,0 +1,13 @@
+def re(s):
+    n=len(s)
+    if n<=1 :
+        return s
+    temp = re(s[1:])
+    if s[0]==s[1]:
+        return s[0]+"*"+temp
+    else:
+        return s[0]+temp
+ 
+
+s= input().strip()
+print(re(s))
\ No newline at end of file
diff --git a/spiralprint.py b/spiralprint.py
new file mode 100644
index 00000000..1cc02206
--- /dev/null
+++ b/spiralprint.py
@@ -0,0 +1,45 @@
+# Spiral Print
+# ------------------------
+# Given an N*M 2D array, print it in spiral form. That is, first you need to print the 1st row, then last column, then last row and then first column and so on.
+# Print every element only once.
+# Input format :
+# Line 1 : N and M, No. of rows & No. of columns (separated by space) followed by N*M  elements in row wise fashion.
+# Output format :
+# Elements of matrix in spiral form in a single line and space separated
+# Constraints :
+# 0 <= N <= 10^4
+# 0 <= M <= 10^4
+# Sample Input 1:
+#  4 4 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
+# Sample Output 1:
+# 1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10 
+def spiralPrint(arr): 
+    rows = len(arr) 
+    cols = len(arr[0]) 
+    startRow, startCol, endRow, endCol = 0, 0, rows-1, cols-1
+    while startRow<=endRow and startCol<=endCol:
+        # Print startRow 
+        for j in range(startCol, endCol+1): 
+            print(arr[startRow][j], end=' ')
+        startRow += 1
+        if startRow>endRow or startCol>endCol: 
+            break 
+        # Print endCol 
+        for i in range(startRow, endRow+1): 
+            print(arr[i][endCol], end=' ') 
+        endCol -= 1 
+        if startRow>endRow or startCol>endCol: 
+            break 
+        for j in range(endCol, startCol-1, -1):
+            print(arr[endRow][j], end=' ')
+        endRow -= 1 
+        if startRow>endRow or startCol>endCol:
+            break 
+        # Print startCol 
+        for i in range(endRow, startRow-1, -1): 
+            print(arr[i][startCol], end=' ') 
+        startCol += 1 
+l=[int(i) for i in input().strip().split(' ')] 
+m, n=l[0], l[1]
+arr = [ [ l[(j*n)+i+2] for i in range(n)] for j in range(m)] 
+spiralPrint(arr)
\ No newline at end of file