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

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

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

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

Foundations of Data Structures and Algorithms in JavaScript

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

О курсе

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. This course will give you a solid foundation in data structures and algorithms, focusing on their implementation and analysis in JavaScript. You'll learn the core concepts of algorithm analysis, including time and space complexity, and apply these principles to solve complex coding problems. With practical exercises from Leetcode, you'll be able to enhance your coding and problem-solving skills. By the end of the course, you'll be proficient in implementing and analyzing fundamental data structures, such as arrays, linked lists, stacks, and hash tables. Each lesson builds on the previous one, allowing you to gradually gain confidence in tackling real-world coding challenges. The course begins with algorithm analysis concepts like Big O notation and moves through key data structures, such as arrays and linked lists, with Leetcode problem-solving exercises throughout. You'll also cover popular sorting algorithms, recursion, and advanced structures like hash tables. By tackling these topics step by step, you'll gain an understanding of how each data structure is used in software engineering and coding interviews. This course is ideal for those who want to develop a strong programming foundation in JavaScript and prepare for coding interviews. It’s perfect for individuals with an interest in computer science, software development, or those aiming to improve their problem-solving skills. No prior experience in data structures or algorithms is necessary, but familiarity with basic JavaScript is recommended. By the end of the course, you will be able to efficiently analyze algorithms, implement key data structures, solve challenging problems using Leetcode, and confidently approach technical interviews.

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

Data StructuresAlgorithmsJavascriptComputer ProgrammingProgramming PrinciplesMemory ManagementComputational ThinkingTheoretical Computer Science

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

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

01Course Introduction3 материалов

Course Introduction

Introduction to SpecializationВидеоIntroduction to the Course 'Foundations of Data Structures & Algorithms in JavaScript'ЧтениеFull Specialization ResourceЧтение
02Algorithm Analysis13 материалов

Algorithm Analysis

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

Packt - Course Instructors

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

Foundations of Data Structures and Algorithms in JavaScript
В каталоге вашей программы

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

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

Начать на Coursera

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

Обучение на Coursera

≈ 14.6 ч

7 модулей

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

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

Часть программы вашего университета
Introduction to Time & Space ComplexityВидео
What is Big O Notation?Видео
Checking If Big O Notation is Accessible in InterviewsВидео
Calculating Time Complexity Example 1Видео
Calculating Time Complexity Example 2Видео
Myths About Time ComplexityВидео
Calculating Time Complexity of Recursive CasesВидео
Recursive Time Complexity ExampleВидео
Introduction to Space ComplexityВидео
Space Complexity Example 1Видео
Recursive Space Complexity ExampleВидео
Fundamentals of Time and Space Complexity AnalysisDIALOGUE
Algorithm Analysis - AssessmentЗадание
03Arrays Theory + Array Practice Problems from Leetcode15 материалов

Arrays Theory + Array Practice Problems from Leetcode

What are Arrays and How Are They So Fast?ВидеоDrawbacks of ArraysВидеоHow Resizable Arrays Work?ВидеоResizable Array Implementation in JavaScriptВидеоResizable Array Complexity AnalysisВидеоPractice Problem 1 - Max Consecutive OnesВидеоPractice Problem 2 - Best Time to Buy and Sell a StockВидеоPractice Problem 3 - Product of Array Except SelfВидеоPractice Problem 4 - Maximum Sum SubarrayВидеоPractice Problem 5 - Maximum Product SubarrayВидеоPractice Problem 6 - Set Matrix ZeroesВидеоPractice Problem 7 - Valid SudokuВидеоPractice Problem 8 - Rotate ArrayВидеоUnderstanding Arrays and Their ApplicationsDIALOGUEArrays Theory + Array Practice Problems from Leetcode - AssessmentЗадание
04Sorting Theory + Sorting Practice Problems23 материалов

Sorting Theory + Sorting Practice Problems

Introduction to SortingВидеоBubble Sort WorkingВидеоBubble Sort ImplementationВидеоSelection Sort WorkingВидеоSelection Sort ImplementationВидеоInsertion Sort TheoryВидеоMerge Two Sorted Arrays TheoryВидеоMerge Two Sorted Arrays ImplementationВидеоMerge Sort TheoryВидеоMerge Sort ImplementationВидеоMerge Sort Complexity AnalysisВидеоTwo Way Partitioning AlgorithmВидеоTwo Way Partitioning ImplementationВидеоQuick Sort TheoryВидеоQuick Sort ImplementationВидеоCounting Sort AlgorithmВидеоCounting Sort ImplementationВидеоHow to Make Counting Sort StableВидеоPractice Problem 1 - Sort ColorsВидеоPractice Problem 2 - Majority ElementВидеоPractice Problem 3 - Move ZeroesВидеоUnderstanding and Comparing Sorting AlgorithmsDIALOGUESorting Theory + Sorting Practice Problems - AssessmentЗадание
05Linked List Theory + Leetcode Practice Problems17 материалов

Linked List Theory + Leetcode Practice Problems

Drawback of ArraysВидеоWhat is Linked List?ВидеоLinked List ImplementationВидеоInserting at the FrontВидеоInsert at the Front ImplementationВидеоIterating Over Linked ListВидеоIterating Over Linked List ImplementationВидеоPractice Problem 1 - Remove Nth Node from End of ListВидеоPractice Problem 2 - Linked List CycleВидеоPractice Problem 3 - Linked List Cycle IIВидеоPractice Problem 4 - Merge Two Sorted ListsВидеоPractice Problem 5 - Reverse Linked ListВидеоPractice Problem 6 - Palindrome Linked ListВидеоPractice Problem 7 - Intersection of Two Linked ListsВидеоPractice Problem 8 - Find Middle Element of Linked ListВидеоLinked Lists: Core Operations and Problem SolvingDIALOGUELinked List Theory + Leetcode Practice Problems - AssessmentЗадание
06Hash Table Theory + Leetcode Practice Problems11 материалов

Hash Table Theory + Leetcode Practice Problems

Introduction to Hash TableВидеоAdvantage of Hash TableВидеоHow is Hash Table Implemented?ВидеоPractice Problem 1 - Two SumВидеоPractice Problem 2 - Three SumВидеоPractice Problem 3 - Valid AnagramВидеоPractice Problem 4 - Longest Consecutive SequenceВидеоPractice Problem 5 - Contains DuplicateВидеоPractice Problem 6 - Group AnagramsВидеоUnderstanding Hash Tables and Their ApplicationsDIALOGUEHash Table Theory + Leetcode Practice Problems - AssessmentЗадание
07Stacks13 материалов

Stacks

What is Stack?ВидеоUsing Stack as an ArrayВидеоUsing Stack as a Linked List TheoryВидеоUsing Stack as a Linked List ImplementationВидеоPractice Problem 1 - Valid ParenthesisВидеоPractice Problem 2 - Min StackВидеоPractice Problem 3 - Next Greater Element IIВидеоPractice Problem 4 - Merge IntervalsВидеоConclusion to the Course 'Foundations of Data Structures & Algorithms in JavaScript'ЧтениеMastering Stack Data Structures and Real-World ApplicationsDIALOGUEStacks - AssessmentЗаданиеFull Course Practice AssessmentЗаданиеFull Course AssessmentЗадание