Leetcode 1861. Rotating the Box
Rotate an m×n grid 90° clockwise and simulate gravity so each stone '#' falls until blocked by an obstacle '*' or another stone, returning the resulting n×m grid. The core challenge is compacting stones within obstacle-separated segments toward the gravity direction after rotation.
Asked at:
Snowflake
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late August, 2025
Snowflake
Mid-level
You are given an m x n matrix of characters boxGrid representing a side-view of a box. Each cell of the box is one of the following: A stone '#' A stationary obstacle '*' Empty '.' The box is rotated 90 degrees clockwise, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity does not affect the obstacles' positions, and the inertia from the box's rotation does not affect the stones' horizontal positions. It is guaranteed that each stone in boxGrid rests on an obstacle, another stone, or the bottom of the box. Return an n x m matrix representing the box after the rotation described above.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.