diff --git a/C++/142-Linked_List_Cycle_II.cpp b/C++/142-Linked_List_Cycle_II.cpp
new file mode 100644
index 0000000..5f3b953
--- /dev/null
+++ b/C++/142-Linked_List_Cycle_II.cpp
@@ -0,0 +1,48 @@
+//Problem Link -: https://leetcode.com/problems/linked-list-cycle-ii/
+
+// Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
+
+// There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to (0-indexed). It is -1 if there is no cycle. Note that pos is not passed as a parameter.
+
+// Do not modify the linked list.
+
+//Solution -:
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode *detectCycle(ListNode *head) {
+        if (head == NULL or head -> next == NULL or head->next->next == NULL) {
+            return NULL;
+        }
+        ListNode *p1 = head;
+        ListNode *p2 = head;
+        int flag = 0;
+        while (p1 != NULL and p2 != NULL and p2 -> next != NULL) {
+            p1 = p1->next;
+            p2 = p2->next->next;
+            if (p1 == p2) {
+                flag++;
+                break;
+            }
+        }
+        if (flag == 0) {
+            return NULL;
+        }
+        else {
+            p1 = head;
+            while (p1 != p2) {
+                p1 = p1->next;
+                p2 = p2->next;
+            }
+            return p1;
+        }
+    }
+};