JavaScript Data Structures & Algorithms + LEETCODE Exercises

DSA + LEETCODE for Coding Interviews — Clear, Step-by-Step Animated Walkthroughs!

  • 0.0 (0 Reviews)
  • 0 Students
  • 231 Lessons
  • Scott Barrett

Course Overview

Welcome to Data Structures & Algorithms in JavaScript

This course makes learning to code fun and makes hard concepts easy to understand.

How did I do this?  By using animations!

Animating the Data Structures & Algorithms makes everything more visually engaging and allows students to learn more material - in less time - with higher retention (a pretty good combination).

I will use these visuals to guide you, step-by-step, through the entire course.

The course also includes dozens-and-dozens of Coding Exercises. So you can immediately put everything into practice as soon as you learn it (a very important step).

All of this will help you to feel more confident and prepared when you walk into a coding interview.

I have made several Free Sample Videos available for the course so you can see the difference the animations make.

Also, I am very active on the Q&A, so I will be with you every_step_of _the_way.

_____________________________


What you will get in this course…


Over 100 hand-crafted animated HD videos to illustrate the Data Structures & Algorithms.


Here are the topics we will cover:


Technical

  • Big O notation


Data Structures

  • Arrays

  • Linked Lists

  • Doubly Linked Lists

  • Stacks & Queues

  • Binary Trees

  • Hash Tables

  • Graphs

  • Heaps


Algorithms

  • Dynamic Programming

  • Sorting

    • Bubble Sort

    • Selection Sort

    • Insertion Sort

    • Merge Sort

    • Quick Sort

Searching

  • Breadth First Search

  • Depth First Search



Don't just take my word for it though, check out what existing students have to say about my courses:

  • 5-Star Review:
    "In order to describe this course accurately, we need the definition of the word Beautiful. beau·ti·ful: adjective 1.- pleasing the senses or mind aesthetically. 2.- of a very high standard; excellent."  - Josue Hernandez Amezcua

  • 5-Star Review:
    "The best course on DSA on Udemy" - Enlai Li

  • 5-Star Review:
    "One of the best courses on DSA. The animations do make a huge impact. All the points are explained in detail. The only problem is that I can't give it more than a 5-star rating." - Nikita Sarkar

  • 5-Star Review:
    "Amazing Course. My words cannot describe how much animations helped me to understand the concepts. 100% Recommended." - Simarjeet Singh

  • 5-Star Review:
    Being a visual learner this is BY FAR the BEST course ever. The way the instructor presents this topic makes it so easy to understand." - Eduardo SN

  • 5-Star Review:
    "The animations were really helpful for an easy understanding, but the best thing about this course for me is that it will not waste your time! It is perfectly optimized, covers the important topics that I wanted, and at the same time perfectly clear. Thank you so much." - Fatemeh Moghaddam

  • 5-Star Review:
    "This course is very well done! ... the animations in each video take the explanation and understanding of the material to a new level." - Luis Felipe Posada

  • 5-Star Review:
    "This course has seriously been amazing. The animations have worked wonders for my understanding and I have made significant progress from the beginning of the course until now." - Dakota Fabro

  • 5-Star Review:
    "I can follow as a beginner, amazing." - Sabrina Fung

  • 5-Star Review:
    "This is the best course I have ever seen" - Luong Viet Tri

REMEMBER… I'm so confident that you'll love this course that we're offering a FULL money-back guarantee for 30 days! So it's a complete no-brainer, sign up today with ZERO risk and EVERYTHING to gain.

So what are you waiting for? Click the "Buy now" button and join the best JavaScript Data Structures & Algorithms course on Udemy.

I look forward to seeing you in the course.

Now let's get started! :-)

See more

FAQ

FAQ area empty

Course curriculum

35 chương 231 bài học 9 giờ 34 phút 7 bài học thử miễn phí
Chương 1 Introduction
Chương 2 Big O
Chương 3 Classes & Pointers
  • Classes 5:53
  • Pointers 4:36
Chương 4 Linked Lists
  • Linked List: Intro 1:47
  • LL: Big O 6:14
  • LL: Under the Hood 2:39
  • LL: Constructor 7:13
  • Coding Exercises (Important)
  • LL: Push 5:43
  • LL: Pop - Intro 6:04
  • LL: Pop - Code 7:54
  • LL: Unshift 3:33
  • LL: Shift 5:18
  • LL: Get 3:47
  • LL: Set 4:43
  • LL: Insert 6:20
  • LL: Remove 4:57
  • LL: Reverse 5:54
  • Linked List Big O
Chương 5 <> LL: Coding Exercises
  • LL: Constructor
  • LL: Push
  • LL: Pop
  • LL: Unshift
  • LL: Shift
  • LL: Get
  • LL: Set
  • LL: Insert
  • LL: Remove
  • LL: Reverse
