Tricky Part Explained 👻
Intuition\nYou want to reach target. A ghost can catch you there. So this question is basically asking if a ghost can reach the target before you. For that use 
# Intuition\nYou want to reach target. A ghost can catch you there. So this question is basically asking if a ghost can reach the target before you. For that use simple manhatten distance.\n\n# Complexity\n- Time complexity: `O(N)`, N = number of ghosts \uD83D\uDC7B\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: `O(1)`\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int me = manhatten(new int[] {0, 0}, target);\n        for (int[] ghost : ghosts) {\n            if (me >= manhatten(ghost, target)) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    private int manhatten(int[] mover, int[] target) {\n        return Math.abs(mover[0]-target[0]) + \n            Math.abs(mover[1]-target[1]);\n    }\n}\n```
['Java']