Mastering DSA with JavaScript

Name: Mastering DSA with JavaScript
Availability: InStock
Author: FreeAcademy

Intermediate

Assumes foundational knowledge. Builds on basics.

Dive deep into essential data structures and algorithms, implementing them in JavaScript. Learn arrays, strings, linked lists, stacks, queues, hash tables, trees, graphs, and key algorithmic techniques including recursion, sorting, searching, and dynamic programming.

Please sign in to enroll in this course

Course Content

8 modules • 92 lessons

Module 1: Introduction to DSA and Core Concepts

9 lessons

1.1

Mastering DSA with JavaScript

Course Content

Module 1: Introduction to DSA and Core Concepts

What Are Data Structures?

What Are Algorithms?

Why Learn DSA?

Big O Notation: An Introduction

Analyzing Time Complexity

Analyzing Space Complexity

Best, Average, and Worst Case Scenarios

How to Use This Course

Solutions and Code Examples

Module 2: Foundational Data Structures

Array Definition & JavaScript Arrays

Basic Array Operations (Insert, Delete, Access)

Challenge: Manual Array Insertion

Challenge: Manual Array Deletion

Multi-dimensional Arrays

Challenge: Rotate N×N Matrix by 90°

String Basics & Immutability

Common String Methods & Their Complexity

Challenge: String Reversal

Challenge: Palindrome Checker

Challenge: Anagram Detector

Node and Linked List Structure

Types of Linked Lists (Singly, Doubly, Circular)

Linked List Operations (Insertion, Deletion, Traversal)

Challenge: Detect a Cycle in a Linked List

Challenge: Merge Two Sorted Linked Lists

Challenge: Reverse a Linked List

Set Definition & Characteristics

JavaScript `Set` Object & Basic Operations

Set Operations (Union, Intersection, Difference)

Set Use Cases & Time Complexity

Challenge: Find Unique Elements

Module 3: Abstract Data Types (ADTs)

Stack Theory: LIFO Principle

Stack Implementations (Array-based, Linked List-based)

Stack Applications (Call Stack, Undo/Redo)

Challenge: Balanced Parentheses

Queue Theory: FIFO Principle

Queue Implementations (Array-based, Linked List-based)

Queue Applications (Task Scheduling, BFS)

Challenge: Implement a Queue

Hashing Concepts and Principles

Collision Resolution Techniques (Chaining, Open Addressing)

Hash Table Operations (Insert, Delete, Search)

JavaScript Map and Object as Hash Tables

Challenge: Two Sum

Module 4: Trees

Tree Terminology (Root, Node, Leaf, Depth, Height)

Types of Trees (General Tree, Binary Tree)

Binary Tree Properties and Characteristics

Binary Tree Traversals (Inorder, Preorder, Postorder, BFS)

Introduction to BSTs

BST Properties and Rules

BST Operations (Insert, Delete, Search)

Heap Properties and Types (Min-Heap, Max-Heap)

Heap Operations (Insert, Extract-Min/Max, Heapify)

Heap Applications (Priority Queues, Heap Sort)

The Need for Balanced Trees (AVL, Red-Black - conceptual)

Challenge: Check if a Binary Tree is Balanced

Challenge: Implement AVL Rotations

Trie Theory and Structure

Trie Operations and Applications (Autocomplete, Spell Checker)

Module 5: Graph Theory

Graph Terminology (Vertex, Edge, Directed, Weighted)

Graph Representations (Adjacency Matrix, Adjacency List)

Breadth-First Search (BFS)

Depth-First Search (DFS)

Dijkstra's Algorithm

Bellman-Ford & Floyd-Warshall (Introduction)

Prim's Algorithm

Kruskal's Algorithm

Topological Sort Algorithm and Applications

Union-Find Operations and Data Structure

Module 6: Algorithmic Paradigms & Techniques

Recursion Basics: Base Case & Recursive Step

Recursion Applications and Tracebacks

Linear Search