diff --git a/crossdiagonal.c b/crossdiagonal.c
new file mode 100644
index 0000000..561097e
--- /dev/null
+++ b/crossdiagonal.c
@@ -0,0 +1,28 @@
+int main()
+{
+    int n,i,j;
+    printf("enter n:");
+    scanf("%d",&n);
+    int A[n][n];
+    for(i=0;i<n;i++)
+    {
+        for(j=0;j<n;j++)
+        {
+            printf("enter elements of matrix:");
+            scanf("%d",&A[i][j]);
+
+        }
+    }
+    for(i=0;i<n;i++)
+    {
+        for(j=0;j<n;j++)
+        {
+            if(i+j==n-1)
+                printf("%d  ",A[i][j]);
+            else
+                printf("0  ");
+        }
+        printf("\n");
+    }
+
+}
diff --git a/duplicates.c b/duplicates.c
new file mode 100644
index 0000000..8a795cc
--- /dev/null
+++ b/duplicates.c
@@ -0,0 +1,38 @@
+int main()
+{
+    int i,j,k,n,temp;
+    printf("enter n:");
+    scanf("%d",&n);
+    int A[n];
+    for(i=0;i<n;i++)
+    {
+        printf("enter elements:");
+        scanf("%d",&A[i]);
+    }
+    printf("elements after deleting the duplicates:");
+    for(i=0;i<n;i++)
+    {
+        for(j=i+1;j<n;)
+        {
+            if(A[i]==A[j])
+            {
+                for(k=j;k<n;k++)
+                {
+
+                   temp=A[k];
+                    A[k]=A[k+1];
+                    A[k+1]=temp;
+
+
+                }
+                n--;
+
+            }
+            else
+                j++;
+        }
+    printf("\n\n%d",A[i]);
+
+
+}
+}