C++ | CPP | Simple Solution
\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        vector<int> result;\n        vector<int> track(n+1);\n        \n
```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        vector<int> result;\n        vector<int> track(n+1);\n        \n        int start = 1;\n        while(start <= rounds.back()) track[start++]++;\n        \n        start = rounds[0];\n        while(start <= n) track[start++]++;\n        \n        int maxVal = 0;\n        for(int num: track) maxVal = max(maxVal, num);\n        \n        for(int i = 1; i < track.size(); i++) {\n            if(track[i] == maxVal) result.push_back(i);\n        }\n        \n        return result;\n    }\n};\n```
['C', 'C++']