diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/demo.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/demo.java
new file mode 100644
index 00000000..5f4de950
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/demo.java
@@ -0,0 +1,22 @@
+import java.util.*;
+
+public class demo 
+{
+    public static void main(String args[])
+    {
+        Scanner sc=new Scanner(System.in);
+        int m=sc.nextInt();
+        int n=sc.nextInt();
+        int a[][]=new int[m][n];
+        for(int i=0;i<m;i++)
+        for(int j=0;j<n;j++)
+        a[i][j]=sc.nextInt();
+        for(int i=0;i<m;i++)
+        {
+            for(int j=0;j<n;j++)
+            System.out.print(a[i][j]+" ");
+            System.out.println();
+        }
+        sc.close();
+    }
+}
diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/matrixmul.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/matrixmul.java
new file mode 100644
index 00000000..1c2d28c3
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/matrixmul.java
@@ -0,0 +1,55 @@
+import java.util.*;
+
+public class matrixmul {
+
+   public static void main(String[] args) throws Exception {
+      Scanner sc = new Scanner(System.in);
+      int n1 = sc.nextInt();
+      int m1 = sc.nextInt();
+      int[][] arr1 = new int[n1][m1];
+
+      for (int i = 0; i < n1; i++) {
+         for (int j = 0; j < m1; j++) {
+            arr1[i][j] = sc.nextInt();
+         }
+      }
+
+      int n2 = sc.nextInt();
+      int m2 = sc.nextInt();
+      int[][] arr2 = new int[n2][m2];
+
+      for (int i = 0; i < n2; i++) {
+         for (int j = 0; j < m2; j++) {
+            arr2[i][j] = sc.nextInt();
+         }
+      }
+
+      if (m1 != n2) {
+         System.out.println("Invalid input");
+         sc.close();
+         return;
+      }
+
+      int[][] prd = new int[n1][m2];
+      for (int i = 0; i < n1; i++) {
+         for (int j = 0; j < m2; j++) {
+            int sum = 0;
+
+            for (int k = 0; k < m1; k++) {
+               sum += arr1[i][k] * arr2[k][j];
+            }
+
+            prd[i][j] = sum;
+         }
+      }
+
+      for (int i = 0; i < n1; i++) {
+         for (int j = 0; j < m2; j++) {
+            System.out.print(prd[i][j] + " ");
+         }
+         System.out.println();
+      }
+      sc.close();
+
+   }
+}
\ No newline at end of file
diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/rotate90.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/rotate90.java
new file mode 100644
index 00000000..491b55ca
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/rotate90.java
@@ -0,0 +1,53 @@
+import java.io.*;
+
+
+public class rotate90 {
+
+   public static void main(String[] args) throws Exception {
+      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+      int n = Integer.parseInt(br.readLine());
+      int[][] arr = new int[n][n];
+
+      for (int i = 0; i < n; i++) {
+         for (int j = 0; j < n; j++) {
+            arr[i][j] = Integer.parseInt(br.readLine());
+         }
+      }
+
+      rotateby90(arr);
+      display(arr);
+   }
+
+   public static void rotateby90(int[][] arr){
+      // transpose
+      for(int i = 0; i < arr.length; i++){
+         for(int j = 0; j < i; j++){
+            int temp = arr[i][j];
+            arr[i][j]= arr[j][i];
+            arr[j][i] = temp;
+         }
+      }
+      // reverse columns, row by row
+      for(int i = 0; i < arr.length; i++){
+         int li = 0;
+         int ri = arr[0].length - 1;
+         while(li <= ri){
+            int temp = arr[i][li];
+            arr[i][li] = arr[i][ri];
+            arr[i][ri] = temp;
+
+            li++;
+            ri--;
+         }
+      }
+   }
+   public static void display(int[][] arr){
+      for(int i = 0; i < arr.length; i++){
+          for(int j = 0; j < arr[0].length; j++){
+              System.out.print(arr[i][j] + " ");
+          }
+          System.out.println();
+      }
+  }
+}
+                                
\ No newline at end of file
diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/spiral.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/spiral.java
new file mode 100644
index 00000000..8ba69a44
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/spiral.java
@@ -0,0 +1,53 @@
+import java.util.*;
+public class spiral 
+{
+    public static void main(String[] args) 
+   {
+      Scanner sc = new Scanner(System.in);
+      int m = sc.nextInt();
+      int n = sc.nextInt();
+      int[][] arr = new int[m][n];
+
+      for (int i = 0; i < m; i++) 
+      {
+         for (int j = 0; j < n; j++) 
+         {
+            arr[i][j] = sc.nextInt();
+         }
+      }
+
+      int c=0,r1=0,c1=0,r2=m,c2=n;
+      while(c<(m*n))
+      {
+        for(int i=r1;i<r2;i++)
+        {
+            System.out.println(arr[i][c1]);
+            c++;
+        }
+        c1++;
+        for(int i=c1;i<c2;i++)
+        {
+            System.out.println(arr[r2-1][i]);
+            c++;
+        }
+        r2--;
+        for(int i=(r2-1);i>=r1;i--)
+        {
+            System.out.println(arr[i][c2-1]);
+            c++;
+        }
+        c2--;
+        if(c>=(m*n)) break;
+        for(int i=(c2-1);i>=c1;i--)
+        {
+            System.out.println(arr[r1][i]);
+            c++;
+        }
+        r1++;
+      }
+
+      sc.close();
+
+   }
+    
+}
diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/wakanda.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/wakanda.java
new file mode 100644
index 00000000..49e325fb
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/2DArrays/wakanda.java
@@ -0,0 +1,38 @@
+import java.util.*;
+
+public class wakanda 
+{
+
+   public static void main(String[] args) 
+   {
+      Scanner sc = new Scanner(System.in);
+      int m = sc.nextInt();
+      int n = sc.nextInt();
+      int[][] arr = new int[m][n];
+
+      for (int i = 0; i < m; i++) 
+      {
+         for (int j = 0; j < n; j++) 
+         {
+            arr[i][j] = sc.nextInt();
+         }
+      }
+
+      int c=0;
+      while(c<n)
+      {
+        for(int i=0;i<m;i++)
+        System.out.println(arr[i][c]);
+        c++;
+        if(c<n)
+        {    
+            for(int i=(m-1);i>=0;i--)
+            System.out.println(arr[i][c]);
+            c++;
+        }
+      }
+
+      sc.close();
+
+   }
+}
\ No newline at end of file
diff --git a/ML/rachitavya_RachitavyaSharma_2125cs1053_2/FunctionAndArrays/baseSub.java b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/FunctionAndArrays/baseSub.java
new file mode 100644
index 00000000..f858b168
--- /dev/null
+++ b/ML/rachitavya_RachitavyaSharma_2125cs1053_2/FunctionAndArrays/baseSub.java
@@ -0,0 +1,42 @@
+import java.util.*;
+  
+  public class baseSub
+  {
+  
+  public static void main(String[] args) 
+  {
+      Scanner scn = new Scanner(System.in);
+      int b = scn.nextInt();
+      int n1 = scn.nextInt();
+      int n2 = scn.nextInt();
+  
+      int d = getDifference(b, n1, n2);
+      System.out.println(d);
+      scn.close();
+   }
+  
+   public static int getDifference(int b, int n1, int n2)
+   {
+        int temp=0,d,i=0,d1,d2,dif=0;
+        while(n1>0 || n2>0)
+        {
+            d1=n1%10;
+            d2=(n2%10)-temp;
+            n1/=10;
+            n2/=10;
+            if(d2>=d1)
+            {
+                d=d2-d1;
+                temp=0;
+            }
+            else
+            {
+                d=(d2+b-d1);
+                temp=1;
+            }
+            dif+=d*((int)Math.pow(10,i++));
+        }
+        return dif;
+   }
+  
+  }
\ No newline at end of file