Activity: Frequency count

Graded Playground Autograder

This is due on Tuesday, January $30,2024$ at $23$:$59$ CST

You have not attempted this activity. You currently have $0\%$ for this activity.

In this question, you will count how often specific numbers appear in a $2$D vector and store that information in a map. Your solution will require the application of multiple lesson topics you have seen so far!

You will finish implementing the function FrequencyCount. This function takes in a $2$D vector of ints called data$\_$set and a vector of specific numbers to count in that $2$D vector called numbers$\_$of$\_$interest $.$ This function returns a map where the keys are the specific numbers and values are those specific number's counts.

std::map FrequencyCount$($

const std::vector$>$& data$\_$set,

const std::vector& numbers$\_$of$\_$interest$)$;

Example

std::vector$>$ data$\_$set$\{$

$\{1,2,4,7\},\{4,-1\}\}$; $//$ declares $+$ initializes a non$-$rectangular $2$D vector of ints

std::vector numbers$\_$of$\_$interest$\{$

$4,7,11\}$; $//$ declares $+$ initializes a vector of ints

The function, given the above inputs, should return a map that looks like:

$\{\{4,2\},\{7,1\},\{11,0\}\}$

where each tuple $($i$.$e$.,\{4,2\})$ is a $\{$key$,$ value$\}$ pair. So given the entry $\{4,2\},4$ maps to $2.$ In the context of this problem, that means that $4$ was counted $2$ times in the data set!

Things to Note

There will be no duplicate values in numbers$\_$of$\_$interest.

data$\_$set does NOT have to be rectangular $($see example above$).$

Helpful Tips

Here is some code reminding you how to interact with a $2$D vector: