LeetCode BiWeekly Contest 192 Q1. Minimum Queen Moves to Reach Target
Minimum Queen Moves to Reach Target - Video Solution
Watch 3 video solutions for Minimum Queen Moves to Reach Target, a easy level problem. This walkthrough by ADevOpsEngineer has 89 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Problem Statement
There is an 8 x 8 empty chessboard with 1-indexed rows and columns.
You are given an array source = [sr, sc] representing the starting position of a queen, and an array target = [tr, tc] representing the target position.
In one move, the queen travels one or more squares along a single row, column, or diagonal, staying within the board.
Return the minimum number of moves for the queen to land exactly on target.
Example 1:
Input: source = [8,1], target = [1,8]
Output: 1
Explanation:
āāāāāāā
āāāāāāā
A single diagonal move takes the queen straight from (8, 1) to (1, 8).
Example 2:
Input: source = [4,2], target = [1,3]
Output: 2
Explanation:
āāāāāāā
The queen moves from (4, 2) to (4, 3), then from (4, 3) to (1, 3), reaching the target in 2 moves.
Example 3:
Input: source = [1,1], target = [1,1]
Output: 0
Explanation:
The queen is already at the target position, so no moves are needed.
Constraints:āāāāāāā
source == [sr, sc]target == [tr, tc]1 <= sr, sc, tr, tc <= 8