[{"data":1,"prerenderedAt":126},["ShallowReactive",2],{"package-course":3},{"id":4,"title":5,"type":6,"subType":7,"shortDesc":8,"desc":9,"suitableDesc":10,"term":11,"section":12,"period":11,"periodUnit":11,"cover":11,"smallCover":11,"studentCount":13,"highlightDesc":11,"originalPrice":14,"offPrice":14,"cnPrice":15,"flowPic":11,"createdTime":16,"modifiedTime":16,"specialPrice":11,"highlightList":11,"nextTermDate":17,"likeCount":18,"evaluateGrade":11,"outline":19,"questionList":98,"selfLiked":11,"cnPayPrice":123,"usPayPrice":14,"discount":11,"trackList":124,"coursePriceList":11,"isSubscribed":11,"liveVideoLink":11,"courseType":125,"hasSub":27,"successRate":11,"payed":11},"interview-ready-package","Interview Ready Package","8","5","完整录播课程 + Mock Interview + 简历修改 + BQ 定制，一次买齐北美面试准备的全部环节。","本课程为15节课，全程一对一陪伴服务，覆盖了所有北美算法面试最高频的算法，在交流过程中突出师生互动性来保证所有学生能够充分实时地和老师交流，并在交流中模拟真实的面试环境以提升学生的交流、算法、应试综合技巧。课程还为EE\u002FME\u002F文科等转专业学生提供额外的基础教程，帮助同学快速入门。","适合：所有求职者",null,15,1,3200,"¥22972",1791447419000,"随报随学",0,[20,28,33,38,43,48,53,58,63,68,73,78,83,88,93],{"id":21,"courseId":4,"title":22,"desc":23,"descList":11,"free":24,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":26,"hasSub":27,"subOutlines":11,"canPlayVideo":24},"irp-video-vip-algo-01","第一讲 Binary Search","二分法的原理、适用场景及复杂度分析\n如何写出不会死循环的二分模板\n二分答案题型总结\n二分相关经典题目剖析， 二分答案","1","","3270835011667294603","0",{"id":29,"courseId":4,"title":30,"desc":31,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":32,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-02","第二讲 Two Pointers","Quick Sort, partition问题，双指针，2Sum, QuickSelect 算法，\nTwo pointer 及其延申\nLinked List 指针","3270835011679522064",{"id":34,"courseId":4,"title":35,"desc":36,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":37,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-03","第三讲 Sliding Window PrefixSum","Fixed Size and Non-Fixed Size sliding window， 同向双指针、快慢指针的使用\n滑动窗口模板分析\n相向双指针\n背向双指针","3270835011667495457",{"id":39,"courseId":4,"title":40,"desc":41,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":42,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-04","第四讲 LinkedList LRU","Linkedlist 专题 和 LRU cache，最难又是最简单的面试基础知识","3270835011667026452",{"id":44,"courseId":4,"title":45,"desc":46,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":47,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-05","第五讲 Tree Traversal","Tree的问题主要就是遍历问题 如何遍历一个Tree(Recursion,Iteration) Views of Binary Tree, 宽度优先搜索的适用场景, 二叉树的三种遍历方式（递归及非递归）\n基于遍历的二叉树问题求解\n二叉树问题通解——分治法\n二叉查找树的性质及经典问题分析","3270835011678197163",{"id":49,"courseId":4,"title":50,"desc":51,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":52,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-06","第六讲 Tree Recursion","Tree与Recursion的结合问题 LCA与Path Sum  DFS解决联通性问题\n路径类问题\n组合型DFS\n排列型DFS\n基于DFS的方案穷举","3270835011678287775",{"id":54,"courseId":4,"title":55,"desc":56,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":57,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-07","第七讲 TopK和Heap","PriorityQueue的应用与实现 TopK算法 online algorithm , Top K largest、Top K frequence专题\n多路归并问题\nHeap用于贪心算法","3270835011668216204",{"id":59,"courseId":4,"title":60,"desc":61,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":62,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-08","第八讲 Recursion 强化","如何用自底向上的方法解决问题 Recursion 思想","3270835011668771541",{"id":64,"courseId":4,"title":65,"desc":66,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":67,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-09","第九讲 Tree Recursion, Divide and Conquer","树的递归与分治思想， 图论引出","3270835011667871074",{"id":69,"courseId":4,"title":70,"desc":71,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":72,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-10","第十讲 Graph Theory I Basic Traversal","图算法基本介绍 如何构图 reachable问题","3270835011677845460",{"id":74,"courseId":4,"title":75,"desc":76,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":77,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-11","第十一讲 Graph Theory II Traversal II","图论中对点的遍历问题\n联通分量问题\n拓扑排序","3270835011679575733",{"id":79,"courseId":4,"title":80,"desc":81,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":82,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-12","第十二讲 Graph Theory Backtracking I","回溯算法 图论中对边(Path)的遍历问题","3270835011669093637",{"id":84,"courseId":4,"title":85,"desc":86,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":87,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-13","第十三讲 Data Structure Trie and Union Find","高级数据结构的实现与应用","3270835011669612262",{"id":89,"courseId":4,"title":90,"desc":91,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":92,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-14","第十四讲 Monotonic Stack 和简单DP与记忆化搜索介绍","单调栈与Sliding Window, 简单DP与记忆化搜索介绍","3270835011676637640",{"id":94,"courseId":4,"title":95,"desc":96,"descList":11,"free":27,"trackId":25,"coursewareUrl":25,"reviewVideo":25,"exerciseAnswer":11,"videoId":97,"hasSub":27,"subOutlines":11,"canPlayVideo":27},"irp-video-vip-algo-15","第十五讲 Interval and Sweep Line","Interval问题与查分数组扫描线 and Sweep Line","3270835011679141063",[99,102,105,108,111,114,117,120],{"id":21,"courseId":4,"question":100,"answer":101},"退款政策？","求职一对一尊享课程学生报名后，如对老师服务或课程质量不满意的，在报名付款后一天内正式课之前可申全额退款。需要注意的是，超过24小时开通权限后无法使用该权力。并且同一课程只能够退款一次。",{"id":29,"courseId":4,"question":103,"answer":104},"求职一对一尊享课程上课方式是怎样的？开课时间怎么安排？","所有课程内容均为录播，开课后学生会被运营同学指定一对一学习的老师，老师负责简历修改，答疑，后续求职内推等工作。",{"id":34,"courseId":4,"question":106,"answer":107},"上岸五人算法小班课的师生比例如何？每个学生都有机会和老师交流吗？","我们保证学生可以收到老师一对一的服务。对于文字性的问题能够在24小时内回复。不存在任何助教。我们的 求职一对一尊享课程最突出的就是每一个学生每一次上课都有充足的时间能够体会到老师的言传身教来提高自己。",{"id":39,"courseId":4,"question":109,"answer":110},"如果缺席课程\u002F效果不理想，能否重听课程？","因为是录播课，所以录播对当前付费学员终生开放。不可转借，一旦发现，永久取消学生资格。",{"id":44,"courseId":4,"question":112,"answer":113},"参加求职一对一尊享课程后，还要花多少时间才能获得Dream Offer?","根据我们内部的资料，参加我们的小班课程后，90%的同学能在半年内拿到理想的 Offer。但求职和教育都是双方共同参与以及努力的结果，有些同学在课程的尾声就拿到了心仪的Offer。",{"id":49,"courseId":4,"question":115,"answer":116},"课程结业后，我还能得到求职帮助吗？","当然可以，我们希望您通过参加求职一对一尊享课程结识更多的老师和朋友。亦师亦友是我们提倡的理念，所以如果结业后有任何的问题，千万不要犹豫，问您喜欢的老师即可。我们的共同目标就是上岸！",{"id":54,"courseId":4,"question":118,"answer":119},"上岸五人算法小班课的课后作业是如何布置和完成的？","录播课程均有作业列表，需要同学自觉完成。老师会不定期抽查。",{"id":59,"courseId":4,"question":121,"answer":122},"课程过程中我可以拿到内推吗？什么公司都可以吗？","肯定可以，求职一对一尊享课程让学生有自由学习的同时，强调老师的带路左右。对于合格的学员我们非常乐意内推各顶级公司。",22972,[],"video-vip-sde",1791528773906]