![70+ JavaScript Challenges - Data Structures and Algorithms [Video]](https://content.packt.com/V21917/cover_image_small.jpg)
70+ JavaScript Challenges - Data Structures and Algorithms [Video]
Subscription
FREE
Video + Subscription
$29.99
Video
$24.99
What do you get with a Packt Subscription?
What do you get with a Packt Subscription?
What do you get with Video + Subscription?
What do you get with a Packt Subscription?
What do you get with eBook?
What do I get with Print?
What do I get with Print?
What do you get with video?
What do you get with Audiobook?
Subscription
FREE
Video + Subscription
$29.99
Video
$24.99
What do you get with a Packt Subscription?
What do you get with a Packt Subscription?
What do you get with Video + Subscription?
What do you get with a Packt Subscription?
What do you get with eBook?
What do I get with Print?
What do I get with Print?
What do you get with video?
What do you get with Audiobook?
-
Free ChapterIntroduction
-
Basic Challenges Part 1
-
Basic Challenges Part 2
-
Higher Order Array Methods
-
Recursion
-
Time and Space Complexity
-
Hash Tables, Maps, and Sets
-
Stacks, Queues, and Linked Lists
- What Is A Stack?
- Stack Implementation
- Reverse String Using A Stack
- Balanced Parenthesis
- What Is A Queue?
- Queue Implementation
- Reverse String With A Queue
- Palindrome With A Queue & Stack
- What Is A Linked List?
- Linked List Implementation
- Reverse String With A Linked List
- Fast & Slow Pointers
- Find Middle
- What Is A Doubly Linked List?
- Doubly Linked List Implementation - Part 1
- Doubly Linked List Implementation - Part 2
- Find Pair Sum
-
Binary Trees, BST, and Graphs
- What Is a Tree / Binary Tree?
- Tree Node Class
- Depth-First Traversal
- Depth-First Traversal Using Recursion
- Breadth-First Traversal
- Maximum Depth
- What Is A Binary Search Tree?
- Binary Search Tree Implementation - Part 1
- Binary Search Tree Implementation - Part 2
- Validate BST
- What Is A Graph?
- Adjacency Matrix & Adjacency List
- Graph Implementation
- Graph Traversal Visualization
- Graph Depth-First Traversal
- Graph Breadth-First Traversal
-
Sorting Algorithms
-
Wrap Up
About this video
This course seamlessly interweaves foundational knowledge with hands-on coding challenges to ensure a thorough grasp of the subject. Start with an introduction to DSA's significance, and then immerse yourself in hands-on exercises like "Hello World" to ease into the coding mindset. Delve deeper as you explore arrays, manipulating strings, solving common challenges. Further on, refine your coding finesse as you navigate through hash tables, maps, and sets, crafting elegant solutions to intricate problems like anagram grouping.
But this course doesn't stop at surface-level coding practices. Dive into the depths of intricate data structures like stacks, queues, and linked lists. Experience the beauty of tree structures, binary search trees, and graphs, understanding their traversal and practical applications. Writing code is just half the battle. Understanding the efficiency and optimization of your code is paramount. Grasp the concepts of time and space complexity, and familiarize yourself with iconic sorting algorithms, from bubble sort to quick sort.
By the end of this course, you will have journeyed from the basic constructs of data structures to the intricate maze of algorithms, all the while understanding their real-world applicability and performance nuances.
- Publication date:
- October 2023
- Publisher
- Packt
- Duration
- 12 hours 28 minutes
- ISBN
- 9781835468814