diff --git a/pom.xml b/pom.xml
new file mode 100644
index 0000000..051ae77
--- /dev/null
+++ b/pom.xml
@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0"
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+
+    <groupId>org.antesh</groupId>
+    <artifactId>data-structure-and-algorithm-using-java</artifactId>
+    <version>1.0-SNAPSHOT</version>
+
+    <properties>
+        <maven.compiler.source>11</maven.compiler.source>
+        <maven.compiler.target>11</maven.compiler.target>
+    </properties>
+
+</project>
\ No newline at end of file
diff --git a/src/main/java/com/antesh/dsa/ArrayToLinkedList.java b/src/main/java/com/antesh/dsa/ArrayToLinkedList.java
new file mode 100644
index 0000000..691a7e4
--- /dev/null
+++ b/src/main/java/com/antesh/dsa/ArrayToLinkedList.java
@@ -0,0 +1,88 @@
+package com.antesh.dsa;
+
+/*
+* time complexity for insert operation is O(n)
+* */
+
+public class ArrayToLinkedList {
+
+    public static Node root;
+
+    public static void main(String[] args) {
+        int[] arr = {10, 20, 30, 40, 50};
+        int n = arr.length;
+        //slow insertion approach
+        root = convertArrayToLinkedListSlow(arr, n);
+        display(root);
+
+        //fast insertion operation approach
+        root = null;
+        root = convertArrayToLinkedListFast(arr, n);
+        System.out.println();
+        display(root);
+    }
+
+    private static Node convertArrayToLinkedListSlow(int[] arr, int n) {
+        for (int data : arr) {
+            root = insertUsingWhileLoop(root, data);  //slow insertion operation
+        }
+
+        return root;
+    }
+
+    private static Node convertArrayToLinkedListFast(int[] arr, int n) {
+        for (int i = n-1; i>= 0; i--) {
+            root = insertUsingWithoutWhileLoop(root, arr[i]);  //slow insertion operation
+        }
+
+        return root;
+    }
+
+
+    // traversing till end of node and then insert new node at the end causing slow insert
+    public static Node insertUsingWhileLoop(Node root, int data) {
+        Node temp = new Node();
+        temp.data = data;
+        temp.next = null;
+
+        if (root == null) {
+            root = temp;
+        } else {
+
+
+            Node ptr = root;
+            while (ptr.next != null) {
+                ptr = ptr.next;
+            }
+
+            ptr.next = temp;
+        }
+
+        return root;
+    }
+
+    // insert new node at the start of root result in fast insertion
+    public static Node insertUsingWithoutWhileLoop(Node root, int data) {
+        Node temp = new Node();
+        temp.data = data;
+        temp.next = root;
+
+        root = temp;
+
+        return root;
+    }
+
+    public static void display(Node root) {
+        while (root != null) {
+            System.out.print("[ " + root.data + " | next ] --> ");
+            root = root.next;
+        }
+
+        System.out.print("null");
+    }
+
+    static class Node {
+        int data;
+        Node next;
+    }
+}