human
Count of subarrays with X as the most frequent element , for each value of X from 1 to N | Function to calculate the number of subarrays where X ( 1 <= X <= N ) is the most frequent element.
array to store the final answers.
Array to store current frequencies.
Variable to store the current most frequent element.
Update frequency array.
Update answer.
Pranswer.
Driver code.
Input.
Function call"
Solution in Python:
 Give me a code to count of subarrays with X as the most frequent element , for each value of X from 1 to N and the other steps required?
assistant
#Here is code to count of subarrays with X as the most frequent element , for each value of X from 1 to N and the other steps required.
 def mostFrequent ( arr , N ) :
	ans = [ 0 ] * N
	for i in range ( N ) :
		count = [ 0 ] * N
		best = 0
		for j in range ( i , N ) :
			count [ arr [ j ] - 1 ] += 1
			if ( count [ arr [ j ] - 1 ] > count [ best - 1 ] or ( count [ arr [ j ] - 1 ] == count [ best - 1 ] and arr [ j ] < best ) ) :
				best = arr [ j ]
			ans [ best - 1 ] += 1
	print ( * ans )
if __name__ == ' _ _ main _ _ ' :
	arr = [ 2 , 1 , 2 , 3 ]
	N = len ( arr )
	mostFrequent ( arr , N )