|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/algorithms-and-data-structures-in-cpp/
课程评论：没有评论
**课程名称：** LeetCode-DSA 基础模式 **课程概述：** 本课程“LeetCode-DSA 基础模式”旨在帮助您转变解决问题的方式。通过专注于基础模式，您将建立对算法和数据结构的扎实理解，从而能够清晰高效地应对复杂挑战。 **为何要学习模式？** 模式是常见算法问题的可重用解决方案。识别这些模式可以使您系统有效地解决问题，节省时间并提高准确性。 **课程结构：** 本课程分为核心类别，每个类别都涵盖了一组集中的模式。您将探索以下内容： 1. **数组 (Arrays)** * 模式 #01：数组操作 (Array Manipulation) * 模式 #02：双指针 (Two Pointer) * 模式 #03：前缀和与后缀和 (Prefix and Suffix Sum) 2. **字符串 (Strings)** * 模式 #04：字符串操作 (String Manipulation) * 模式 #05：频率映射 (Frequency Map) 3. **链表 (Linked Lists)** * 模式 #06：单指针 (Single Pointer) * 模式 #07：多指针 (Multi Pointer) 4. **树 (Trees)** * 模式 #08：递归 (Recursion) * 模式 #09：深度优先搜索 (DFS) * 模式 #10：广度优先搜索 (BFS) 5. **二叉搜索树 (Binary Search Trees - BST)** * 模式 #11：递归 (Recursion) * 模式 #12：中序遍历 (Inorder Traversal) 6. **矩阵 (Matrix)** * 模式 #13：矩阵操作 (Matrix Manipulation) 7. **图 (Graphs)** * 模式 #14：矩阵图 - DFS (Matrix Graph - DFS) * 模式 #15：并查集 (Union Find) * 模式 #16：有向无环图 (DAG) 8. **动态规划 (Dynamic Programming)** * 模式 #17：背包问题 (Knapsack) * 模式 #18：最长公共子序列 (Longest Common Subsequence - LCS) * 模式 #19：二维网格 (2D Grid) 9. **堆 (Heap)** * 模式 #20：频率映射和自定义比较器 (Frequency Map and Custom Comparator) **您将获得的收益：** * 对算法技术的结构化理解。 * 在不同问题领域识别和应用模式的能力。 * 在解决编码挑战和准备面试中的信心。 **适用人群：** 本课程非常适合任何希望掌握算法的人，无论您是初学者、经验丰富的编码人员，还是正在准备参加算法竞赛。让我们开始成为问题解决专家的旅程吧！ **联系方式：** * GitHub: @grid47 * YouTube: @grid47 * Udemy: @grid47 * Leetcode: @grid47
Welcome to Basic LeetCode-DSA Patterns, a course designed to transform your approach to problem-solving. By focusing on foundational patterns, you'll build a strong understanding of algorithms and data structures, equipping you to tackle complex challenges with clarity and efficiency.Why Patterns?Patterns serve as reusable solutions to common algorithmic problems. Recognising these patterns allows you to approach problems systematically and effectively, saving time and improving accuracy.Course StructureThis course is organised into core categories, each covering a set of focused patterns. Here's what you'll explore:ArraysPattern #01: Array ManipulationPattern #02: Two PointerPattern #03: Prefix and Suffix SumStringsPattern #04: String ManipulationPattern #05: Frequency MapLinked ListsPattern #06: Single PointerPattern #07: Multi PointerTreesPattern #08: RecursionPattern #09: DFSPattern #10: BFSBinary Search Trees (BST)Pattern #11: RecursionPattern #12: Inorder TraversalMatrixPattern #13: Matrix ManipulationGraphsPattern #14: Matrix Graph - DFSPattern #15: Union FindPattern #16: DAGDynamic ProgrammingPattern #17: KnapsackPattern #18: Longest Common Subsequence (LCS)Pattern #19: 2D GridHeapPattern #20: Frequency Map and Custom ComparatorWhat You'll GainA structured understanding of algorithmic techniques.The ability to recognise and apply patterns across various problem domains.Confidence in solving coding challenges and tackling interviews.This course is ideal for anyone looking to master algorithms, whether you're a beginner, an experienced coder, or preparing for competitive programming. Let's begin the journey to becoming a problem-solving expert!Connect with Me:GitHub: @grid47YouTube: @grid47Udemy: @grid47Leetcode: @grid47
