Module 01: Getting Stated DSA for Jobs and JavaScript Live Class
Course Outline
Communication Channel Details
Live Class 01 – JavaScript Environment Setup & Variables01:11:26
Live Class 02 – JavaScript Data Types and Type Coercion.01:08:38
Live Class 03 – Arrays in JavaScript01:01:16
Live Class 04 – General Loops, Nested Loops and Two Dimentional Arrays.01:01:51
Live Class 05 – Conditionals in JavaScript01:09:43
Live Class 06 – Functions in JavaScript Part-0100:56:38
Live Class 07 – Functions in JavaScript Part-0201:00:24
Live Class 08 – Object Literal in JavaScript01:01:03
Live Class 09 – Execution Context in JavaScript00:47:04
Live Class 10 – Assignment and Array Methods (Map, Filter, Every, Some)00:57:58
Conceptual Live Class 01 – Modeling a Bank Application01:10:10
Live Class 11 – JavaScript Array Mdethods (Reduce, Sort)00:51:59
Live Class 12 – Object Oriented Programming with JavaScript01:11:41
Conceptual Live Class 02 – Minimal Database00:47:21
Module 02 Week 1: Array & Searching
Lecture 1: Array & Linear Search
Lecture 2: Binary Search
Lecture 3: Leetcode – Searching Question Practice
Module 03 Week 2: Complexity Analysis & Two-Pointer Algorithm
Lecture 4: Complexity Analysis
Lecture 5: Two Pointer Algorithm
Lecture 6: Leetcode – Two Pointer Question Practice
Module 04 Week 3: Hash Table & Hash Map
Lecture 7: Hash Table
Lecture 8: Hash Map
Lecture 9: Leetcode – Hash Map Question Practice
Module 05 Week 4: Voting Algorithm & Recursion
Lecture 10: Majority Voting Algorithm & Problem Solving
Lecture 11: Introduction to Recursion
Lecture 12: Recursion Practice
Module 06 Week 5: Recursion & Backtracking
Lecture 13: Recursion Math Problems Practice
Lecture 14: Leetcode – Recursion Question Practice
Lecture 15: Backtracking Algorithm
Module 07 Week 6: Backtracking & Sorting
Lecture 16: Leetcode – Backtracking Question Practice
Lecture 17: Bubble Sort & Selection Sort
Lecture 18: Merge Sort
Module 08 Week 7: Sorting & Linked List Intro
Lecture 19: Quick Sort
Lecture 20: Cycle Sort & Leetcode Problem Practice
Lecture 21: Understanding Linked List
Module 09 Week 8: Linked List in Depth
Lecture 22: Linked List CRUD operation
Lecture 23: Doubly & Circular Linked List
Lecture 24: Leetcode – Linked List Question Practice
Module 10 Week 9: Stack, Queue & DEQueue
Lecture 25: Stack
Lecture 26: Queue & DEQueue
Lecture 27: Leetcode – Stack & Queue Question Practice
Module 11 Week 10: Greedy Algorithm, KMP Algorithm & Binary Tree
Lecture 28: Greedy Algorithm
Lecture 29: KMP Algorithm (String) & Leetcode Problems
Lecture 30: Binary Tree Introduction
Module 12 Week 11: BFS, DFS & BST
Lecture 31: Breadth First Search (BFS)
Lecture 32: Tree Traversal & Depth First Search (DFS)
Lecture 33: Binary Search Tree (BST)
Module 13 Week 12: AVL & Segment Tree
Lecture 34: AVL Tree
Lecture 35: Segment Tree
Lecture 36: Leetcode – Binary Tree Problem Practice
Module 14 Week 13: Heap & Priority Queue Problems
Lecture 37: Heap
Lecture 38: Heap Sort & Priority Queue
Lecture 39: Leetcode – Heaps Problem Practice
Module 15 Week 14: Graph Algorithms & Traversing Techniques
Lecture 40: Graph Building
Lecture 41: Graph Traversal – BFS
Lecture 42: Connected Component & DFS
Module 16 Week 15: Advance Graph Algorithms: Part-1
Lecture 43: Cycle Detection in a Graph & Leetcode Problems
Lecture 44: Bipartite Graph & Shortest Path Finding
Lecture 45: Topological Sort & Leetcode – Graph Problem Practice
Module 17 Week 16: Advance Graph Algorithms: Part-2
Lecture 34: Segment Tree
Lecture 35: Heap
Lecture 36: Heap Sort & Priority Queue
Module 18 Week 17: Introduction To Dynamic Programming
Module 13 Week 12: Segment Tree, Heap & Priority Queue
Module 14 Pre-recorded: JavaScript Essentials
Setting Up Environment00:04:07
Showing JavaScript Output00:06:12
Variable and Constant00:08:14
Naming a Variable00:06:27
Comments in JavaScript00:03:28
Understanding Data Types00:02:34
Data Types in JavaScript00:09:23
Implicit Type Coersion00:09:44
Truthy Value Falsy Value00:04:56
Number and Math methods00:10:50
String Methods00:11:09
Understanding Array00:05:17
Array Iteration00:07:26
Introduction to Array Methods00:06:46
Multi Dimention Array00:05:07
Intro to Operators00:03:12
Arithmetic Operators00:06:06
Assignment Operators00:04:22
Comparison Operators00:07:15
Understaing Control Structures00:04:26
Else If00:05:37
If Statements00:04:36
Switch Statements00:06:44
Intro_Loops00:05:15
For Loops00:13:20
While Loops00:07:45
For Each Loop00:09:03
For Of Loop00:3:35
Break and Continue00:04:14
FizzBuzz Problem00:06:12
Module 15 Pre-recorded: Introduction to DSA
Importance of DSA00:07:26
DSA Outline00:11:36
What is DSA00:11:30
Code Share on Github00:00:45
Module 16 Pre-recorded: Array
Array Introduction00:15:14
Leetcode – Rotate Array00:36:46
Module 17 Pre-recorded: Searching
Linear Search00:09:39
Binary Search00:30:22
Impact of a good Algorithm00:15:47
Order Agnostic Binary Search00:04:59
Order Agnostic Binary Search_100:06:57
Search insert position00:29:22
Leetcode – 365. Valid Perfect Square00:18:16
Module 18 Pre-recorded: Complexity Analysis
Time Complexity00:41:14
Space Complexity00:14:12
Module 19 Pre-recorded: Two Pointer Algorithm
What is two pointer algorithm00:08:53
Reverse Array_100:10:14
Palindrome testing00:08:34
Two Sum00:24:57
Merge Two Array00:10:22
Module 20 Pre-recorded: OOP Basics
Module 21 Pre-recorded: Hashing
Journey from O(N) to O(1)_100:12:31
Hash Table – Part 100:17:29
Hash Table part-200:20:33
Hash Map00:16:32
Number to English00:12:14
Leetcode – Check if pangram00:13:37
Leetcode – 2351. First letter to appear twice00:14:39
Leetcode – 169. Majority Element00:08:02
Module 22 Pre-recorded: Majority Voting Algorithm
Moorey Majority Voting Algorithm00:21:32
Module 23 Pre-recorded: Recursion
Introduction to Recursion00:41:27
Recursion on Tree (Theory)00:24:04
Sum of 1 to N00:21:22
Factorial00:16:49
Iterate Array using Recursion_100:08:44
Sum of Array00:13:35
Reverse Array00:11:20
Palindrome test00:17:17
Binary Search00:13:25
Skip Character00:12:08
Subset of string00:28:16
Module 24 Pre-recorded: Backtracking
Recursion vs Backtracking00:06:05
Matrix or 2D array00:17:12
N-Queen Problem00:49:03
Module 25 Pre-recorded: Dynamic Programming
Dynamic Programming00:37:11
Module 26 Pre-recorded: Sorting
Bubble Sort00:18:10
Selection Sort00:08:23
Merge Sort00:28:16
Quick Sort00:22:20
Cycle Sort00:24:28
Problem Solving00:37:41
Module 27 Pre-recorded: Linked List
Introduction to Linked List00:20:37
Create and insert in Linked List00:17:54
Traverse Linked List00:12:19
Update Node in Linked List00:10:48
Delete Node in Linked List00:29:40
Types of Linked List00:13:08
Cycle in a Linked List00:09:12
Delete node in linked list00:12:48
Module 28 Pre-recorded: Stack
Module 29 Pre-recorded: Queue
Module 30 Pre-recorded: DE-Queue
Module 31 Pre-recorded: Binary Tree
Introduction to tree00:08:35
Types of Binary Tree00:12:37
Create Binary Tree00:27:28
BST Searching00:35:01
BST Recursive Search00:10:39
Tree Traversing – BFS vs DFS00:11:18
BFS Traversing00:38:54
DFS Traversing00:25:52
BST Problem Solving idea00:07:14