Solution: Number of Spaces Cleaning Robot Cleaned
Explore how a cleaning robot moves through a 2D binary matrix, turning on obstacles or edges and tracking cleaned spaces. Understand the algorithm that monitors the robot's position and direction using bitwise operations to prevent infinite loops. Learn to compute the number of unique spaces cleaned efficiently with O(m×n) time and constant space complexity.
We'll cover the following...
We'll cover the following...
Statement
You are given a 0-indexed 2D binary matrix, room, representing a room of size