easy solution -beats 100%
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:$$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\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\n        string destCity = paths[0][1] ;\n        for ( int i = 0 ; i < paths.size() ; i++ ) {\n\n            if ( paths[i][0] == destCity ) {\n                destCity = paths[i][1] ;\n                i = 0 ;\n            }\n        }\n         return destCity ;\n    }\n};\n```
['C++']