Course Introduction | Data Structures and Algorithms in JavaScript + 100 LEETCODE Problems

Book Overview & Buying
Table Of Contents

Data Structures and Algorithms in JavaScript + 100 LEETCODE Problems

By : Pratik Singhal

Buy this Video

Data Structures and Algorithms in JavaScript + 100 LEETCODE Problems

By: Pratik Singhal

Buy this Video

Overview of this book

In today’s tech world, mastering data structures and algorithms is crucial. This course offers a hands-on approach to learning JavaScript-based implementations of key algorithms and data structures, paired with 100 Leetcode problems to solidify your skills. It starts with algorithm analysis, covering time and space complexity, then moves on to essential topics like arrays, sorting algorithms, linked lists, and dynamic programming. You'll dive into binary trees, heaps, and binary search trees while solving practical coding exercises. The course focuses on not just theoretical knowledge, but also practical application, preparing you for real-world technical challenges. By the end of the course, you will have a deep understanding of how to implement and optimize algorithms in JavaScript. You'll be well-prepared for coding interviews at top tech companies and confident in your ability to solve complex algorithmic problems. Whether you're a beginner or someone looking to brush up on your skills, this course offers the structure, resources, and practice to succeed.

Course Introduction

How to Get Started with Leetcode?

Algorithm Analysis

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

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

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

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

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

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

Queue

What is Queue?

Queue Using Linked List

Queue Implementation

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

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

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

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

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

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

Dynamic Programming

Introduction to Dynamic Programming

Dynamic Programming Implementation

Top Down vs Bottom Up

Practice Problem 1 - Climbing Stairs

Practice Problem 2 - Jump Game

Practice Problem 3 - Coin Change

Practice Problem 4 - Target Sum

Practice Problem 5 - Longest Increasing Subsequence

Practice Problem 6 - Longest Common Subsequence

Practice Problem 7 - House Robber

Practice Problem 8 - House Robber II

Practice Problem 9 - 0-1 Matrix

Practice Problem 10 - Integer Replacement

Practice Problem 11 - Decode Ways

Practice Problem 12 - Partition Equals Subset Sum

Practice Problem 13 - Longest Palindromic Substring

Practice Problem 14 - Min Cost Climbing Stairs

Greedy Algorithms

Introduction to Greedy Algorithms

Graphs

What are Graphs?

Directed vs Undirected Graphs

Weighted vs Unweighted Graphs

Terms of Graphs Part 1

Types of Graphs Part 1

Types of Graphs Part 2

Implementing Graphs Part 1

Implementing Graphs Part 2

Implementing Graphs Part 3

Adjacency Matrix Demonstration

Adjacency List Implementation Demonstration

Introduction to Traversals

BFS Working

BFS Implementation

BFS Property #1

BFS over Binary Weighted Graphs

Introduction to DFS

DFS Iterative Implementation

DFS Recursive Implementation

DFS Important Properties

Cycle Detection Part 1

Cycle Detection Part 2

Cycle Detection Part 3

Cycle Detection Implementation

What is Topological Sorting?

Topological Sorting Example 1

Single Source Shortest Path Algorithm

Djikstra's Algorithm

Djikstra's Algorithm Implementation

Introduction to Bellman-Ford Algorithm

Bellman-Ford Algorithm Working

Bellman-Ford Algorithm Implementation

Introduction to Minimum Spanning Tree

Prim's Algorithm

Practice Problem 1 - Course Schedule

Practice Problem 2 - Number of Islands

Practice Problem 3 - Find the Town Judge

Practice Problem 4 - Surrounded Regions

Practice Problem 5 - Number of Enclaves

Practice Problem 6 - Network Delay Time

Practice Problem 7 - Flood Fill

Backtracking

What is Backtracking?

Backtracking Example 1

Practice Problem 1 - Subsets

Practice Problem 2 - Combination Sum

Practice Problem 3 - N Queens

Bitmagic

Introduction to Bitwise Operators

Common Bitwise Operators

Practice Problem 1 - Single Number

Practice Problem 2 - Counting Bits

Practice Problem 3 - Sum of Two Integers

Practice Problem 4 - Missing Numbers

Practice Problem 5 - Divide Two Integers

Practice Problem 6 - Reverse Integer

Practice Problem 7 - Number of 1 Bits

Practice Problem 8 - Find the Duplicate Number

Data Structures and Algorithms in JavaScript + 100 LEETCODE Problems

By : Pratik Singhal

Data Structures and Algorithms in JavaScript + 100 LEETCODE Problems

By: Pratik Singhal

Overview of this book

Confirmation

Buy this book with your credits?

Submit Your Feedback

Create a Free Account To Continue Reading

Sign in to activate your 7-day free access