C++ Simple Solution Similar to minimum time visiting all points
https://leetcode.com/problems/minimum-time-visiting-all-points/\nDo this before attempting it\n\n\tclass Solution {\npublic:\n    bool escapeGhosts(vector<vecto
https://leetcode.com/problems/minimum-time-visiting-all-points/\nDo this before attempting it\n```\n\tclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n        int out=abs(target[0]-0)+abs(target[1]-0);\n        int res=INT_MAX;\n        for(int i=0;i<ghosts.size();i++){\n            res=min(res,abs(target[0]-ghosts[i][0])+abs(target[1]-ghosts[i][1]));\n        }\n        if(res<=out){\n            return false;\n        }\n        return true;\n    }\n};\n```
[]