100% beat sliding window concept
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    int maximumUniqueSubarray(vector<int>& nums) {\n        unordered_map<int, int> mp;\n        int sum = 0;\n        int maxi = 0;\n        int start = 0; \n        for (int i = 0; i < nums.size(); i++) {\n            mp[nums[i]]++;\n            sum = sum + nums[i];\n            while (mp[nums[i]] > 1) {\n                mp[nums[start]]--;\n                sum = sum - nums[start];\n                start++;\n            }\n            maxi = max(maxi, sum);\n        }\n        return maxi;\n    }\n};\n\n```
['Array', 'Hash Table', 'Sliding Window', 'C++']