Runtime: 3 ms (Top 71.20%) | Memory: 6.8 MB (Top 80.05%)

Author: AnasImloul

scripts/algorithms/P/Path Crossing/Path Crossing.cpp

@@ -1,31 +1,32 @@
+// Runtime: 3 ms (Top 71.20%) | Memory: 6.8 MB (Top 80.05%)
 class Solution {
 public:
     bool isPathCrossing(string path) {
-	
+
         set<pair<int, int>>st;
-        
+
         int x=0,y=0;
-        
+
         st.insert({0, 0});
-        
+
         for(int i=0;i<path.length();i++){
-            
+
             if(path[i]=='N'){
                 x++;
             }
-            
+
             else if(path[i]=='S'){
                 x--;
             }
-            
+
             else if(path[i]=='E'){
                 y++;
             }
-            
+
             else{
                 y--;
             }
-            
+
             //if pair find at any point, return true
             if(st.find({x,y}) != st.end()){
                 return 1;
@@ -35,4 +36,4 @@ class Solution {
         }
         return 0;
     }
-};
+};