Chương 6 <> LL: Interview / Leetcode Exercises
  • LL: Find Middle Node 3:30
  • LL: Find Middle Node ( ** Interview Question)
  • LL: Has Loop 4:03
  • LL: Has Loop ( ** Interview Question)
  • LL: Find Kth Node From End 1:42
  • LL: Find Kth Node From End ( ** Interview Question)
  • LL: Remove Duplicates 3:24
  • LL: Remove Duplicates ( ** Interview Question)
  • LL: Binary to Decimal 6:18
  • LL: Binary to Decimal ( ** Interview Question)
  • LL: Partition List 4:35
  • LL: Partition List ( ** Interview Question)
  • LL: Reverse Betweeen 6:43
  • LL: Reverse Between ( ** Interview Question)
  • LL: Swap Pairs 4:26
  • LL: Swap Pairs ( ** Interview Question)
Chương 7 Doubly Linked Lists
  • DLL: Constructor 2:56
  • DLL: Push 3:56
  • DLL: Pop 7:08
  • DLL: Unshift 2:48
  • DLL: Shift 4:01
  • DLL: Get 4:29
  • DLL: Set 3:43
  • DLL: Insert 6:11
  • DLL: Remove 4:51
Chương 8 <> DLL: Coding Exercises
  • DLL: Constructor
  • DLL: Push
  • DLL: Pop
  • DLL: Unshift
  • DLL: Shift
  • DLL: Get
  • DLL: Set
  • DLL: Insert
  • DLL: Remove
Chương 9 <> DLL: Interview / Leetcode Exercises
  • DLL: Palindrome Checker 1:51
  • DLL: Palindrome Checker ( ** Interview Question)
  • DLL: Reverse 2:24
  • DLL: Reverse ( ** Interview Question)
  • DLL: Partition List 2:30
  • DLL: Partition List ( ** Interview Question)
  • DLL: Reverse Between ( ** Interview Question)
  • DLL: Swap Nodes in Pairs ( ** Interview Question)
Chương 10 Stacks & Queues
  • Stack: Intro 5:38
  • Stack: Constructor 2:59
  • Stack: Push 3:53
  • Stack: Pop 3:06
  • Queue: Intro 2:16
  • Queue: Constructor 1:58
  • Queue: Enqueue 3:13
  • Queue: Dequeue 3:25
  • Stacks & Queues Big O
Chương 11 <> S&Q: Coding Exercises
  • Stack: Constructor
  • Stack: Push
  • Stack: Pop
  • Queue: Constructor
  • Queue: Enqueue
  • Queue: Dequeue
Chương 12 <> S&Q: Interview / Leetcode Exercises
  • Stack: Push for a Stack That Uses an Array ( ** Interview Question)
  • Stack: Pop for a Stack That Uses an Array ( ** Interview Question)
  • Stack: Reverse String 0:46
  • Stack: Reverse String ( ** Interview Question)
  • Stack: Parentheses Balanced 3:38
  • Stack: Parentheses Balanced ( ** Interview Question)
  • Stack: Sort Stack 2:16
  • Stack: Sort Stack ( ** Interview Question)
  • Queue Using Stacks 2:13
  • Queue Using Stacks: Enqueue ( ** Interview Question)
  • Queue Using Stacks: Dequeue ( ** Interview Question)
Chương 13 Trees
  • Trees: Intro & Terminology 4:23
  • Binary Search Trees: Example 2:30
  • BST: Big O 6:54
  • BST: Constructor 3:39
  • BST: Insert - Intro 6:05
  • BST: Insert - Code 9:44
  • BST: Contains 8:30
  • BST Big O
Chương 14 <> BST: Coding Exercises
  • BST: Constructor
  • BST: Insert
  • BST: Contains
Chương 15 Hash Tables
  • Hash Table: Intro 5:22
  • HT: Collisions 2:39
  • HT: Constructor 4:57
  • HT: Set 4:51
  • HT: Get 4:45
  • HT: Keys 3:19
  • HT: Big O 2:06
  • HT: Interview Question 5:29
  • Hash Table Big O
Chương 16 <> HT: Coding Exercises
  • HT: Constructor
  • HT: Set
  • HT: Get
  • HT: Keys
Chương 17 <> HT: Interview / Leetcode Exercises
  • HT: Item In Common
  • HT: Find Duplicates ( ** Interview Question)
  • HT: First Non-Repeating Character ( ** Interview Question)
  • HT: Group Anagrams ( ** Interview Question)
  • HT: Two Sum ( ** Interview Question)
  • HT: Subarray Sum ( ** Interview Question)
  • Introduction to Sets
  • Set: Remove Duplicates
  • Set: Has Unique Chars ( ** Interview Question)
  • Set: Find Pairs ( ** Interview Question)
  • Set: Longest Consecutive Sequence ( ** Interview Question)
Chương 18 Graphs
  • Graph: Intro 4:02
  • Graph: Adjacency Matrix 3:17
  • Graph: Adjacency List 1:18
  • Graph: Big O 6:17
  • Graph: Add Vertex 3:10
  • Graph: Add Edge 3:15
  • Graph: Remove Edge 3:57
  • Graph: Remove Vertex 6:59
  • Graphs
