К содержимому
learnspaceYOUR NEXT CHAPTER
ПРОСТРАНСТВО ОБУЧЕНИЯ
ГлавнаяКаталог курсовМоё обучениеCoursera

Знания без границ

Учитесь у лучших университетов и компаний мира.

Открыть Coursera
Интеграция
Пространство университета
Моё пространствоСтраница курса
↵
ЯЛичный кабинетСтудент
© 2026 LearnSpaceКаждый день — возможность узнать больше.Помощь
Advanced Data Structures and Algorithm Optimization · LearnSpace
Назад в каталог
courseraПрограммирование

Advanced Data Structures and Algorithm Optimization

Курс от Packt
Средний≈ 14.2 чАнглийский
О курсеНавыкиПрограммаПреподаватели

О курсе

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. Elevate your algorithmic expertise by mastering advanced data structures and optimization techniques used in high-level problem solving. This course focuses on recursion, trees, heaps, dynamic programming, and graph algorithms, enabling you to design efficient and scalable solutions for complex computational challenges. You will begin with recursion and backtracking, learning how to systematically explore solution spaces through problems like subsets, combination sum, and N-Queens. The course then transitions into binary trees and binary search trees, covering traversal techniques, structural properties, and real-world problem-solving patterns. As you progress, you will explore heaps for priority-based operations and dive deep into dynamic programming to optimize overlapping subproblems. You will also gain insights into greedy strategies, bit manipulation techniques, and graph algorithms, solving problems such as course scheduling and network delay time. This course is designed for learners with a solid foundation in basic data structures and algorithms who want to advance their problem-solving capabilities. It is best suited for intermediate to advanced learners preparing for technical interviews or competitive programming. By the end of the course, you will be able to design optimized algorithms using advanced data structures, apply dynamic programming and graph techniques, and confidently solve complex, real-world coding challenges.

Навыки, которые вы освоите

Data StructuresAlgorithmsGraph TheoryComputer ProgrammingTheoretical Computer ScienceComputational ThinkingSolution Design

Программа курса

8 модулей · 75 учебных материалов

01Recursion & Backtracking9 материалов

Recursion & Backtracking

Introduction to the Course 'Advanced Data Structures and Algorithm Optimization'ЧтениеFull Specialization ResourcesЧтениеIntroduction To BacktrackingВидеоBacktracking Example 1Видео

Учитесь у экспертов

Packt - Course Instructors

Преподаватель курса

Advanced Data Structures and Algorithm Optimization
В каталоге вашей программы

Инвестируйте в себя

Новые знания — в удобное для вас время.

Начать на Coursera

Обучение откроется на Coursera
в новой вкладке

Обучение на Coursera

≈ 14.2 ч

8 модулей

Язык: Английский

Часть программы вашего университета
Practice Problem 1 - Combination SumВидео
Practice Problem 2 - SubsetsВидео
Practice Problem 3 - N QueensВидео
Solving Backtracking Problems: N-Queens, Subsets, and Combination SumDIALOGUE
Recursion & Backtracking - AssessmentЗадание
02Binary Trees19 материалов

Binary Trees

Introduction To Binary TreeВидеоCommon Terms Related To TreesВидеоIntroduction To Tree TraversalsВидеоLevel Order TraversalВидеоPractice Problem 2 - Binary Tree Level Order TraversalВидеоPractice Problem 4 - Symmetric TreeВидеоPractice Problem 5 - Maximum Depth Of Binary TreeВидеоPractice Problem 6 - Diameter Of A Binary TreeВидеоPractice Problem 7 - Balanced Binary TreeВидеоPractice Problem 8 - Invert Binary TreeВидеоPractice Problem 9 - Path SumВидеоPractice Problem 10 - Path Sum IIВидеоPractice Problem 11 - Cousins In Binary TreeВидеоPractice Problem 12 - Maximum Level Sum Of Binary TreeВидеоPractice Problem 13 - Binary Tree Right Side ViewВидеоPractice Problem 14 - Count Good Nodes In Binary TreeВидеоPractice Problem 17 - Construct Binary Tree From PreOrder And InOrder TraversalВидеоFundamentals and Traversals of Binary TreesDIALOGUEBinary Trees - AssessmentЗадание
03Binary Search Tree6 материалов

Binary Search Tree

Introduction to Binary Search TreeВидеоPractice Problem 1 - Kth Smallest Element In BSTВидеоPractice Problem 2 - Validate Binary Search TreeВидеоPractice Problem 3 - Lowest Common Ancestor Of A Binary Search TreeВидеоMastering Binary Search Trees (BST): Structure and Key OperationsDIALOGUEBinary Search Tree - AssessmentЗадание
04Heaps7 материалов

Heaps

Introduction to HeapsВидеоImplementation of HeapsВидеоInsertion in HeapsВидеоDeletion in HeapsВидеоPractice Problem 1 - Kth Largest Element In An ArrayВидеоUnderstanding Heaps: Properties, Implementation, and OperationsDIALOGUEHeaps - AssessmentЗадание
05Dynamic Programming12 материалов

Dynamic Programming

Practice Problem 1 - Climbing StairsВидеоPractice Problem 2 - Jump GameВидеоPractice Problem 3 - Coin ChangeВидеоPractice Problem 6 - House RobberВидеоPractice Problem 7 - Longest Increasing SubsequenceВидеоPractice Problem 4 - Target SumВидеоPractice Problem 8 - Partition Equal Subset SumВидеоPractice Problem 10 - Integer ReplacementВидеоPractice Problem 14 - Min Cost Climbing StairsВидеоPractice Problem 15 - Longest Palindromic SubstringВидеоDynamic Programming Fundamentals: Interactive Problem SolvingDIALOGUEDynamic Programming - AssessmentЗадание
06Greedy Algorithms3 материалов

Greedy Algorithms

Introduction to Greedy AlgorithmsВидеоUnderstanding Greedy Algorithms Through Scheduling and Coin ChangeDIALOGUEGreedy Algorithms - AssessmentЗадание
07Bit Manipulation8 материалов

Bit Manipulation

Bitwise Operator IntroductionВидеоCommon Bitwise OperatorВидеоPractice Problem 1 - Single NumberВидеоPractice Problem 4 - Divide Two IntegersВидеоPractice Problem 5 - Missing NumberВидеоPractice Problem 8 - Reverse IntegerВидеоExploring Bit Manipulation Operators and Their ApplicationsDIALOGUEBit Manipulation - AssessmentЗадание
08Graphs11 материалов

Graphs

Practice Problem 1 - Course ScheduleВидеоPractice Problem 2 - Number Of IslandsВидеоPractice Problem 3 - Find The Town JudgeВидеоPractice Problem 4 - Surrounded RegionsВидеоPractice Problem 5 - Number Of EnclavesВидеоPractice Problem 6 - Network Delay TimeВидеоPractice Problem 7 - Flood FillВидеоConclusion to the Course 'Advanced Data Structures and Algorithm Optimization'ЧтениеGraphs - AssessmentЗаданиеFull Course Practice AssessmentЗаданиеFull Course AssessmentЗадание