Lecture-11 | 1311. Get Watched Videos by Your Friends | Graphs | Leetcode | DSA | Hindi
Problem Name:
1311. Get Watched Videos by Your Friends
Problem Statement:
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 (increasing). For videos with the same frequency order them alphabetically from least to greatest.
Problem Link:
https://leetcode.com/problems/get-wat...
Graph Playlist:
• Graph Data Structure Series
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Playlist : Online...
Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...
Notes:
https://github.com/Tiwarishashwat/Jav...
Telegram Link:
https://shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Recursion and Backtracking Ultimate S...
Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SRIB Interview Ex...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding #problemsolving