[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"channel-series-mit-ocw-6-006-algorithms":3,"channel-library-index":256},{"channel":4,"series":9,"stats":18,"episodes":25},{"slug":5,"title":6,"author":7,"platform_channel_id":8},"mit-ocw","MIT OpenCourseWare","MIT","UCEBb1b_L6zDS3xTUrIALZOw",{"slug":10,"title":11,"short_title":12,"description":13,"source":14,"sort_order":15,"index":15,"total_series":16,"source_playlist_id":17},"6-006-algorithms","6.006 Introduction to Algorithms","6.006 Algorithms","Erik Demaine, Jason Ku and Justin Solomon: data structures, sorting, graphs, dynamic programming and complexity, with problem sessions and quiz reviews. Spring 2020.","curated",2,10,"PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY",{"count":19,"transcribed":20,"duration_seconds":21,"view_count":22,"chapters":23,"first_published_at":24,"last_published_at":24},32,1,3523,81070,7,"2021-09-13T00:00:00",[26,34,39,45,51,57,63,68,74,80,85,91,97,103,109,115,121,127,133,139,145,151,157,163,209,215,221,227,233,239,245,251],{"position":20,"platform_video_id":27,"episode_label":28,"display_title":29,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":33},"ZA-tUyM_y7s","Lec 1","Algorithms and Computation",null,false,0,[],{"position":15,"platform_video_id":35,"episode_label":36,"display_title":37,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":38},"CHhwJjR0mZA","Lec 2","Data Structures and Dynamic Arrays",[],{"position":40,"platform_video_id":41,"episode_label":42,"display_title":43,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":44},3,"IPSaG9RRc-k","PS1","Asymptotic Behavior of Functions and Double-ended",[],{"position":46,"platform_video_id":47,"episode_label":48,"display_title":49,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":50},4,"oS9aPzUNG-s","Lec 3","Sets and Sorting",[],{"position":52,"platform_video_id":53,"episode_label":54,"display_title":55,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":56},5,"Nu8YGneFCWE","Lec 4","Hashing",[],{"position":58,"platform_video_id":59,"episode_label":60,"display_title":61,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":62},6,"KlQiwkhLBg0","PS2","Problem Session 2",[],{"position":23,"platform_video_id":64,"episode_label":65,"display_title":66,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":67},"yndgIDO0zQQ","Lec 5","Linear Sorting",[],{"position":69,"platform_video_id":70,"episode_label":71,"display_title":72,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":73},8,"g0bXSXuLVb0","PS3","Problem Session 3",[],{"position":75,"platform_video_id":76,"episode_label":77,"display_title":78,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":79},9,"76dhtgZt38A","Lec 6","Binary Trees, Part 1",[],{"position":16,"platform_video_id":81,"episode_label":82,"display_title":83,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":84},"U1JYwHcFfso","Lec 7","Binary Trees, Part 2: AVL",[],{"position":86,"platform_video_id":87,"episode_label":88,"display_title":89,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":90},11,"MAyraVVYB64","PS4","Problem Session 4",[],{"position":92,"platform_video_id":93,"episode_label":94,"display_title":95,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":96},12,"Xnpo1atN-Iw","Lec 8","Binary Heaps",[],{"position":98,"platform_video_id":99,"episode_label":100,"display_title":101,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":102},13,"oFVYVzlvk9c","Lec 9","Breadth-First Search",[],{"position":104,"platform_video_id":105,"episode_label":106,"display_title":107,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":108},14,"e98MPnMHLxE","Quiz 1","Quiz 1 review",[],{"position":110,"platform_video_id":111,"episode_label":112,"display_title":113,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":114},15,"IBfWDYSffUU","Lec 10","Depth-First Search",[],{"position":116,"platform_video_id":117,"episode_label":118,"display_title":119,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":120},16,"5cF5Bgv59Sc","Lec 11","Weighted Shortest Paths",[],{"position":122,"platform_video_id":123,"episode_label":124,"display_title":125,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":126},17,"ZLdooNwP7Pw","PS5","Problem Session 5",[],{"position":128,"platform_video_id":129,"episode_label":130,"display_title":131,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":132},18,"f9cVS_URPc0","Lec 12","Bellman-Ford",[],{"position":134,"platform_video_id":135,"episode_label":136,"display_title":137,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":138},19,"NSHizBK9JD8","Lec 13","Dijkstra",[],{"position":140,"platform_video_id":141,"episode_label":142,"display_title":143,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":144},20,"Md9QOXomxFs","PS7","Problem Session 7",[],{"position":146,"platform_video_id":147,"episode_label":148,"display_title":149,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":150},21,"EmSmaW-ud6A","Lec 14","APSP and Johnson",[],{"position":152,"platform_video_id":153,"episode_label":154,"display_title":155,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":156},22,"vCIa2h1C9UQ","Quiz 2","Quiz 2 Review",[],{"position":158,"platform_video_id":159,"episode_label":160,"display_title":161,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":162},23,"r4-cftqTcdI","Lec 15","Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling",[],{"position":164,"platform_video_id":165,"episode_label":166,"display_title":167,"place":30,"title":168,"transcribed":169,"transcribed_at":170,"published_at":24,"duration":21,"view_count":22,"thumbnail_url":171,"description":172,"chapter_count":23,"chapters":173},24,"KLBCUx1is2c","Lec 16","Dynamic Programming, Part 2: LCS, LIS, Coins","16. Dynamic Programming, Part 2: LCS, LIS, Coins",true,"2026-10-19T10:00:53.370352","https:\u002F\u002Fi.ytimg.com\u002Fvi\u002FKLBCUx1is2c\u002Fsddefault.jpg?sqp=-oaymwEmCIAFEOAD8quKqQMa8AEB-AH-DoACuAiKAgwIABABGGAgYChgMA8=&rs=AOn4CLBRUNNGN1m7qPv9MTmhIuP-aKqbdg","MIT 6.006 Introduction to Algorithms, Spring 2020\nInstructor: Erik Demaine\nView the complete course: https:\u002F\u002Focw.mit.edu\u002F6-006S20\nYouTube Playlist: https:\u002F\u002Fwww.youtube.com\u002Fplaylist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY",[174,179,184,189,194,199,204],{"title":175,"summary":176,"start":177,"end":178},"Dynamic Programming and Sortbot Framework Review","Recap of dynamic programming components: subproblem decomposition, recurrence relations, topological ordering, base cases, and the overall sortbot paradigm.",12960,235490,{"title":180,"summary":181,"start":182,"end":183},"Longest Common Subsequence Problem Formulation","Defines the longest common subsequence problem and constructs subproblems as pairs of suffixes using the cross-product approach.",237970,566830,{"title":185,"summary":186,"start":187,"end":188},"LCS Recurrence, Topological Order, Example","Derives the LCS recurrence for equal and unequal cases, explains base cases and topological order, analyzes time complexity, and illustrates with a grid-based example and parent pointers.",566910,1305750,{"title":190,"summary":191,"start":192,"end":193},"LIS Problem, Constraint Introduction, Tweaks","Introduces the longest increasing subsequence problem, explores naive subproblem formulation failure, and adds a subproblem constraint to ensure the sequence starts at a specified index.",1306870,1720200,{"title":195,"summary":196,"start":197,"end":198},"LIS Recurrence, Complexity, Graph Analogy","Develops the LIS recurrence with constrained subproblems, analyzes quadratic time complexity, and shows equivalence to finding longest paths in a DAG via shortest-path transformation.",1720950,2563880,{"title":200,"summary":201,"start":202,"end":203},"Alternating Coin Game Subproblem Definition","Presents the alternating coin game rules, defines substrings as subproblems, and adds a player-turn parameter for a zero-sum analysis.",2565400,2967160,{"title":205,"summary":206,"start":207,"end":208},"Coin Game Recurrence, Example, Conclusion","Derives the two-player recurrence using max-min for me and opponent turns, fills base cases and topological order, shows an example with parent pointers, and concludes with subproblem expansion insight.",2968280,3515530,{"position":210,"platform_video_id":211,"episode_label":212,"display_title":213,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":214},25,"UuxR0NCkg0k","PS8","Problem Session 8",[],{"position":216,"platform_video_id":217,"episode_label":218,"display_title":219,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":220},26,"TDo3r5M1LNo","Lec 17","Dynamic Programming, Part 3: APSP, Parens, Piano",[],{"position":222,"platform_video_id":223,"episode_label":224,"display_title":225,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":226},27,"i9OAOk0CUQE","Lec 18","Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial",[],{"position":228,"platform_video_id":229,"episode_label":230,"display_title":231,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":232},28,"JbafQJx1CIA","Lec 19","Complexity",[],{"position":234,"platform_video_id":235,"episode_label":236,"display_title":237,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":238},29,"KPkOkiwAlbY","PS9","Problem Session 9",[],{"position":240,"platform_video_id":241,"episode_label":242,"display_title":243,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":244},30,"wEKFGdo4Sck","Quiz 3","Quiz 3 Review",[],{"position":246,"platform_video_id":247,"episode_label":248,"display_title":249,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":250},31,"2NMtS1ecb3o","Lec 20","Course Review",[],{"position":19,"platform_video_id":252,"episode_label":253,"display_title":254,"place":30,"title":30,"transcribed":31,"transcribed_at":30,"published_at":30,"duration":30,"view_count":30,"thumbnail_url":30,"description":30,"chapter_count":32,"chapters":255},"4nXw-f6NJ9s","Lec 21","Algorithms—Next Steps",[],[257,303],{"slug":5,"title":6,"href":258,"seriesCount":16,"videos":259,"transcribed":40,"series":260},"\u002Fchannel\u002Fmit-ocw",315,[261,266,268,273,277,282,287,291,295,299],{"slug":262,"title":263,"href":264,"count":265,"transcribed":32},"6-0001-python","6.0001 Introduction to Computer Science and Programming in Python","\u002Fchannel\u002Fmit-ocw\u002F6-0001-python",38,{"slug":10,"title":11,"href":267,"count":19,"transcribed":20},"\u002Fchannel\u002Fmit-ocw\u002F6-006-algorithms",{"slug":269,"title":270,"href":271,"count":272,"transcribed":32},"6-046j-algorithm-design","6.046J Design and Analysis of Algorithms","\u002Fchannel\u002Fmit-ocw\u002F6-046j-algorithm-design",34,{"slug":274,"title":275,"href":276,"count":240,"transcribed":32},"6-034-ai","6.034 Artificial Intelligence","\u002Fchannel\u002Fmit-ocw\u002F6-034-ai",{"slug":278,"title":279,"href":280,"count":281,"transcribed":32},"18-01-calculus","18.01 Single Variable Calculus","\u002Fchannel\u002Fmit-ocw\u002F18-01-calculus",35,{"slug":283,"title":284,"href":285,"count":286,"transcribed":32},"18-06-linear-algebra","18.06 Linear Algebra","\u002Fchannel\u002Fmit-ocw\u002F18-06-linear-algebra",36,{"slug":288,"title":289,"href":290,"count":210,"transcribed":20},"8-04-quantum-physics","8.04 Quantum Physics I","\u002Fchannel\u002Fmit-ocw\u002F8-04-quantum-physics",{"slug":292,"title":293,"href":294,"count":281,"transcribed":32},"7-012-biology","7.012 Introduction to Biology","\u002Fchannel\u002Fmit-ocw\u002F7-012-biology",{"slug":296,"title":297,"href":298,"count":216,"transcribed":20},"14-01-microeconomics","14.01 Principles of Microeconomics","\u002Fchannel\u002Fmit-ocw\u002F14-01-microeconomics",{"slug":300,"title":301,"href":302,"count":164,"transcribed":32},"9-00sc-psychology","9.00SC Introduction to Psychology","\u002Fchannel\u002Fmit-ocw\u002F9-00sc-psychology",{"slug":304,"title":305,"href":306,"seriesCount":16,"videos":307,"transcribed":308,"series":309},"predictive-history","Predictive History","\u002Fchannel\u002Fpredictive-history",178,40,[310,315,319,323,327,331,335,339,343,347],{"slug":311,"title":312,"href":313,"count":314,"transcribed":23},"civilization","The Story of Civilization","\u002Fchannel\u002Fpredictive-history\u002Fcivilization",61,{"slug":316,"title":317,"href":318,"count":228,"transcribed":52},"secret-history","Secret History","\u002Fchannel\u002Fpredictive-history\u002Fsecret-history",{"slug":320,"title":321,"href":322,"count":234,"transcribed":146},"game-theory","Game Theory","\u002Fchannel\u002Fpredictive-history\u002Fgame-theory",{"slug":324,"title":325,"href":326,"count":98,"transcribed":15},"great-books","Great Books","\u002Fchannel\u002Fpredictive-history\u002Fgreat-books",{"slug":328,"title":329,"href":330,"count":92,"transcribed":32},"dante","Dante Seminar (Beijing, June 2026)","\u002Fchannel\u002Fpredictive-history\u002Fdante",{"slug":332,"title":333,"href":334,"count":92,"transcribed":32},"geo-strategy","Geo-Strategy","\u002Fchannel\u002Fpredictive-history\u002Fgeo-strategy",{"slug":336,"title":337,"href":338,"count":69,"transcribed":20},"geo-strategy-update","Geo-Strategy Update","\u002Fchannel\u002Fpredictive-history\u002Fgeo-strategy-update",{"slug":340,"title":341,"href":342,"count":23,"transcribed":40},"global-meet-up","Global Meet-Up","\u002Fchannel\u002Fpredictive-history\u002Fglobal-meet-up",{"slug":344,"title":345,"href":346,"count":40,"transcribed":32},"emergency-discussion","Emergency Discussion","\u002Fchannel\u002Fpredictive-history\u002Femergency-discussion",{"slug":348,"title":349,"href":350,"count":52,"transcribed":20},"livestreams","Livestreams and Extras","\u002Fchannel\u002Fpredictive-history\u002Flivestreams"]