Packt

Advanced Data Structures, Patterns, and Recursion Techniques

Packt

Advanced Data Structures, Patterns, and Recursion Techniques

访问权限由 Coursera Learning Team 提供

深入了解一个主题并学习基础知识。
中级 等级

推荐体验

2 周 完成
在 10 小时 一周
灵活的计划
自行安排学习进度
深入了解一个主题并学习基础知识。
中级 等级

推荐体验

2 周 完成
在 10 小时 一周
灵活的计划
自行安排学习进度

您将学到什么

  • Master advanced data structures and algorithms used in algorithmic problem-solving.

  • Apply the sliding window, two-pointer, and binary search methods for optimized solutions.

  • Solve complex problems with recursion and backtracking to generate efficient solutions.

  • Build a solid foundation for tackling coding challenges in technical interviews.

要了解的详细信息

可分享的证书

添加到您的领英档案

作业

13 项作业

授课语言:英语(English)
最近已更新!

April 2026

了解顶级公司的员工如何掌握热门技能

Petrobras, TATA, Danone, Capgemini, P&G 和 L'Oreal 的徽标

积累特定领域的专业知识

本课程是 Data Structures & Algorithms in Java + 150 Leetcode Problems 专项课程 专项课程的一部分
在注册此课程时,您还会同时注册此专项课程。
  • 向行业专家学习新概念
  • 获得对主题或工具的基础理解
  • 通过实践项目培养工作相关技能
  • 获得可共享的职业证书

该课程共有11个模块

In this module, we will explore the sliding window technique and its application in solving array-related challenges. You will gain hands-on experience with solving subarray problems, improving both efficiency and time complexity through the sliding window method. This section will help you master the technique for optimized problem-solving.

涵盖的内容

6个视频2篇阅读材料1个作业

In this module, we will delve into the two-pointer method, a strategy that optimizes the solution of many array-based problems. You will practice solving problems like "Valid Palindrome" and more, leveraging two pointers for efficient solutions. This section is designed to boost your skills in solving challenging problems with optimal time complexity.

涵盖的内容

4个视频1个作业

In this module, we will explore how mathematical and geometric principles can simplify array and matrix manipulation problems. You will tackle challenges like rotating matrices and setting rows and columns to zero, learning how to apply these methods in efficient algorithms. This section is designed to strengthen your problem-solving using math and geometry.

涵盖的内容

4个视频1个作业

In this module, we will cover interval-based problems that require sorting and merging techniques. You will solve real-world problems like inserting intervals and determining the minimum number of removals needed to make intervals non-overlapping. This section will help you master interval manipulation and enhance your algorithm efficiency.

涵盖的内容

5个视频1个作业

In this module, we will explore how binary search is applied to rotated sorted arrays, an advanced variation of traditional binary search. You will learn to efficiently find elements and solve related problems, such as determining the minimum element in a rotated array. This section will refine your binary search skills in more complex scenarios.

涵盖的内容

3个视频1个作业

In this module, we will explore how binary search is applied to rotated sorted arrays, an advanced variation of traditional binary search. You will learn to efficiently find elements and solve related problems, such as determining the minimum element in a rotated array. This section will refine your binary search skills in more complex scenarios.

涵盖的内容

3个视频1个作业

In this module, we will focus on using binary search to solve problems involving ranges and constraints. You will apply binary search to find optimal solutions in non-traditional search spaces, helping you become more versatile in solving range-based problems. This section aims to deepen your understanding of binary search in challenging real-world problems.

涵盖的内容

2个视频1个作业

In this module, we will explore recursion and backtracking techniques, essential for solving complex problems. You will practice solving real-world challenges like generating subsets, permutations, and solving the N-Queens problem using backtracking. This section is designed to sharpen your recursion and backtracking skills for more advanced algorithmic problem-solving.

涵盖的内容

11个视频1个作业

In this module, we will dive into binary tree theory, covering essential concepts such as tree structure, traversal methods, and the implementation of binary trees in Java. This section will provide the foundation for working with binary trees and understanding how they can be used to solve complex problems efficiently.

涵盖的内容

6个视频1个作业

In this module, you will work through a range of binary tree practice problems to deepen your understanding of tree-based algorithms. You will tackle challenges such as tree inversion, finding the diameter of a tree, and implementing level-order traversal, all while enhancing your problem-solving skills with binary trees.

涵盖的内容

22个视频1个作业

In this module, we will focus on the theory and practice of binary search trees (BSTs). You will learn how to implement key operations such as insertion, deletion, and finding the LCA, along with solving related Leetcode problems. This section is designed to enhance your ability to solve problems that involve binary search trees efficiently.

涵盖的内容

8个视频1篇阅读材料3个作业

获得职业证书

将此证书添加到您的 LinkedIn 个人资料、简历或履历中。在社交媒体和绩效考核中分享。

位教师

Packt - Course Instructors
Packt
1,695 门课程479,206 名学生

提供方

Packt

人们为什么选择 Coursera 来帮助自己实现职业发展

Felipe M.

自 2018开始学习的学生
''能够按照自己的速度和节奏学习课程是一次很棒的经历。只要符合自己的时间表和心情,我就可以学习。'

Jennifer J.

自 2020开始学习的学生
''我直接将从课程中学到的概念和技能应用到一个令人兴奋的新工作项目中。'

Larry W.

自 2021开始学习的学生
''如果我的大学不提供我需要的主题课程,Coursera 便是最好的去处之一。'

Chaitanya A.

''学习不仅仅是在工作中做的更好:它远不止于此。Coursera 让我无限制地学习。'

从 Computer Science 浏览更多内容