|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/recursion-and-backtracking-algorithms-in-java/
课程评论：没有评论
课程名称：递归与回溯算法：编码面试 课程概述：欢迎参加“递归与回溯算法：编码面试”课程。该课程专注于递归和回溯算法。尽管递归的概念简单，但许多人在理解基本情况和递归情况方面遇到困难。因此，我决定创建一个关于递归的课程，详细解释递归的基本原理。完成本课程后，您将对递归和回溯算法充满信心。在本课程中，我们将解决最受欢迎和常见的回溯编码面试问题。通过掌握这些问题，您几乎可以将任何类型的回溯问题映射到这些问题上。 课程内容包括： - 递归的定义及其工作原理 - 独特字符字符串的排列 - 重复字符字符串的排列 - 唯一元素数组的排列 - 重复元素数组的排列 - 唯一元素的幂集 - 重复元素的幂集 - 子集和 - 组合 - 组合和 - 组合和 II - 组合和 III - 生成括号 - 电话号码的字母组合 - 恢复 IP 地址 - 将字符串分成递减的连续值 - 具有唯一字符的连接字符串的最大长度 - 分割为 k 个相等的子集和 - 火柴棍拼成正方形 - 迷宫中的老鼠 - M 彩色问题 为什么要参加本课程： - 详细解释递归的工作原理 - 学习如何绘制决策树并将其转化为代码 - 包含测验 - 如果您有疑问，可以随时提问 期待在课程中见到您！
Welcome to this course, "Recursion and Backtracking Algorithms: Coding Interview".This course is about the recursion and backtracking algorithm. The concept of recursion is simple, but a lot of people struggle with it, finding out base cases and recursive cases. That's Why I planned to create a course on recursion that explains the underline principles of recursion in details.By completing this course you will gain confidence in recursion and backtracking algorithms. In this course we will solve most popular and frequently asked backtracking coding interview questions. By mastering these problems you can map almost any type of backtracking problem to these problem. This course contains -- What is recursion and how it works- Permutations of string of unique character- Permutations of string of duplicates character- Array permutations of unique elements- Array permutations of duplicate elements- Power set of unique elements- Power set of duplicate elements- Subset sum- Combinations- Combination sum- Combination sum ii- Combination sum iii- Generate parentheses- Letter combination of a phone number- Restore ip addresses- Splitting a string into descending consecutive. value- Max length of a concatenated str with unique char- Partition to k equal subset sum- Matchstick to square- Rat in a maze- M ColoringWhy you should take this course - Detailed explanation of how recursion worksHow to draw decision tree and translate it into codeContains quiz Ability to ask questions if you don't understand something See you inside:)
