1
# Runtime: 55 ms (Top 32.81%) | Memory: 14.1 MB (Top 28.49%)
2
class Solution:
3
    def isPathCrossing(self, path: str) -> bool:
4
        c = set()
5
        x, y = 0, 0
6
        c.add((x, y))
7
        for i in path:
8
            if i == "N":
9
                y += 1
10
            elif i == "E":
11
                x += 1
12
            elif i == "W":
13
                x -= 1
14
            else:
15
                y -= 1
16
            if (x, y) in c:
17
                return True
18
            else:
19
                c.add((x, y))
20
        return False