✅ 🔥 One line  Python || ⚡very easy solution
\n\nclass Solution:\n    def nearestValidPoint(self, x: int, y: int, points: List[List[int]]) -> int:\n        return min([(abs(p[0]-x)+abs(p[1]-y), i) for i, p
\n```\nclass Solution:\n    def nearestValidPoint(self, x: int, y: int, points: List[List[int]]) -> int:\n        return min([(abs(p[0]-x)+abs(p[1]-y), i) for i, p in enumerate(points) if p[0]==x or p[1]==y], default=(-1, -1))[1]\n\n```
['Python', 'Python3', 'Python ML']