diff --git a/Finding middle element in a linked list b/Finding middle element in a linked list
new file mode 100644
index 0000000..b33efe0
--- /dev/null
+++ b/Finding middle element in a linked list	
@@ -0,0 +1,22 @@
+class Solution{
+    private:
+    Node *middle(Node *head)
+    {
+        Node *slow=head,*fast=head;
+        while(fast!=NULL && fast->next!=NULL)
+        {
+            slow=slow->next;
+            fast=fast->next->next;
+        }
+        return slow;
+    }
+    public:
+      
+    int getMiddle(Node *head)
+    {
+        // Your code here
+        Node *mid=middle(head);
+        return mid->data;
+    }
+};
+