using Manhattan distance EASY ....with comments
\n# Code\ncpp []\nclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n         // Calculate Manhattan distance
\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n         // Calculate Manhattan distance from the start (0,0) to the target\n        int playerDist = abs(target[0]) + abs(target[1]);\n        \n        // Check if any ghost can reach the target faster or at the same time\n        for (auto& ghost : ghosts) {\n            int ghostDist = abs(target[0] - ghost[0]) + abs(target[1] - ghost[1]);\n            if (ghostDist <= playerDist) {\n                return false; // A ghost can catch the player or reach the target first\n            }\n        }\n        \n        return true; // Player can escape\n    }\n};\n```\n\n\n![57jfh9.jpg](https://assets.leetcode.com/users/images/7a16442f-4092-40bd-a0e9-90cb359d2d24_1729280452.1793582.jpeg)\n
['C++']