Create a function that checks if a given path, represented by 'N', 'S', 'E', 'W', crosses itself at any point on a 2D plane.
Q - Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at the origin (0, 0) on a 2D plane and walk on the path specified by path. Return true if the path c...
Dec 24, 20232 min read6
