📌 c++ solution ✔
\nclass Solution {\npublic:\n    string destCity(vector<vector<string>>& p) {\n        set<string> s;\n\t\t// set for "to" cities\n        for(auto &x:p)s.inser
```\nclass Solution {\npublic:\n    string destCity(vector<vector<string>>& p) {\n        set<string> s;\n\t\t// set for "to" cities\n        for(auto &x:p)s.insert(x[1]);  // x= {from city, to city}\n\t\t// erasing "from" cities\n        for(auto &x:p)s.erase(x[0]);\n        return *s.begin();\n    }\n};\n```
['C', 'Ordered Set', 'C++']