Sponsored
Sponsored
Solve with full IDE support and test cases
Use these hints if you're stuck. Try solving on your own first.
The minimum number of moves can be either <code>1</code> or <code>2</code>.
The answer will be <code>1</code> if the queen is on the path of the rook or bishop and none of them is in between.