LeetCode Experience

#1263 Minimum Moves to Move a Box to Their Target Location

SWE coding Hard
Sign in to bookmark Original →

Interview Experience

LeetCode #1263: Minimum Moves to Move a Box to Their Target Location. Difficulty: Hard. Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Breadth-First Search Heap (Priority Queue) Arrays Graph Heap Matrix Queue

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview
← All Google questions Google Software Engineer Questions → All Arrays,Graph,Heap,Matrix,Bfs,Queue Questions →