Questions from this loop
Round 1 Two algorithmic tasks were covered: Finding the top K most frequent elements from an in