Very Simple || 100% beats || Math || Java
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nUsing Math.abs() first 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nUsing Math.abs() first calculate min step to reach at target from origin and store it in **"diff"** variable and as same as we did earlier now calculate minimum step to reach at traget but now from each ghost and at run time compare this difference with **"diff"** and if diff is greater than that one then return false else true;\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 diff = Math.abs(0-target[0]) + Math.abs(0-target[1]);\n        for(int[] g : ghosts){\n            int gtd = Math.abs(target[0]-g[0])+Math.abs(target[1]-g[1]);\n            if(gtd<=diff) return false;\n        }\n        return true;\n    }\n}\n```
['Math', 'Java']