Get Watched Videos by Your Friends
There are n people, each person has a unique id between 0 and n - 1. Given the arrays watchedVideos and friends, where watchedVideos[i] and friends[i] contain the list of watched videos and the list of friends respectively for the person with id = i.
Level 1 of videos are all watched videos by your friends, level 2 of videos are all watched videos by the friends of your friends and so on. In general, the level k of videos are all watched videos by people with the shortest path exactly equal to k with you.
Given your id and the level of videos, return the list of videos ordered by their frequencies in increasing order. For videos with the same frequency, order them alphabetically from least to greatest.
Example 1
Input
watchedVideos = [["A","B"],["C"],["B","C"],["D"]], friends = [[1,2],[0,3],[0,3],[1,2]], id = 0, level = 1Output
["B","C"]Your level-1 friends are people 1 and 2, whose watched videos have frequencies B -> 1 and C -> 2, so the videos are ordered as ["B", "C"].
Example 2
Input
watchedVideos = [["A","B"],["C"],["B","C"],["D"]], friends = [[1,2],[0,3],[0,3],[1,2]], id = 0, level = 2Output
["D"]The only person at level 2 from id 0 is person 3, who watched "D".
Constraints
- n == watchedVideos.length == friends.length
- 2 <= n <= 100
- 1 <= watchedVideos[i].length <= 100
- 1 <= watchedVideos[i][j].length <= 8
- 0 <= friends[i].length < n
- 0 <= friends[i][j] < n
- 0 <= id < n
- 1 <= level < n
- if friends[i] contains j, then friends[j] contains i