C++ || Simple approach || Easy to understand || unordered map
\n   string destCity(vector<vector<string>>& paths) {\n        unordered_map<string,string>um;\n        for(int i=0;i<paths.size();i++){\n            um[paths[i
```\n   string destCity(vector<vector<string>>& paths) {\n        unordered_map<string,string>um;\n        for(int i=0;i<paths.size();i++){\n            um[paths[i][0]]=paths[i][1];\n        }\n        for(auto itr=um.begin();itr!=um.end();itr++){\n            if(um.count(itr->second)>0)continue;\n            else return itr->second;\n        }\n        return "";\n    }\n\t```
['C']