Practice Escape The Ghosts
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are playing a simplified PAC-MAN game on an infinite 2-D grid. You start at the point [0, 0], and you are given a destination point target = [xtarget, ytarget] that you are trying to get to. There are several ghosts on the map with their starting positions given as a 2D array ghosts, where ghosts[i] = [xi, yi] represents the starting position of the ith ghost. All inputs are integral coordinates. Each turn, you and all the ghosts may independently choose to either move 1 unit in any of the four cardinal directions: north, east, south, or west, or stay still. All actions happen simultaneously. You escape if and only if you can reach the target before any ghost reaches you. If you reach any square (including the target) at the same time as a ghost, it does not count as an escape. Return true if it is possible to escape regardless of how the ghosts move, otherwise return false.
Source: Escape The Ghosts on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
ghosts = [[1,0],[0,3]], target = [0,1]
true
# Example 2
ghosts = [[1,0]], target = [2,0]
false
# Example 3
ghosts = [[2,0]], target = [1,0]
false
Constraints
Related LeetCode Problems
Practice more problems similar to Escape The Ghosts.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.