Easy Solution , Beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \nThink of finding the minimum distance between the target and (you and ghost)\n# Approac
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nThink of finding the minimum distance between the target and (you and ghost)\n# Approach\n<!-- Describe your approach to solving the problem. -->\nIn this approach find the minimum distance between target and you and then with ghost. And if ghost reaches before or same time at target then you lose, otherwise youb are able to escape.\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(N)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int distance = Math.abs(0-target[0])+Math.abs(0-target[1]);\n        for(int i=0;i<ghosts.length;i++)\n        {\n            int d = Math.abs(ghosts[i][0]-target[0])+Math.abs(ghosts[i][1]-target[1]);\n            if(d<=distance)\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Java']