Problem Recap:
You are given an integer n
representing the length of an array, followed by the array itself, and an integer k
. The array consists of integers where each integer is between 0
and k−1
(inclusive). Your task is to create an accumulated count array from the given array. The accumulated count array at index i
should contain the sum of counts from index 0
to i
of the count array.
Approach:
The problem can be broken down into three main steps:

Counting Occurrences:
We first need to determine the frequency of each integer in the given array. This is achieved by using acount
array of sizek
, where each index corresponds to the integers from0
tok1
. We iterate through the input array and increment the corresponding index in thecount
array for each integer encountered. 
Accumulating Counts:
Once we have the frequency of each integer, we need to create the accumulated count array. The accumulated count at indexi
is simply the sum of the counts from index0
toi
. This can be efficiently calculated by iterating through thecount
array and maintaining a running sum. 
Output the Result:
Finally, the accumulated count array is printed as the result.
Complexity Analysis:
 Time Complexity: The algorithm runs in
O(n + k)
time, wheren
is the length of the array andk
is the range of the elements. Counting the occurrences takesO(n)
time, and calculating the accumulated count takesO(k)
time.  Space Complexity: The space complexity is
O(k)
, primarily due to thecount
andaccumulated_count
arrays.