What background knowledge is necessary to enroll in this course?

Before enrolling, you should have a basic understanding of programming, particularly in JavaScript, and familiarity with fundamental data structures such as arrays and linked lists. The course will build on these basics, so while previous experience with data structures and algorithms is helpful, it is not mandatory.

Who is this course for?

This course is aimed at intermediate programmers who wish to enhance their understanding of advanced data structures and algorithms. It is particularly useful for individuals preparing for technical interviews, competitive programming, or those looking to improve their coding efficiency in real-world applications.

How long does it take to complete the course?

The course takes approximately 13 hours to complete, making it a manageable option for learners looking to improve their skills in a relatively short period.

Can I preview a course before enrolling?

Yes, you can preview the first video and view the syllabus before you enroll. You must purchase the course to access content not included in the preview.

When will I have access to the lectures and assignments?

If you decide to enroll in the course before the session start date, you will have access to all of the lecture videos and readings for the course. You’ll be able to submit assignments once the session starts.

What will I get when I enroll?

Once you enroll and your session begins, you will have access to all videos and other resources, including reading items and the course discussion forum. You’ll be able to view and submit practice assessments, and complete required graded assignments to earn a grade and a Course Certificate.

When will I receive my Course Certificate?

If you complete the course successfully, your electronic Course Certificate will be added to your Accomplishments page - from there, you can print your Course Certificate or add it to your LinkedIn profile.

Why can’t I audit this course?

This course is currently available only to learners who have paid or received financial aid, when available.

Is financial aid available?

Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

Advanced Data Structures and Problem-Solving Techniques

享受 3 個月的 Coursera Plus 40% 的折扣，節省讓您 閃耀的技能。立即保存

Advanced Data Structures and Problem-Solving Techniques

本课程是 Data Structures & Algorithms in JavaScript 专项课程的一部分

位教师：Packt - Course Instructors

包含在中

了解更多

7个模块

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

中级等级

推荐体验

1 周完成

在 10 小时一周

灵活的计划

自行安排学习进度

7个模块

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

中级等级

推荐体验

1 周完成

在 10 小时一周

灵活的计划

自行安排学习进度

您将学到什么

Implement advanced data structures such as binary search trees, heaps, and sliding window methods.
Solve complex algorithmic problems using efficient techniques like two-pointer and binary search.
Optimize problem-solving strategies for performance in coding challenges.
Master problem-solving methods essential for technical interviews and real-world applications.

要了解的详细信息

可分享的证书

添加到您的领英档案

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

了解关于 Coursera for Business 的更多信息

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

积累特定领域的专业知识

本课程是 Data Structures & Algorithms in JavaScript 专项课程专项课程的一部分

在注册此课程时，您还会同时注册此专项课程。

向行业专家学习新概念
获得对主题或工具的基础理解
通过实践项目培养工作相关技能
获得可共享的职业证书

该课程共有7个模块

This course features Coursera Coach!

A smarter way to learn with interactive, real-time conversations that help you test your knowledge, challenge assumptions, and deepen your understanding as you progress through the course. Through this course, you’ll gain a deeper understanding of advanced data structures and problem-solving techniques. You'll explore core data structures such as queues, heaps, binary search trees, and binary trees, learning how to implement and optimize them. By working through a variety of real-world coding problems, you’ll also hone your algorithmic thinking skills and ability to tackle complex coding challenges. The course is designed to walk you through the fundamentals and more advanced concepts, starting with the implementation of basic structures like queues and progressing to more intricate topics like binary search trees, heaps, and sliding window methods. You'll work with different data structures in various programming languages, including JavaScript, to optimize solutions and improve performance. As you proceed, you will also tackle problem-solving strategies using methods like sliding window, two-pointer, binary search, and dynamic programming, with ample practice problems to reinforce each technique. This course is perfect for intermediate learners familiar with basic programming concepts and data structures. If you’re looking to improve your algorithmic skills, or if you’re preparing for coding interviews, this course is the perfect way to take your understanding to the next level. By the end of the course, you will be able to implement advanced data structures, solve real-world algorithmic problems, optimize code for efficiency, and prepare for technical interviews.

In this module, we will explore the fundamentals of queues as a data structure. You will learn to implement queues using both linked lists and arrays, ensuring efficient operations. By the end of this section, you will be comfortable with practical queue implementations in JavaScript.

涵盖的内容

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

In this module, we will dive into the sliding window method, a powerful technique for optimizing algorithms. You'll apply this technique to efficiently solve problems like the "Longest Substring Without Repeating Characters" and "Sliding Window Maximum."

涵盖的内容

4个视频1个作业

In this module, we will focus on the two-pointer technique. You'll learn to apply it in solving problems like "Trapping Rain Water" and "Container with Most Water." This method will also help you check for palindromes efficiently.

涵盖的内容

4个视频1个作业

In this module, we will introduce you to binary search, a highly efficient algorithm for searching sorted arrays. You’ll gain hands-on experience in implementing it and solving real-world problems such as "Search Insert Position" and "Magnetic Force Between Two Balls."

