4 lines of code | Java | 0ms | Faster than 100% | Easy solution
\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int targetdistance=Math.abs(target[0])+Math.abs(target[1]);\n      
```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int targetdistance=Math.abs(target[0])+Math.abs(target[1]);\n        //if ghost is already or can come in b/w source and target then false\n        //else true\n        for(int [] val:ghosts)\n            if(Math.abs(val[0]-target[0])+Math.abs(val[1]-target[1])<=targetdistance) return false;\n\t\t\t\n        return true;\n    }\n}\n```
[]