4 step Simple easy Solution | brute force 4ms
-find no. of steps we need to reach target\n-then count each ghost steps\n-then store min ghost step value \n-if minimum ghost step value is less than target st
-find no. of steps we need to reach target\n-then count each ghost steps\n-then store min ghost step value \n-if minimum ghost step value is less than target step value return false else return true\n\n# Code\n```\nclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n        //no. of steps we need to reach target\n        int tSteps=abs(target[0])+abs(target[1]);\n     \n        int gMax=abs(ghosts[0][0]-target[0])+abs(ghosts[0][1]-target[1]);\n        \n        \n        for(int i=0;i<ghosts.size();i++){\n            //counting each ghost steps\n            int gStep=abs(ghosts[i][0]-target[0])+abs(ghosts[i][1]-target[1]);\n\n            if(gStep<gMax){\n                gMax=gStep;//storing min ghost step value\n            }\n        }\n      \n        if(gMax>tSteps){\n            return true;\n        }\n        return false;\n    }\n};\n```\n\nPLZZ UPVOTE IF U FOUND IT HELPFUL
['Array', 'Math', 'C++']