Leetcode 3568. Minimum Moves to Clean the Classroom

Find the minimum moves to collect all 'L' cells in a grid where each step costs 1 energy, obstacles block movement, and landing on 'R' fully restores your finite energy; if energy hits 0 you can only continue from an 'R'. This requires searching an augmented state space (position, remaining energy, collected-litter bitmask) — effectively a shortest-path / TSP-like search with recharge nodes to determine feasibility and minimum steps.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3568. Minimum Moves to Clean the Classroom

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact