C# Solution | HashSet | Sliding Window | O(N)
\npublic int MaximumUniqueSubarray(int[] nums) {\n        int start = 0;\n        int end = 0;\n        int maxScore = 0;\n        int score = 0;\n        var h
```\npublic int MaximumUniqueSubarray(int[] nums) {\n        int start = 0;\n        int end = 0;\n        int maxScore = 0;\n        int score = 0;\n        var hashSet = new HashSet<int>();\n        \n        while(end < nums.Length){\n            if(hashSet.Contains(nums[end])){\n                score = score-nums[start];\n                hashSet.Remove(nums[start++]);\n            }\n            else{\n                score += nums[end];\n                hashSet.Add(nums[end++]);\n            }\n            \n            maxScore = Math.Max(maxScore, score);\n        }\n        \n        return maxScore;\n    }\n```\n\nPlease upvote if you like the solution.\n\nImprovements/Suggestions are most welcome.\n\nHappy Coding :)
['C', 'Sliding Window', 'C#']