涵盖的内容

6个视频1个作业

In this module, we will introduce you to binary trees, focusing on core concepts like tree traversal and key operations. You’ll tackle problems such as "Maximum Depth of a Binary Tree" and "Invert Binary Tree" while gaining a deeper understanding of tree structures.

涵盖的内容

21个视频1个作业

21个视频总计155分钟

Introduction to Binary Trees9分钟
Terms Related to Trees8分钟
Level Order Traversal3分钟
Tree Traversal Algorithms9分钟
Practice Problem 1 - Binary Tree InOrder Traversal3分钟
Practice Problem 2 - Maximum Depth of a Binary Tree8分钟
Practice Problem 3 - Invert Binary Tree5分钟
Practice Problem 4 - Binary Tree Level Order Traversal7分钟
Practice Problem 5 - Diameter of a Binary Tree13分钟
Practice Problem 6 - Path Sum8分钟
Practice Problem 7 - Path Sum II10分钟
Practice Problem 8 - Cousins in Binary Tree9分钟
Practice Problem 9 - Maximum Level Sum of Binary Tree8分钟
Practice Problem 10 - Symmetric Tree7分钟
Practice Problem 11 - Balanced Binary Tree8分钟
Practice Problem 12 - Binary Tree Right Side View3分钟
Practice Problem 13 - Construct Binary Tree from PreOrder and InOrder Traversal11分钟
Practice Problem 14 - Same Tree7分钟
Practice Problem 15 - Subtree of Another Tree7分钟
Practice Problem 16 - Sum of Left Leaves7分钟
Practice Problem 17 - Count Good Nodes in Binary Tree7分钟

1个作业总计15分钟

Binary Trees - Assessment15分钟

In this module, we will explore heaps, a tree-based structure used for priority queues. You will learn heap operations such as insertion and deletion, and solve problems like finding the "Kth Largest Element in an Array."

涵盖的内容

10个视频1个作业

10个视频总计96分钟

Introduction to Heaps11分钟
Implementation of Heaps10分钟
Heap Insertion6分钟
Heap Insert Implementation12分钟
Heap Deletion7分钟
Heap with Custom Comparator7分钟
Heap Deletion Implementation11分钟
Heapify8分钟
Practice Problem 1 - Kth Largest Element in an Array9分钟
Practice Problem 2 - Find Median from Data Stream14分钟

1个作业总计15分钟

Heaps - Assessment15分钟

In this module, we will explore Binary Search Trees (BSTs), a tree-based data structure that ensures efficient searching, insertion, and deletion. You will also solve various problems, such as "Validate Binary Search Tree" and "Lowest Common Ancestor of a BST."

涵盖的内容

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

8个视频总计65分钟

Binary Search Tree and Its Applications17分钟
Height Balanced BST1分钟
BST Insertion6分钟
Inorder Successor & Predecessor5分钟
BST Deletion13分钟
Practice Problem 1 - Kth Smallest Element in BST6分钟
Practice Problem 2 - Lowest Common Ancestor of a Binary Search Tree9分钟
Practice Problem 3 - Validate Binary Search Tree8分钟

1篇阅读材料总计10分钟

Conclusion to the Course 'Advanced Data Structures and Problem-Solving Techniques'10分钟

3个作业总计90分钟

Full Course Practice Assessment15分钟
Binary Search Tree - Assessment15分钟
Full Course Assessment60分钟

获得职业证书

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

位教师

Packt - Course Instructors

Packt

1,810 门课程512,664 名学生

提供方

Packt

从 Algorithms 浏览更多内容

Packt
Algorithms and Problem Solving with Advanced Techniques
课程
Packt
Foundations of Data Structures and Algorithms in JavaScript
课程

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

Felipe M.

自 2018开始学习的学生

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

Jennifer J.

自 2020开始学习的学生

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

Larry W.

自 2021开始学习的学生

''如果我的大学不提供我需要的主题课程，Coursera 便是最好的去处之一。'

Chaitanya A.

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

常见问题

Advanced Data Structures and Problem-Solving Techniques is a course designed to deepen your understanding of various data structures and algorithms, which are critical to solving complex computational problems efficiently. This specialization covers a range of advanced techniques such as sliding window methods, binary search, heaps, binary trees, and their applications in problem-solving. It is relevant because mastering these techniques can significantly improve your ability to tackle challenges in coding interviews, software development, and competitive programming.

This course covers a range of essential data structures and algorithms, including queues, binary trees, heaps, and binary search, along with problem-solving strategies. You will learn how to implement and apply these techniques in solving practical algorithmic problems. The course also includes a variety of exercises to help reinforce the concepts, making it both a theoretical and practical learning experience.

Upon completing the course, you will be able to confidently implement advanced data structures and apply algorithms to solve a wide variety of coding problems. You will be able to use techniques like binary search, sliding window, two-pointer methods, and binary tree traversals to optimize problem-solving and improve the efficiency of your code.