1496. Path Crossing

class Solution {
    public boolean isPathCrossing(String path) 
    {

        int x = 0, y = 0;
        HashSet<String> visited = new HashSet<>();
        visited.add("0,0");

        for (char dir : path.toCharArray()) 
        {
            if (dir == 'E') 
            {
                x++;
            } 
            else if (dir == 'W') 
            {
                x--;
            } 
            else if (dir == 'N') 
            {
                y++;
            } 
            else if (dir == 'S') 
            {
                y--;
            }

            String curr = x + "," + y;

            if (visited.contains(curr))
            {
                return true;
            }

            visited.add(curr);
        }

        return false;





        
    }
}