Your average programmers solution
IntuitionMy intuition told me to convert them to Vector2s and calculate the distance to target for each ghost and compare to my distance to the target.ApproachM
# Intuition
My intuition told me to convert them to Vector2s and calculate the distance to target for each ghost and compare to my distance to the target.

# Approach
My approach involves calculating the Manahattan Distance. Which is the distance on a 2D grid from one point to another. This is because we can only move North, South, East, and West.

# Complexity
- Time complexity:
O(n)

- Space complexity:
idk O(n)?

# Code
```csharp []
public class Solution {
    public bool EscapeGhosts(int[][] ghosts, int[] target) {
        //value we will return
        bool canReach = true;
        //starting position
        int[] startPos = {0,0};
       
        //my ManahattanDistance to target
        float myDistanceToTarget = ManhattanDistance(target, startPos);

        for(int i=0; i<=ghosts.Length-1;i++){
            //ghost manhattandistance to target
            float ghostDistanceToTarget = ManhattanDistance(target, ghosts[i]);

            //is their distance less than or equal to mine?
            if(ghostDistanceToTarget <= myDistanceToTarget){
                canReach = false;
                break;
            }
        }
        return canReach;
    }
    
    private float ManhattanDistance(int[] v1, int[] v2){
         return Math.Abs(v1[0] - v2[0]) + Math.Abs(v1[1] - v2[1]);
    }
}
```
['C#']