Anagrams and consecutive runs

Questions 1 to 5 of 8

1. 1. The countKey function from the lesson writes each letter that appears, then its count, then a comma. What key does it build for banana?

   aaabnna3b1n2a3,b1,n2,a3,b1,n2
2. 2. In the longest-run method, why does the loop skip a value x when x - 1 is in the set?

   Because x is a duplicate, and the set would count it twiceBecause x sits inside a longer run that starts lower down, and that run is walked from its own startBecause the walk upward from x always fails when x - 1 is presentBecause a hash set cannot hold two values that are next to each other
3. 3. Which pairs of words are anagrams of each other? Pick all that apply.

   Pick every answer that is true.

   tea and atebat and tanlisten and silentcat and tack
4. 4. Which statements about longestRun in the lesson's first example are true? Pick all that apply.

   Pick every answer that is true.

   It returns 0 for an empty list, because best starts at 0 and the loop never runsIf best started at 1, the empty list would return 1For the list 5, 5, 5 it returns 3, because it counts every value in the inputThe lookups counter goes up on every call to the has lambda
5. 5. What does this program print? ``cpp #include <algorithm> #include <iostream> #include <string> #include <unordered_map> #include <vector> using namespace std; int main() { unordered_map<string, vector<string>> groups; for (const string w : {"tea", "ate", "bat", "tab", "cat"}) { string key = w; sort(key.begin(), key.end()); groups[key].push_back(w); } cout << groups.size() << " " << groups["aet"].size() << " " << groups["abt"].back() << "\n"; } ``

   3 2 bat5 1 tab3 3 tab3 2 tab