|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/dynamic-programming-master-course-coding-minutes/
课程评论：没有评论
课程名称：动态规划算法大师课程 课程概述：如果你在数据结构和算法方面有所了解，但在动态规划（DP）方面常常感到困惑，那么这个课程将非常适合你。我们很高兴地推出动态规划专项课程，帮助你掌握重要的动态规划概念，为竞争编程和面试做好准备。本课程由Google的软件工程师Apaar Kamal和前Google工程师、Coding Minutes创始人Prateek Narang授课。课程内容详尽而严格，旨在确保你在在线比赛中能够成功应对常见的动态规划问题。 动态规划是一种在计算机编程中广泛使用的算法技术，能够有效解决具有重叠子问题和最优子结构属性的问题。如果一个问题可以被分解成子问题，并且这些子问题之间有重叠，那么这些子问题的解决方案可以被保存以供将来参考，从而提高算法效率，优化多个问题。 本课程长达40多个小时，涵盖动态规划的广度和深度，内容包括递归、回溯的复习，以及深入探讨如下动态规划技术： - 一维和二维动态规划 - 多维动态规划 - 组合与子序列的动态规划 - 字符串的动态规划 - 数字动态规划 - 树和图的动态规划 - SOS动态规划及位掩码动态规划 - 矩阵指数的动态规划 - 博弈论中的动态规划 - 结合高级数据结构的动态规划 此外，课程还提供完整的Atcoder教育DP竞赛解题实录。 课程亮点： * 详细的视频讲解 * 深入探讨高级动态规划概念 * 精心策划的练习题集 * 终生访问权限 * 涵盖所有变种的动态规划 还等什么呢？立即加入课程，让你的动态规划技能提升到一个新高度！
Are you feeling brushed-up with data structures and algorithms but often feel stuck when it comes to DP! But no more, we are super happy to present the Dynamic Programming Specialisation Course for everyone, to help you master the important Dynamic Programming Concepts and level up for Competitive Coding & Interviews.The Dynamic Programming Master Course is taught by Apaar Kamal, software engineer at Google & Master on Codeforces along with Prateek Narang, an ex-Google engineer and founder of Coding Minutes. This highly detailed & rigorous curriculum has been designed to ensure your success in online competitions where Dynamic Programming problems are very common these days. Many top companies like Google, Facebook, Amazon, Directi, CodeNation, Goldman Sachs etc encourage Competitive Programming and conduct coding competitions to hire smart people who can solve problems. Dynamic Programming is a popular algorithmic technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.If any problem can be divided into subproblems, which in turn are divided into smaller subproblems, and if there are overlapping among these subproblems, then the solutions to these subproblems can be saved for future reference. In this way, algorithm can be improved, and lot of problems can be optimised using Dynamic Programming.The 40+ hours course covers the breadth & depth of dynamic programming starting from a recap of recursion, backtracking, and diving deep into Dynamic Programming techniques like - 1D, 2D, Multi-dimensional DPDP and Partition ProblemsDP for Combinatorics & SubsequencesDP on StringsDigit DPDP on Trees & GraphsSOS DP and DP with BitmasksDP and Matrix ExponentiationDP in Game Theory DP with advanced data structures[Extra] You will also get Full Solved Atcoder Educational DP Contest as part of the course.Course Highlights* Detailed video explanations* Deep dive into advanced DP Concepts* Carefully curated practice problem sheets* Full Life Time Access * All variants of DP CoveredSo, what are you waiting for - join the course now and level-up your DP Skills! *
