|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/data-structure-and-algorithms-for-interviews/
课程评论：没有评论
**Coursera课程总结：数据结构与算法面试精讲** 本课程提供了一个全面的数据结构与算法学习平台，旨在帮助学员掌握解决典型编码面试问题的技巧。课程内容涵盖了20多个关键的算法主题，并以每周新增4个问题的速度不断扩展（最终将达到200+道题）。 **核心内容模块包括：** * **合并区间 (Merge Intervals):** 学习如何高效地合并重叠的区间，并提及了区间交叉和冲突约会等相关问题。 * **双指针 (Two Pointers):** 深入理解双指针技术及其不同应用场景，例如“两数之和” (Two Sum)、“排序数组去重” (Remove Duplicates from Sorted Array)、“三数之和” (3 Sum) 等。 * **快慢指针 (Fast & Slow Pointers):** 掌握使用快慢指针来解决链表相关问题，如“链表环检测” (Linked List Cycle) 及“找到链表中间节点” (Middle of the LinkedList)。 * **位运算 (Bitwise Manipulation):** 学习使用位运算高效地解决特定类型的问题，例如“Single Numbers”。 * **贪心算法 (Greedy Technique):** 理解贪心算法的思想，并学习其在“灯泡” (Bulbs) 、“最大乘积” (Highest Product) 等问题中的应用。 * **并查集 (Disjoint Sets):** 学习并查集数据结构及其在图论和优化问题中的应用，例如“最大排列” (Largest Permutation) 和“会议室” (Meeting rooms)。 * **岛屿问题 (Island Patterns):** 涵盖矩阵遍历和岛屿计数等典型问题，如“岛屿数量” (Number of Islands) 和“不同岛屿数量” (Number of distinct Islands)。 * **拓扑排序 (Topological Sort):** 学习图论中的拓扑排序及其在任务调度和依赖关系分析等场景的应用，例如“课程表” (Course Schedule) 和“外星词典” (Alien Dictionary)。 * **深度优先搜索 (DFS):** 讲解DFS在图和树结构中的应用，例如“路径总和” (Path Sum)。 **即将新增的题目和主题将进一步丰富课程内容，包括但不限于：** * **滑动窗口 (Sliding Window):** 包含一维数组的子数组求和、最小子数组和、以及涉及多个不重复字符或替换字符的字符串问题。 * **双堆 (Two Heaps):** 学习如何使用双堆结构高效计算数据流的中位数 (Find the median of a number stream)。 * **Top K 元素 (Top k elements):** 掌握查找Top K元素、Top K频繁元素、以及K个最接近的点等问题。 * **数分 (Binary Search)** * **回溯 (Backtracking)** * **动态规划 (1D DP, 2D DP)** * **循环排序 (Cyclic Sort)** * **栈 (Stacks)** * **队列 (Queues)** * **广度优先搜索 (BFS)** * **Trie** * **哈希表 (Hash Maps)** * **数学技巧 (Math Tricks)** * **杂项 (Miscellaneous)** 本课程是一个动态的学习资源，通过不断更新的练习题和深入的讲解，帮助学员全面提升解决算法面试问题的能力，为求职面试做好充分准备。
Covers around 20+ most popular coding interview problems ranging from a variety of topics ( will have 200+ problems as 4 problems are being added every week) Merge IntervalsIdea of Merge Intervals Merge IntervalsIntervals Intersection (coming soon) Conflicting Appointments (coming soon) Two PointersIdea of Two pointers and types of two pointers solutionsTwo SumRemove Duplicates from Sorted Array3 Sum Pair with Target Sum (coming soon) Squaring a Sorted Array (coming soon) Triplet Sum to Zero (coming soon) Triplet Sum Close to Target (coming soon) Triplets with Smaller Sum (coming soon) Subarrays with Product Less than a Target (coming soon) Dutch National Flag Problem (coming soon) Fast & Slow PointersLinked List Cycle using Floyd's Cycle Detection AlgorithmHappy NumbersUgly number (coming soon) Middle of the LinkedList (coming soon) LinkedList Cycle (coming soon) Start of LinkedList Cycle (coming soon) Bitwise ManipulationSingle Numbers Flipping an Image Single Number II ( coming soon) Single Number III ( coming soon) Greedy TechniqueWhat are Greedy Algorithms ?BulbsHighest ProductDisjoint Sets Largest Permutation ( coming soon) Meeting rooms ( coming soon) Distribute Candy ( coming soon) Seats ( coming soon) Assign Mice to Holes ( coming soon) Majority Element ( coming soon) Gas Station ( coming soon) Island PatternsIntro to MatrixNumber of Islands ExplanationNumber of Islands CodeNumber of distinct Islands ExplanationNumber of distinct island codingCount sub islands Max Area of an island (coming soon) Island Perimeter (coming soon) Flood fill (coming soon) Wall and Fates (coming soon) Minesweeper (coming soon) Surrounded Regions (coming soon) Find all groups of a farm land (coming soon) Topological SortIntroduction to Graph Problems Topological SortKahn's AlgorithmImplementing Topological SortCourse ScheduleAlien DictionaryMinimum Height Trees (coming soon) All Ancestors of a Node in a Directed Acyclic Graph (coming soon) Build a Matrix With Conditions (coming soon) Find All Possible Recipes from Given Supplies (coming soon) Depth First SearchPath Sum Upcoming Additions (3-4 problems are added every week)Sliding Window Easy Maximum Sum Subarray of Size K Smallest Subarray With a Greater Sum Medium Longest Substring with maximum K Distinct Characters Fruits into Baskets HardLongest Substring with Distinct Characters Longest Substring with Same Letters after Replacement Longest Subarray with Ones after Replacement ArraysMedium Group AnagramsHardTrapping Rain WaterMerge IntervalsMedium Intervals Intersection Conflicting Appointments Linked ListEasyReverse a Linked List Medium Reverse a sub list Reverse a k-element sub list Two HeapsMedium Find the median of a number streamHardMaximum CapitalSliding Window Median Top k elementsEasyTop 'K' Numbers Kth Smallest Number 'K' Closest Points to the Origin Connect Ropes MediumTop 'K' Frequent Numbers Frequency Sort Kth Largest Number in a Stream 'K' Closest Numbers Maximum Distinct Elements Sum of Elements HardRearrange String K-way mergeBinary SearchBacktracking1D Dynamic programing 2D Dynamic programing Cyclic SortTopological SortStacksQueuesDepth First SearchBreadth First Search TrieHash MapsMath TricksMiscellaneous
