C++ ||  Faster than 88.17% explained
Simple idea is to iterate over ghosts array and calculate the distance between ghost and target. Do the same for Pacman. Check for each iteration if Pacman dist
Simple idea is to iterate over ghosts array and calculate the distance between ghost and target. Do the same for Pacman. Check for each iteration if Pacman distance is greater or equal, then ghost can reach Pacman else pacman is safe.\n\nPS - One important thing to note is that while calculating distance we need not to calculate hypotenuse distance but the distance of base and height combined as we are playing a 2D game.\n\n```\nclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& a, vector<int>& k) {\n        int n = a.size(), pacman = abs(k[0]) + abs(k[1]);\n        for(int i=0; i<n; ++i) {\n            int ghost = abs(k[0] - a[i][0]) + abs(k[1] - a[i][1]);\n            if(ghost <= pacman) return false;\n        }\n        return true;\n    }\n};\n```
[]