|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/algorithms-for-coding-interviews/
课程评论：没有评论
课程名称：编程面试算法 课程概述：本课程将使您更好地了解编程面试中常见的问题类型以及如何有效地解决这些问题。您将学习到面试中使用的最常见算法，并且更重要的是，您将掌握在何时使用这些算法。通过本课程，您将提升您的问题解决能力和面试技巧。 讲师介绍：David 是来自潘美利卡大学（Universidad Panamericana）的算法设计与分析课程的讲师，拥有超过10年的教学经验。他曾是ACM-ICPC编程团队的成员，兼任教练和顾问。David 也是一名资深软件工程师，曾在亚马逊和甲骨文等公司工作，拥有超过10年的行业经验。他还在Karat公司担任合同面试官，为Roblox、Indeed、Walmart、Palantir等公司面试工程师，面试了数百名候选人。此外，他还创办了dnd-learning，专注于创建与算法相关的教育内容，为编程面试提供指导和辅导，并持续发布算法和面试相关的资料。他是《竞争编程算法》一书的合著者。 课程材料：课程的幻灯片可以下载，每个编程练习都提供了代码实现和解释性文档。所有编程问题均为公开可练习的问题，并提供自动化测试用例。 课程内容： 1. 引言 2. 目标 3. 动机 4. 本课程将使用的工具 5. 复杂度分析 - 识别时间和空间复杂度的重要性 - 面试技巧 - 编程练习 6. 数据结构 I - 线性数据结构：向量、列表、队列和栈 - 树形数据结构 - 面试技巧 - 编程练习 7. 数据结构 II - 哈希数据结构 - 面试技巧 - 编程练习 8. 图 - 定义 - 图的类型 - 路径和循环 - 图的表示 - 图的遍历 - 面试技巧 - 编程练习 9. 动态规划 - 定义 - 如何解决动态规划问题 - 动态规划问题的示例 - 面试技巧 - 编程练习 10. 回溯 - 定义 - 如何实现回溯解决方案 - 何时使用回溯 - 示例：数独 - 面试技巧 - 编程练习 本课程将为您的编程面试准备提供坚实的基础，以便在面试中展现您的能力和知识。
What will you learn from the course?By the end of the course, you will have a better idea of the type of problems asked in coding interviews and how to approach them to implement a viable solution.You will also learn the most common algorithms used in coding interviews, and more importantly, when to use them.You will improve your problem-solving skills and interviewing skills.About the InstructorDavid has more than 10 years of experience teaching the Algorithms Design and Analysis course at Universidad Panamericana. He has been involved in the ACM-ICPC programming team of the university as a contestant, coach, and advisor. David is a Principal Software Engineer with more than 10 years of experience in the industry, having worked at Amazon and Oracle. He also has worked at Karat as a contractor to interview engineers for companies such as Roblox, Indeed, Walmart, Palantir, and others. He has interviewed hundreds of candidates during his trajectory and has participated as a problem setter for questions used in recruitment processes.He is the founder of dnd-learning, where he creates educational content related to algorithms. He provides guidance and mentorship for coding interviews and constantly publishes material about algorithms and interviews. He is co-author of the book "Algorithms for Competitive Programming". MaterialThe slides of the course are available for download. For each coding exercise in the course, it is provided the code with the implementation, and a document explaining the solution. The coding questions are public to practice, and all of them have automated test cases. Content of the CourseIntroductionObjectivesMotivationTools that will be used during the courseComplexity AnalysisImportance of identifying time and space complexity in an interviewCommon types of complexitiesInterview tipsCoding exercisesData Structures ILinear data structures: Vector, list, queue, and stackTree data structuresInterview tipsCoding exercisesData Structures IIHashing data structuresInterview tipsCoding exercisesGraphsDefinitionTypes of graphsPaths and cyclesRepresentation of a graphGraph traversalInterview tipsCoding exercisesDynamic ProgrammingDefinitionHow to approach a problem with dynamic programmingExamples of DP problemsInterview tipsCoding exercisesBacktrackingDefinitionHow to implement a backtracking solutionWhen is a good idea to use backtrackingExample: SudokuInterview tipsCoding exercises
