Available question text
Given positions of a white rook, a white bishop, and a stationary black queen on an 8x8 chessboard, compute the minimum number of moves (moving only the rook or bishop, which move along ranks/files or diagonals and cannot jump over the other piece) needed to capture the queen.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Angles to Capture All Trees
Coding
- Minimum Difference Between Largest and Smallest Value in Three Moves
Coding
- Minimum Knight Moves
Coding · A* Search · Bidirectional Search · Breadth-First Search
- Minimum Moves to Clean the Classroom
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3001. Minimum Moves to Capture The Queen
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source