Question

Define a function typeHistogram that takes an iterator ""it"" (representing a sequence of values of different types) and builds a histogram showing how many values of each type appears in the next n elements in the sequence.

Answer 1

Answer:

def typeHistogram(it,n):

   d = dict()

   for i in it:

       n -=1

       if n>=0:

           if str(type(i).__name__) not in d.keys():

               d.setdefault(type(i).__name__,1)

           else:

               d[str(type(i).__name__)] += 1

       else:

           break

   return list(d.items())

it = iter([1,2,'a','b','c',4,5])

print(typeHistogram(it,7))

Explanation:

• Create a typeHistogram function that has 2 parameters namely "it" and "n" where "it" is an iterator used to represent a sequence of values of different types while "n" is the total number of elements in the sequence.
• Initialize an empty dictionary and loop through the iterator "it".
• Check if n is greater than 0 and current string is not present in the dictionary, then set default type as 1 otherwise increment by 1.
• At the end return the list of items.
• Finally initialize the iterator and display the histogram by calling the typeHistogram.