Java | 0 ms | Faster than 100% | Easy solution
\n\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int X_diff, Y_diff, minGhostDistanceFromTarge = Integer.MAX_VALUE;\n        int dis
\n\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int X_diff, Y_diff, minGhostDistanceFromTarge = Integer.MAX_VALUE;\n        int distanceFromTarget = Math.abs(target[0]) + Math.abs(target[1]);\n\n        for (int[] ghost : ghosts) {\n            X_diff = Math.max(target[0], ghost[0]) - Math.min(target[0], ghost[0]);\n            Y_diff = Math.max(target[1], ghost[1]) - Math.min(target[1], ghost[1]);\n\n            if (minGhostDistanceFromTarge > X_diff + Y_diff) {\n                minGhostDistanceFromTarge = X_diff + Y_diff;\n            }\n        }\n\n        if (distanceFromTarget < minGhostDistanceFromTarge) {\n            return true;\n        }\n\n        return false;\n    }\n
['Java']