DSA Visualizations | Hello Interview

Minimum Knight Moves

DESCRIPTION (credit Leetcode.com)

You are given a chessboard of infinite size where the coordinates of each cell are defined by integer pairs (x, y). The knight piece moves in an L-shape, either two squares horizontally and one square vertically, or two squares vertically and one square horizontally.

Write a function to determine the minimum number of moves required for the knight to move from the starting position (0, 0) to the target position (x, y). Assume that it is always possible to reach the target position, and that x and y are both integers in the range [-200, 200]

EXAMPLES

Example 1:

Input:


x = 1
y = 2

Output: 1

Explanation: The knight can move from (0, 0) to (1, 2) in one move.

Example 2:


x = 4
y = 4

Output: 4

Explanation: The knight can move from (0, 0) to (4, 4) in four moves ( [0, 0] -> [2, 1] -> [4, 2] -> [6, 3] -> [4, 4] )

Run your code to see results here

Explanation

We can model this problem as a graph where each cell on the chessboard is a node, and the neighbors of a cell are the cells that can be reached by a knight's move from that cell. Since this is a shortest path problem, we can use a breadth-first search (BFS) traversal to find the minimum number of moves required to reach the target cell (x, y) starting from the cell (0, 0).

Step 1: Initialize the Queue and Visited Set

We start by initializing our BFS queue with the starting cell (0, 0) along with the number of moves required to reach that cell, which is 0 to start. We also initialize a set to keep track of the cells we have visited, so that we don't revisit them (to avoid infinite loops).

Step 2: Perform BFS Traversal

We then perform a BFS traversal by repeatedly dequeuing from the front of the queue. Each time we dequeue, we get both the current knight position, and the number of moves required to reach that position. We then check if the current knight position is the target cell (x, y). If it is, we return the number of moves required to reach that cell.

Otherwise, for each valid knight move from the current position that has not been visited before, we add that position to the queue, along with the number of moves required to reach that position (which is 1 + the current # of moves). We also mark the current cell as visited.

Solution

from collections import deque

class Solution:
    def minimum_knight_moves(self, x: int, y: int) -> int:
        directions = [(2, 1), (2, -1), (-2, 1), (-2, -1),
                      (1, 2), (1, -2), (-1, 2), (-1, -2)]
        
        # Step 1: Initialize the queue and visited set
        queue = deque([(0, 0, 0)])
        visited = set((0, 0))

        # Step 2: Perform BFS traversal 
        while queue:
            # (cx, cy) is the current knight position
            cx, cy, moves = queue.popleft()
            
            if (cx, cy) == (x, y):
                return moves
            
            # check all possible moves of the knight from the current position
            for dx, dy in directions:
                nx, ny = cx + dx, cy + dy
               
                # if the new position is not visited yet, add it to the queue
                # also mark it as visited and increment the number of moves
                if (nx, ny) not in visited:
                    visited.add((nx, ny))
                    queue.append((nx, ny, moves + 1))
        
        # if the target position is not reachable, return -1
        return -1

Complexity Analysis

Time Complexity: O(x * y), where x and y are the absolute values of the target cell coordinates. The time complexity is dominated by the BFS traversal, which visits all cells in the worst case, and there are a total of x * y cells on the chessboard.

Space Complexity: O(x * y), where x and y are the absolute values of the target cell coordinates. The space complexity is dominated by the visited set, which can contain all cells in the worst case, and there are a total of x * y cells on the chessboard.

Next: Rotting Oranges

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

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Overview

Rotting Oranges

Minimum Knight Moves

DESCRIPTION (credit Leetcode.com)

EXAMPLES

Example 1:

Input:


x = 1
y = 2

Output: 1

Explanation: The knight can move from (0, 0) to (1, 2) in one move.

Example 2:


x = 4
y = 4

Output: 4

Explanation: The knight can move from (0, 0) to (4, 4) in four moves ( [0, 0] -> [2, 1] -> [4, 2] -> [6, 3] -> [4, 4] )

Run your code to see results here

Explanation

Step 1: Initialize the Queue and Visited Set

Step 2: Perform BFS Traversal

Solution

from collections import deque

class Solution:
    def minimum_knight_moves(self, x: int, y: int) -> int:
        directions = [(2, 1), (2, -1), (-2, 1), (-2, -1),
                      (1, 2), (1, -2), (-1, 2), (-1, -2)]
        
        # Step 1: Initialize the queue and visited set
        queue = deque([(0, 0, 0)])
        visited = set((0, 0))

        # Step 2: Perform BFS traversal 
        while queue:
            # (cx, cy) is the current knight position
            cx, cy, moves = queue.popleft()
            
            if (cx, cy) == (x, y):
                return moves
            
            # check all possible moves of the knight from the current position
            for dx, dy in directions:
                nx, ny = cx + dx, cy + dy
               
                # if the new position is not visited yet, add it to the queue
                # also mark it as visited and increment the number of moves
                if (nx, ny) not in visited:
                    visited.add((nx, ny))
                    queue.append((nx, ny, moves + 1))
        
        # if the target position is not reachable, return -1
        return -1

Complexity Analysis

Next: Rotting Oranges

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

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103