LeetCode

array(10) { [0]=> object(stdClass)#4988 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "o2LEC2NEVuk" ["related_video_title"]=> string(94) "Maximum Depth of Binary Tree (LeetCode 104) | Full Solution with animations | Study Algorithms" ["posted_time"]=> string(21) "2 года назад" ["channelName"]=> string(12) "Nikhil Lohia" } [1]=> object(stdClass)#4961 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "ngCos392W4w" ["related_video_title"]=> string(48) "5 Simple Steps for Solving Any Recursive Problem" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(9) "Reducible" } [2]=> object(stdClass)#4986 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "hTM3phVI6YQ" ["related_video_title"]=> string(66) "Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python" ["posted_time"]=> string(21) "4 года назад" ["channelName"]=> string(8) "NeetCode" } [3]=> object(stdClass)#4993 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "YT1994beXn0" ["related_video_title"]=> string(54) "Finding the Maximum Depth of a Binary Tree (Recursion)" ["posted_time"]=> string(19) "8 лет назад" ["channelName"]=> string(15) "Stephen O'Neill" } [4]=> object(stdClass)#4972 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "DjYZk8nrXVY" ["related_video_title"]=> string(51) "LeetCode was HARD until I Learned these 15 Patterns" ["posted_time"]=> string(28) "10 месяцев назад" ["channelName"]=> string(19) "Ashish Pratap Singh" } [5]=> object(stdClass)#4990 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "0iDiUuHZE_g" ["related_video_title"]=> string(72) "LeetCode #28: Find Index of First Occurrence in a String | KMP Algorithm" ["posted_time"]=> string(19) "1 год назад" ["channelName"]=> string(11) "Algo Engine" } [6]=> object(stdClass)#4985 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "D2cFSDfg0So" ["related_video_title"]=> string(28) "Maximum Depth of Binary Tree" ["posted_time"]=> string(19) "6 лет назад" ["channelName"]=> string(18) "Kevin Naughton Jr." } [7]=> object(stdClass)#4995 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "blWdjRUPP6E" ["related_video_title"]=> string(72) "Разведчик о том, как использовать людей" ["posted_time"]=> string(25) "3 недели назад" ["channelName"]=> string(18) "Коллектив" } [8]=> object(stdClass)#4971 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "OIZAbldPBcI" ["related_video_title"]=> string(42) "Долгожданный МИР. Или..." ["posted_time"]=> string(23) "9 часов назад" ["channelName"]=> string(27) "Анатолий Шарий" } [9]=> object(stdClass)#4989 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "g_S5WuasWUE" ["related_video_title"]=> string(80) "Iterative & Recursive - Binary Tree Inorder Traversal - Leetcode 94 - Python" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(8) "NeetCode" } }