Is there an O(n) solution to this problem I just got? I made an O(n^2) solution and timed out.\n\nGiven an array of integers, count the number of contiguous subarrays where each element in the subarray appears 2 or more times.\n```\n[0, 0, 0] -> 3\n[1, 2, 1, 2, 3] -> 1\n```\n\nMaybe some sort of DP? I just don\'t know how to get it without nested loops

Is there an O(n) solution to this problem I just got? I made an O(n^2) solution and timed out.\n\nGiven an array of integers, count the number of contiguous sub