I need an algorithm to do the following:
- n youtube video id
- m the depth of related videos max 3, we will take the entered video id then we will get its related then for each related we will take the related with max m repeat, for each video from n we will get only one list of related video (we should group them in one list)
- q related list size (for example 10) when we get related list, we only want top q videos from the list
Junction of the final lists between n video related videos
Script should be written in php, with best time complexity and integration with standard youtube APIs
6 freelancer đang chào giá trung bình $173 cho công việc này
Hello. I have read your project description and I can provide you the PHP script. Please feel free to ping me anytime so we can have a detailed discussion.