There are $n$ people, represented by an integer $0$ to $n - 1$. You are given a $2$D array of strings watchedVideos where watchedVideos[i] is the list of videos watched by person i, and a $2$D array of integers friends where friends[i] contains the IDs of the direct friends of person i.

Friendship is mutual, meaning if person i is friends with person j, then person j is friends with person i.

Given an integer id representing your person ID and an integer level, determine the list of videos watched by all people whose shortest distance to you in the friendship network is exactly equal to level.

Return the list of videos sorted by their total view frequency in ascending order. If multiple videos have the same frequency, sort them in lexicographical order.

Constraints:

• n $==$ watchedVideos.length $==$ friends.length

• $2 \leq n \leq 100$

• $1 \leq$ watchedVideos[i].length $\leq 100$

• $1 \leq$ watchedVideos[i][j].length $\leq 8$

• $0 \leq$ friends[i].length $< n$

• $0 \leq$ friends[i][j] $< n$

• $0 \leq$ id $< n$

• $1 \leq$ level $< n$

• If friends[i] contains j, then friends[j] contains i.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.