Simple C++ code using maps
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string destCity(vector<vector<string>>& paths) {\n        string ans;\n        unordered_map<string, int> m;\n        for(int i=0; i<paths.size(); i++){\n            m[paths[i][0]]++;\n            m[paths[i][1]]--;\n        }\n        for(auto city : m){\n            if(city.second == -1) ans = city.first;\n        }\n\n        return ans;\n    }\n};\n```
['C++']