100% beats java solution
Intuition\nAll you have to do is check who will get there faster.\nSince we can only go 4 directions use basic city distance formula , instead of sqrt one.\n\n#
# Intuition\nAll you have to do is check who will get there faster.\nSince we can only go 4 directions use basic city distance formula , instead of sqrt one.\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean escapeGhosts(int[][] g, int[] target) {\n        int n = g.length;\n        int d = Math.abs(target[0])  + Math.abs(target[1]);\n        for(int i = 0;i<n;i++){\n            int gd = Math.abs(target[0] - g[i][0]) + Math.abs(target[1]-g[i][1]);\n            if(gd<=d) return false; \n        }\n        return true;\n    }\n}\n```
['Java']