diff --git a/Longest cycle in graph.cpp b/Longest cycle in graph.cpp
new file mode 100644
index 000000000..46b365078
--- /dev/null
+++ b/Longest cycle in graph.cpp	
@@ -0,0 +1,50 @@
+//https://leetcode.com/problems/longest-cycle-in-a-graph/submissions/
+
+class Solution {
+public:
+    
+    int maxLength = -1;
+    
+    void getcycle(vector<int> &edges,int si,vector<bool>& visit,vector<int>& store){
+        if(si == -1)return ;
+        if(visit[si]){
+            int count = -1;
+            for(int i =0;i<store.size();i++){
+                if(store[i]==si){
+                    count = i;
+                    break;
+                } }
+            
+            if(count==-1)return;
+            int size = (store.size()-count);
+            maxLength = max(maxLength,size);
+            return ;
+        }
+        
+        visit[si] = true;
+        store.push_back(si);
+        getcycle(edges,edges[si],visit,store);
+        
+        
+        return ;
+        
+    }
+    
+    
+    
+    int longestCycle(vector<int>& edges) {
+        
+        vector<bool> visit(edges.size(),0);
+        
+        for(int i =0;i<edges.size();i++){
+            
+            if(visit[i])continue;
+            vector<int> store;
+            getcycle(edges,i,visit,store);
+     
+        }
+        
+        return maxLength;
+        
+    }
+};
\ No newline at end of file