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

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

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

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

Advanced Data Structures and Problem-Solving Techniques

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

О курсе

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.

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

Data StructuresAlgorithmsJavascriptProgramming PrinciplesPerformance TuningSolution DesignComputational ThinkingProblem Solving

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

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

01Queue7 материалов

Queue

Introduction to the Course 'Advanced Data Structures and Problem-Solving Techniques'ЧтениеFull Specialization ResourceЧтениеWhat is Queue?ВидеоQueue Using Linked ListВидео

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

Packt - Course Instructors

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

Advanced Data Structures and Problem-Solving Techniques
В каталоге вашей программы

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

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

Начать на Coursera

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

Обучение на Coursera

≈ 13.1 ч

7 модулей

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

Субтитры: Арабский, Французский, Итальянский, Корейский, Индонезийский, Испанский, Японский

Часть программы вашего университета
Queue ImplementationВидео
Understanding and Implementing QueuesDIALOGUE
Queue - AssessmentЗадание
02Sliding Window Method6 материалов

Sliding Window Method

Introduction to Sliding Window Method Part 1ВидеоSliding Window Method Part 2ВидеоPractice Problem 1 - Longest Substring Without Repeating CharactersВидеоPractice Problem 2 - Sliding Window MaximumВидеоMastering the Sliding Window TechniqueDIALOGUESliding Window Method - AssessmentЗадание
03Two Pointer Method6 материалов

Two Pointer Method

Practice Problem 1 - Trapping Rain WaterВидеоPractice Problem 2 - Two Sum II (Input Array Is Sorted)ВидеоPractice Problem 3 - Container with Most WaterВидеоPractice Problem 4 - Valid PalindromeВидеоMastering the Two Pointer Technique: Four LeetCode PatternsDIALOGUETwo Pointer Method - AssessmentЗадание
04Binary Search8 материалов

Binary Search

Introduction to Binary SearchВидеоBinary Search ImplementationВидеоBinary Search ComplexityВидеоPractice Problem 1 - Search Insert PositionВидеоPractice Problem 2 - Koko Eating BananasВидеоPractice Problem 3 - Magnetic Force Between Two BallsВидеоApplying Binary Search: Scenarios and Problem SolvingDIALOGUEBinary Search - AssessmentЗадание
05Binary Trees23 материалов

Binary Trees

Introduction to Binary TreesВидеоTerms Related to TreesВидеоLevel Order TraversalВидеоTree Traversal AlgorithmsВидеоPractice Problem 1 - Binary Tree InOrder TraversalВидеоPractice Problem 2 - Maximum Depth of a Binary TreeВидеоPractice Problem 3 - Invert Binary TreeВидеоPractice Problem 4 - Binary Tree Level Order TraversalВидеоPractice Problem 5 - Diameter of a Binary TreeВидеоPractice Problem 6 - Path SumВидеоPractice Problem 7 - Path Sum IIВидеоPractice Problem 8 - Cousins in Binary TreeВидеоPractice Problem 9 - Maximum Level Sum of Binary TreeВидеоPractice Problem 10 - Symmetric TreeВидеоPractice Problem 11 - Balanced Binary TreeВидеоPractice Problem 12 - Binary Tree Right Side ViewВидеоPractice Problem 13 - Construct Binary Tree from PreOrder and InOrder TraversalВидеоPractice Problem 14 - Same TreeВидеоPractice Problem 15 - Subtree of Another TreeВидеоPractice Problem 16 - Sum of Left LeavesВидеоPractice Problem 17 - Count Good Nodes in Binary TreeВидеоFundamentals and Traversals of Binary TreesDIALOGUEBinary Trees - AssessmentЗадание
06Heaps12 материалов

Heaps

Introduction to HeapsВидеоImplementation of HeapsВидеоHeap InsertionВидеоHeap Insert ImplementationВидеоHeap DeletionВидеоHeap with Custom ComparatorВидеоHeap Deletion ImplementationВидеоHeapifyВидеоPractice Problem 1 - Kth Largest Element in an ArrayВидеоPractice Problem 2 - Find Median from Data StreamВидеоMastering Heaps: Structure, Operations, and ApplicationsDIALOGUEHeaps - AssessmentЗадание
07Binary Search Tree13 материалов

Binary Search Tree

Binary Search Tree and Its ApplicationsВидеоHeight Balanced BSTВидеоBST InsertionВидеоInorder Successor & PredecessorВидеоBST DeletionВидеоPractice Problem 1 - Kth Smallest Element in BSTВидеоPractice Problem 2 - Lowest Common Ancestor of a Binary Search TreeВидеоPractice Problem 3 - Validate Binary Search TreeВидеоConclusion to the Course 'Advanced Data Structures and Problem-Solving Techniques'ЧтениеExploring Binary Search Trees (BST): Properties, Search, and ManipulationDIALOGUEBinary Search Tree - AssessmentЗаданиеFull Course Practice AssessmentЗаданиеFull Course AssessmentЗадание