Chương 19 <> Graph: Coding Exercises
  • Graph: Add Vertex
  • Graph: Add Edge
  • Graph: Remove Edge
  • Graph: Remove Vertex
Chương 20 Heaps
  • Heap: Intro 6:03
  • Heap: Insert (Intro) 4:40
  • Heap: Helper Methods 3:46
  • Heap: Insert (Code) 6:53
  • Heap: Remove 4:18
  • Heap: Sink Down 9:39
  • Heap: Priority Queues & Big O 4:17
Chương 21 Recursion
  • Recursion: Intro 6:30
  • Call Stack 6:16
  • Factorial 8:38
Chương 22 Recursive Binary Search Trees
  • RBST: Contains 6:45
  • RBST: Insert 6:45
  • RBST: Delete Intro 2:20
  • RBST: Delete Code (1 of 3) 6:19
  • RBST: Delete Code (2 of 3) 5:35
  • RBST: Minimum Value 4:11
  • RBST: Delete Code (3 of 3) 5:24
Chương 23 Tree Traversal
  • Tree Traversal: Intro 1:56
  • BFS (Breadth First Search): Intro 3:38
  • BFS: Code 5:33
  • DFS (Depth First Search): PreOrder - Intro 1:19
  • DFS: PreOrder - Code 6:31
  • DFS: PostOrder - Intro 2:14
  • DFS: PostOrder - Code 4:54
  • DFS: InOrder - Intro 1:47
  • DFS: InOrder - Code 4:21
Chương 24 <> BST Traversal: Coding Exercises
  • BST: Breadth First Search (BFS)
  • BST: DFS PreOrder
  • BST: DFS PostOrder
  • BST: DFS InOrder
Chương 25 Basic Sorts
  • Bubble Sort: Intro 2:25
  • Bubble Sort: Code 2:38
  • Selection Sort: Intro 2:56
  • Selection Sort: Code 4:58
  • Insertion Sort: Intro 1:24
  • Insertion Sort: Code 4:38
  • Insertion Sort: Big O 1:31
  • Basic Sorts
Chương 26 <> Basic Sorts: Coding Exercises
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
Chương 27 <> Basic Sorts: Interview / LeetCode Exercise
  • Bubble Sort of LL ( ** Interview Question)
  • Selection Sort of LL ( ** Interview Question)
  • Insertion Sort of LL ( ** Interview Question)
Chương 28 Merge Sort
  • Merge Sort: Overview 1:45
  • Merge: Intro 1:37
  • Merge: Code 3:26
  • Merge Sort: Intro 1:19
  • Merge Sort: Code 11:54
  • Merge Sort: Big O 2:49
Chương 29 <> Merge Sort: Coding Exercises
  • Merge
  • Merge Sort
Chương 30 <> Merge: Interview / LeetCode Exercise
  • LL: Merge Two Sorted Lists ( ** Interview Question)
Chương 31 Quick Sort
  • Quick Sort: Intro 2:32
  • Pivot: Intro 3:00
  • Pivot: Code 4:19
  • Quick Sort: Code 3:53
  • Quick Sort: Big O 3:36
Chương 32 <> Quick Sort: Coding Exercises
  • Pivot
  • Quick Sort
Chương 33 Dynamic Programming
  • Overlapping Subproblems 4:51
  • Optimized Substructure 3:27
  • Fibonacci Sequence 9:20
  • Memoization 11:44
  • Bottom Up 6:04
Chương 34 <> Array: Interview / LeetCode Exercises
  • Array: Remove Element ( ** Interview Question)
  • Array: Find Max Min ( ** Interview Question)
  • Array: Find Longest String ( ** Interview Question)
  • Array: Remove Duplicates ( ** Interview Question)
  • Array: Max Profit ( ** Interview Question)
  • Array: Rotate ( ** Interview Question)
  • Array: Max Sub Array ( ** Interview Question)
Chương 35 Coding Exercises
  • Coding Exercises Are Now After Each Section - (CLICK HERE FOR MORE INFO)

Requirment

  • Basic JavaScript programming knowledge (e.g., variables, loops, functions)

  • No prior experience with data structures or algorithms needed

  • An eager attitude to learn DSA and tackle coding challenges

Outcomes

  • Solve 86 coding exercises to ace DSA interviews with confidence.

  • Think like a pro coder to tackle complex problems efficiently.

  • Master data structures—linked lists, trees, heaps, graphs—for practical use.

  • Learn algorithms—sorting, recursion, dynamic programming—with clarity.

  • Analyze time and space complexity to optimize your coding solutions.

  • Grasp DSA concepts faster with animated examples for deeper insight.

  • Apply DSA to solve LeetCode challenges and practical coding problems.

  • Boost your developer skills to excel in technical interviews confidently.

Instructor

...
Scott Barrett

0.0

  • ... 0 Student
  • ... 2 Courses
  • ... 0 review

View Details

Reviews

Rate this course :

Remove all