Add DSA problems

Author: SiddharthaMishra-dev

insertionsort.py

@@ -0,0 +1,11 @@
+arr=[10,4,5,11,9,8,6]
+n=len(arr)
+for i in range(n):
+    temp=arr[i]
+    j=i-1
+    while j>=0 and arr[j]>temp:
+        arr[j+1]=arr[j]
+        j-=1
+    arr[j+1]=temp
+
+print(arr)

removeduplicates.py

@@ -0,0 +1,7 @@
+s="aabbbcd"
+temp=""
+for i in s:
+    if i not in temp:
+        temp+=i
+
+print(temp)