Path Crossing Problem

Path Crossing Problem — ExecCode Easy DSA Practice

Solve the Path Crossing problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Description 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 crosses itself at any…

Practice Path Crossing free on ExecCode. Browse more ExecCode DSA problems.