diff --git a/Task/vivek_sarkar/1)anagram.py b/Task/vivek_sarkar/1)anagram.py
new file mode 100644
index 0000000..f7eec03
--- /dev/null
+++ b/Task/vivek_sarkar/1)anagram.py
@@ -0,0 +1,11 @@
+s=str(input("enter first word"))
+t=str(input("enter second word"))
+set1=set(s)
+set2=set(t)
+if set1==set2:
+    print("first word is a ANAGRAM of second")
+else:
+    print("first word is not a ANAGRAM of second")
+input()
+
+            
diff --git a/Task/vivek_sarkar/10)transpose.py b/Task/vivek_sarkar/10)transpose.py
new file mode 100644
index 0000000..d4c736a
--- /dev/null
+++ b/Task/vivek_sarkar/10)transpose.py
@@ -0,0 +1,32 @@
+m = int(input("Enter number of rows: "))
+n = int(input("Enter number of columns: "))
+matrix = []
+
+for i in range(m):
+    row = []
+    for j in range(n):
+        element = int(input(f"Enter element at ({i}, {j}): "))
+        row.append(element)
+    matrix.append(row)
+
+print("Original Matrix:")
+for row in matrix:
+    print(row)
+
+# Initialize the transpose matrix with zeroes
+tmatrix = []
+for i in range(n):
+    row1 = [0] * m
+    tmatrix.append(row1)
+
+# Transpose the matrix
+for i in range(m):
+    for j in range(n):
+        tmatrix[j][i] = matrix[i][j]
+
+print("Transposed Matrix:")
+for row in tmatrix:
+    print(row)
+
+
+input()
diff --git a/Task/vivek_sarkar/2) letter count in a string.py b/Task/vivek_sarkar/2) letter count in a string.py
new file mode 100644
index 0000000..cc94ca9
--- /dev/null
+++ b/Task/vivek_sarkar/2) letter count in a string.py	
@@ -0,0 +1,15 @@
+word=str(input("enter a word"))
+wordl=list(word)
+set1=set(word)
+for i in set1:
+    count=0
+    for j in wordl:
+        if j==i:
+            count+=1
+    print(i," <- ",count)
+input()
+
+        
+
+    
+
diff --git a/Task/vivek_sarkar/3)digitarray.py b/Task/vivek_sarkar/3)digitarray.py
new file mode 100644
index 0000000..57cc9f1
--- /dev/null
+++ b/Task/vivek_sarkar/3)digitarray.py
@@ -0,0 +1,10 @@
+number=int(input("enter a number"))
+digitarr=[]
+number1=number+1
+for i in str(number1):
+    digitarr.append(i)
+for j in digitarr:
+    print(j)
+print(number1)
+input()
+
diff --git a/Task/vivek_sarkar/6).arrayprime.PY b/Task/vivek_sarkar/6).arrayprime.PY
new file mode 100644
index 0000000..4647596
--- /dev/null
+++ b/Task/vivek_sarkar/6).arrayprime.PY
@@ -0,0 +1,23 @@
+
+N=int(input("enter disired length of array"))
+A=[0]*(N+1)
+for i in range(1,N):
+    A[i]=int(input("enter a number"))
+primeset=set()
+for j in A:
+    count=0
+    for k in range(1,j):
+        if j%k==0 and j!=0:
+            count+=1
+    if count<=2:
+        primeset.add(j)
+largest=max(primeset)
+smallest=min(primeset)
+diff=largest-smallest
+for m in A:
+    print(m)
+print("the difference between largest prime no and smallest prime no is: ",diff)
+print(primeset)
+    
+          
+          
diff --git a/Task/vivek_sarkar/8)freqlistdict.py b/Task/vivek_sarkar/8)freqlistdict.py
new file mode 100644
index 0000000..587b099
--- /dev/null
+++ b/Task/vivek_sarkar/8)freqlistdict.py
@@ -0,0 +1,26 @@
+
+n = int(input("Enter number of elements in the list: "))
+
+
+mylist = []
+
+
+for i in range(n):
+    a = str(input("Enter an element: "))
+    mylist.append(a)
+
+
+myset = set(mylist)
+
+mydict = {}
+
+
+for i in myset:
+    count = 0
+    for j in mylist:
+        if j == i:
+            count += 1
+    mydict[i] = count
+print(mydict)
+
+input()
diff --git a/Task/vivek_sarkar/cannyedge.py b/Task/vivek_sarkar/cannyedge.py
new file mode 100644
index 0000000..42a0a49
--- /dev/null
+++ b/Task/vivek_sarkar/cannyedge.py
@@ -0,0 +1,10 @@
+import cv2
+
+myimg = cv2.imread('C:\Users\vivek\OneDrive\Pictures\Camera Roll\WIN_20240616_13_03_58_Pro.jpg',cv2.BGR2GRAYSCALE)
+edge = cv2.Canny(O_img, 60, 150)
+
+cv2.imshow('Original', myimg)
+cv2.imshow('edge', edge)
+
+cv2.waitKey(0)
+cv2.destroyAllWindows()
diff --git a/Task/vivek_sarkar/roy&alfi.py b/Task/vivek_sarkar/roy&alfi.py
new file mode 100644
index 0000000..045d734
--- /dev/null
+++ b/Task/vivek_sarkar/roy&alfi.py
@@ -0,0 +1,32 @@
+def minprime(n):
+    factors = []
+    while n % 2 == 0:
+        factors.append(2)
+        n = n // 2
+    for i in range(3, int(n**0.5) + 1, 2):
+        while n % i == 0:
+            factors.append(i)
+            n = n // i
+    if n > 2:
+        factors.append(n)
+
+    return min(factors)
+NL=[]
+roy=[]
+alfi=[]
+N=int(input("enter no of products"))
+for i in range(0,N):
+    R=int(input("enter price"))
+    NL.append(R)
+for j in NL:
+    a=minprime(j)
+    roy.append(a)
+    alfi.append(j-a)
+royamt=sum(roy)
+alfiamt=sum(alfi)
+print("roy will pay $",royamt,"/-")
+print("alfi will pay $",alfiamt,"/-")
+
+    
+    
+    
diff --git a/Task/vivek_sarkar/test.txt b/Task/vivek_sarkar/test.txt
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/Task/vivek_sarkar/test.txt
@@ -0,0 +1 @@
+