```\nif len(points) == 0:\n            return 0\n        points.sort(key=lambda x : x[1])\n        ans = 1\n        lst = points[0][1]\n        for pt in points:\n            if pt[0] <= lst:\n                continue\n            else:\n                ans += 1\n                lst = pt[1]\n        return ans\n```\ni first sorted the points based on there ending and then incremented the ans only when the point started after the lst

\nif len(points) == 0:\n            return 0\n        points.sort(key=lambda x : x[1])\n        ans = 1\n        lst = points[0][1]\n        for pt in points:\n