Leetcode 2061. Number of Spaces Cleaning Robot Cleaned

Simulate a robot moving on a 2D grid with obstacles (and/or a sequence of movement/rotation commands) and compute how many unique grid cells it cleans. The core challenge is correctly handling boundaries, obstacles and revisited cells efficiently—typically via simulation or graph traversal with a visited set.