diff --git a/Domains/CompetitiveProgramming/Programs/C++/LinkedListCycle.cpp b/Domains/CompetitiveProgramming/Programs/C++/LinkedListCycle.cpp
new file mode 100644
index 00000000..520009fc
--- /dev/null
+++ b/Domains/CompetitiveProgramming/Programs/C++/LinkedListCycle.cpp
@@ -0,0 +1,70 @@
+/*
+Problem: Linked List Cycle II
+Platform: Leetcode
+Problem Code: 142
+Difficulty: Medium
+Link: https://leetcode.com/problems/linked-list-cycle-ii/description/
+
+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.
+
+ 
+
+Example 1:
+Input: head = [3,2,0,-4], pos = 1
+Output: tail connects to node index 1
+Explanation: There is a cycle in the linked list, where tail connects to the second node.
+
+Example 2:
+Input: head = [1,2], pos = 0
+Output: tail connects to node index 0
+Explanation: There is a cycle in the linked list, where tail connects to the first node.
+
+Example 3:
+Input: head = [1], pos = -1
+Output: no cycle
+Explanation: There is no cycle in the linked list.
+ 
+Constraints:
+* The number of the nodes in the list is in the range [0, 104].
+* -105 <= Node.val <= 105
+* pos is -1 or a valid index in the linked-list.
+
+Approach:
+1. Created a map weith its key as Node, and value as int.
+2. We measure how many time a node is being accesed.
+3. If frequency of arrivals is more than 1, then we have a cycle.
+Time Complexity: O(n)
+Space Complexity: O(n)
+
+Contributor: SamaKool
+*/
+
+/**
+ * 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) {
+        ListNode* temp = head;
+        map<ListNode*, int> mpp;
+        if(head == NULL) return NULL;
+        if(head->next == NULL) return NULL;
+        while(mpp[temp] != 2){
+            if(temp->next == nullptr) return NULL;
+            mpp[temp]++;
+            temp = temp->next;
+        }
+        if(mpp[temp] == 2) return temp;
+        else return NULL;
+
+    }
+};
\ No newline at end of file