O(N) || BEATS 100% || 8 LINES || Concise & Readable!
Please upvote!\nThe idea is that we only need to include the elements between start and end, or the elements outside start and end.\n\nclass Solution {\npublic:
**Please upvote!**\nThe idea is that we only need to include the elements between `start` and `end`, or the elements outside `start` and `end`.\n```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        vector<int> ans;\n        for (int i = 1; i <= n; i++) {\n            int start = rounds.front(), end = rounds.back();\n            if ((start <= end && start <= i && i <= end) ||\n                (start > end && (start <= i || i <= end)))\n                ans.push_back(i);\n        }\n        return ans;\n    }\n};\n```\n**Please upvote!**
['C']