Sparse Table Algorithm Range Minimum Query

array(10) { [0]=> object(stdClass)#5262 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "ZBHKZF5w4YU" ["related_video_title"]=> string(32) "Segment Tree Range Minimum Query" ["posted_time"]=> string(20) "10 лет назад" ["channelName"]=> string(31) "Tushar Roy - Coding Made Simple" } [1]=> object(stdClass)#5235 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "0jWeUdxrGm4" ["related_video_title"]=> string(44) "Sparse Table & RMQ (Range Minimum Query)" ["posted_time"]=> string(21) "4 года назад" ["channelName"]=> string(19) "Errichto Algorithms" } [2]=> object(stdClass)#5260 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "LPFhl65R7ww" ["related_video_title"]=> string(63) "Binary Search : Median of two sorted arrays of different sizes." ["posted_time"]=> string(19) "7 лет назад" ["channelName"]=> string(31) "Tushar Roy - Coding Made Simple" } [3]=> object(stdClass)#5267 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "uUatD9AudXo" ["related_video_title"]=> string(27) "Sparse Table Data Structure" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(12) "WilliamFiset" } [4]=> object(stdClass)#5246 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "wGXB9OWhPTg" ["related_video_title"]=> string(29) "Morris Inorder Tree Traversal" ["posted_time"]=> string(19) "9 лет назад" ["channelName"]=> string(31) "Tushar Roy - Coding Made Simple" } [5]=> object(stdClass)#5264 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "CkeevFkVntQ" ["related_video_title"]=> string(141) "МНЕ СТЫДНО. №16 НЕЛЬЗЯ РЕШАТЬ lru_cache/setrecursionlimit. Разбор №16 через словари (списки)" ["posted_time"]=> string(23) "1 месяц назад" ["channelName"]=> string(29) "Информатик Родя" } [6]=> object(stdClass)#5259 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "13m9ZCB8gjw" ["related_video_title"]=> string(34) "Lowest Common Ancestor Binary Tree" ["posted_time"]=> string(19) "9 лет назад" ["channelName"]=> string(31) "Tushar Roy - Coding Made Simple" } [7]=> object(stdClass)#5269 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "2X1iIrjz7ug" ["related_video_title"]=> string(67) "Президент сбежал / Столица атакована" ["posted_time"]=> string(24) "10 часов назад" ["channelName"]=> string(10) "NEXTA Live" } [8]=> object(stdClass)#5245 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "l3hda49XcDE" ["related_video_title"]=> string(38) "Regular Expression Dynamic Programming" ["posted_time"]=> string(19) "9 лет назад" ["channelName"]=> string(31) "Tushar Roy - Coding Made Simple" } [9]=> object(stdClass)#5263 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "xztU7lmDLv8" ["related_video_title"]=> string(64) "Segment Tree Data Structure - Min Max Queries - Java source code" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(11) "Stable Sort" } }