Скачать или смотреть 1861. Rotating the Box | Daily LeetCode Solution | Java

👉 Problem Link: Rotating the Box
👉 Solution: Pinned in the comments.

🔍 LeetCode Problem of the Day: 1861. Rotating the Box | LeetCode Daily Solution

In today’s LeetCode daily challenge, we solve the Rotating the Box problem using an efficient simulation algorithm implemented in Java.

🌟 Problem Description:
You are given a 2D grid representing a box where:
'#' is a stone.
'*' is an obstacle.
'.' is an empty space.
Stones fall due to gravity and settle in empty spaces. After simulating gravity, rotate the box 90 degrees clockwise and return the resulting grid.

🔑 Key Points:
Gravity Simulation:
Process each row, allowing stones (#) to "fall" into empty spaces (.), considering obstacles (*).
Rotation Logic:
Construct a new grid by rotating the box 90 degrees clockwise.
Edge Cases:
Rows with only obstacles.
Empty rows or no stones.

📝 Code Explanation:
Simulate Gravity:
For each row, traverse right-to-left to move stones to the nearest empty position.
Reset the empty pointer when encountering obstacles.
Rotate the Box:
Use matrix transformation to rotate the box by copying elements to a new grid.
Return the Result:
The rotated box represents the final state.

📅 Daily Solutions:
Subscribe for daily LeetCode solutions explained step-by-step in Java!

👥 Join the Discussion:
How would you approach the rotation step differently? Let’s discuss in the comments!
Don’t forget to like, share, and subscribe for more coding challenges!