Easy Python Solution
```\nclass Solution:\n    def maximumUniqueSubarray(self, nums: List[int]) -> int:\n        s = set()\n        sum1 = 0\n        start = 0\n        m = 0\n     
```\nclass Solution:\n    def maximumUniqueSubarray(self, nums: List[int]) -> int:\n        s = set()\n        sum1 = 0\n        start = 0\n        m = 0\n        for i in range(len(nums)):\n            while nums[i] in s:\n                s.remove(nums[start])\n                sum1 -= nums[start]\n                start += 1\n            s.add(nums[i])\n            sum1 += nums[i]\n            m = max(m,sum1)\n        return m
['Python']