Data Structures Algorithm DSA | Python+Javascript LEETCODE

Ultimate 25 days coding interview bootcamp. DSA, BigO, Coding Interview Patterns Python Javascript Get the job you want!


What you’ll learn

  • Common Data Structures such as Arrays, Hash Table,Linked List,Binary trees,Graphs etc.
  • Real Coding Interview Questions from Google, Meta,Amazon,Netflix ,Microsoft etc.
  • Time and Space Complexity of Algorithms, Detailed Discussion of Logic to solve questions
  • Code Implementation in Javascript, Python

This course includes:

  • 39 hours on-demand video
  • 84 coding exercises
  • 63 articles
  • 101 downloadable resources
  • Access on mobile and TV
  • Certificate of completion

Top companies offer this course to their employeesThis course was selected for our collection of top-rated courses trusted by businesses worldwide. 

Nasdaq
Volkswagen
Box
NetApp
Eventbrite

Course content

26 sections • 322 lectures • 39h 58m total lengthCollapse all sections

Day 1: Arrays Data Structures and Algorithms22 lectures • 2hr 14min

  • Welcome! How to make best use of this coursePreview02:34
  • Day 1 Goals00:35
  • Introduction to Data StructuresPreview04:34
  • Introduction to Big O, Time Complexity14:01
  • 2 Asymptotic Analysis and Big O16:36
  • Big O Space Complexity03:50
  • Big O Logarithm05:12
  • Arrays: Data Structures Crash Course13:21
  • Set up, Using Debugger03:00
  • Coding Interview Q1: Sorted Squared Array04:46
  • Coding Exercise – Python : Sorted Squared Array1 question
  • Coding Exercise – JS: Sorted Squared Array1 question
  • Method 1, Big O Analysis03:05
  • JS- Code our solution04:43
  • JS – Code walkthrough and Big O analysis04:15
  • Python Code and Big O analysis03:00
  • Method 207:29
  • Javascript – Code our solution06:22
  • Javascript – Code walkthrough and Big O analysis05:16
  • PYTHON Code and Big O analysis05:48
  • Coding Interview Q2: Monotonic Array05:14
  • Coding Exercise – Python: Monotonic Array1 question
  • Coding Exercise – JS: Monotonic Array1 question
  • Method and Big O analysis07:17
  • Javascript – Code the solution, Big O analysis07:03
  • PYTHON – Code and Big O analysis06:11

Day 2: Arrays Data Structures and Algorithms15 lectures • 1hr 31min

  • Day 2 Goals00:31
  • Coding Interview Q1: Rotate ArrayPreview02:37
  • Coding Exercise – Python: Rotate Array1 question
  • Coding Exercise – JS: Rotate Array1 question
  • Method and Big O analysisPreview11:59
  • Code the solution05:15
  • PYTHON Code Solution05:36
  • Python Code Method 203:51
  • Coding Interview Q2: Container with most water09:08
  • Coding Exercise – Python: Container with most water1 question
  • Coding Exercise – JS: Container with most water1 question
  • Method 1 and Big O analysis10:54
  • Code the solution04:17
  • Code walkthrough and Big O analysis05:26
  • PYTHON Code Method 107:02
  • Method 2 and Big O analysis10:06
  • Code the solution04:08
  • Code walkthrough05:51
  • PYTHON Code Method 204:28


Day 3: Hash Tables Data Structures and Algorithms15 lectures • 1hr 36min

  • Day 3 Goals00:33
  • Hash Table: Data Structures Crash Course13:25
  • Coding Interview Q1: Two Sum04:45
  • Coding Exercise – Python: Two Sum1 question
  • Coding Exercise – JS: Two Sum1 question
  • Method 1, Big O analysis07:46
  • Coding the solutions05:48
  • Code Walkthrough03:11
  • PYTHON Code03:06
  • Method 2, Big O analysis09:26
  • Coding the solution07:33
  • Code Walkthrough05:09
  • PYTHON Code03:44
  • Coding Interview Q2: Isomorphic Strings04:30
  • Coding Exercise – Python: Isomorphic Strings1 question
  • Coding Exercise – JS: Isomorphic Strings1 question
  • Method and Big O analysis09:32
  • Code the solution11:23
  • PYTHON Code06:05

Day 4 : Recursion Algorithms18 lectures • 1hr 50min

  • Day 4 Goals00:53
  • Coding Interview Q1: Fibonacci04:59
  • Coding Exercise – Python: Fibonacci1 question
  • Coding Exercise – JS: Fibonacci1 question
  • Method 1 and Big O analysis18:09
  • Code 102:22
  • Code walkthrough 104:33
  • PYTHON Code04:52
  • Method 2 and Big O analysis12:01
  • Code 205:47
  • PYTHON Code04:13
  • Method 3 and Big O analysis09:31
  • Code 302:43
  • Code walkthrough 302:52
  • PYTHON Code03:23
  • Coding Interview Q2: Power Sum06:34
  • Coding Exercise – Python: Power Sum1 question
  • Coding Exercise – JS: Power Sum1 question
  • Method and Big O analysis11:01
  • Code04:25
  • Code walkthrough06:20
  • PYTHON Code05:48

Day 5: Recursion Algorithms11 lectures • 1hr 44min

  • Day 5 Goals00:17
  • Coding Interview Q1: PermutationsPreview02:10
  • Coding Exercise – Python: Permutations1 question
  • Coding Exercise – JS: Permutations1 question
  • Method and Big O analysisPreview26:09
  • Code05:46
  • Code Walkthrough13:08
  • PYTHON code10:54
  • Coding Interview Q2: All Sub sets(Power set)02:39
  • Coding Exercise – Python: All Sub sets ( Power set)1 question
  • Coding Exercise – JS: All Sub sets ( Power set)1 question
  • Method and Big O analysis18:01
  • Code04:29
  • Code walkthrough11:38
  • PYTHON code08:40

Day 6 : Strings Data Structures and Algorithms24 lectures • 1hr 25min

  • Day 6 Goals00:20
  • Data Structures Crash Course: Strings04:08
  • Coding Interview Q1: First Non Repeating Character03:08
  • Coding Exercise – Python: First Non Repeating Character1 question
  • Coding Exercise – JS: First Non Repeating Character1 question
  • Method 1 and Big O analysis04:54
  • Code06:30
  • Code walkthrough04:49
  • PYTHON code03:44
  • Method 2 and Big O analysis05:37
  • Code06:17
  • Code walkthrough04:27
  • PYTHON code04:56
  • Coding Interview Q2: Is Palindrome ?03:02
  • Coding Exercise- Python: Is Palindrome?1 question
  • Coding Exercise- JS: Is Palindrome?1 question
  • Method 1 and Big O analysis04:57
  • Code03:01
  • Code Walkthrough02:32
  • PYTHON code02:30
  • Method 2 and Big O analysis02:35
  • Code01:36
  • Code Walkthrough01:45
  • PYTHON code01:51
  • Method 3 and Big O analysis04:19
  • Code04:36
  • Code Walkthrough01:51
  • PYTHON code01:53

Day 7: Strings Data Structures and Algorithms10 lectures • 1hr 14min

  • Day 7 Goals00:21
  • Coding Interview Q1: Longest Sub string with Unique characters02:31
  • Coding Exercise – Python: Longest Sub string with Unique characters1 question
  • Coding Exercise – JS: Longest Sub string with Unique characters1 question
  • Method and Big O analysis16:04
  • Code07:51
  • Code walkthrough07:32
  • PYTHON code10:58
  • Coding Interview Q2: Group Anagrams01:50
  • Coding Exercise – Python: Group Anagrams1 question
  • Coding Exercise – JS : Group Anangrams1 question
  • method and Big O analysis07:31
  • code11:42
  • PYTHON code07:50


Day 8: Searching Algorithms11 lectures • 1hr 29min

  • Day 8 Goals00:44
  • Coding Interview Q1 : Binary Search Algorithm05:23
  • Coding Exercise – Python: Binary Search Algorithm1 question
  • Coding Exercise – JS: Binary Search Algorithm1 question
  • Method and Big O analysis16:01
  • Code Iterative08:15
  • Code Recursive11:02
  • PYTHON Code Iterative03:52
  • PYTHON Code Recursive04:36
  • Coding Interview Q2: Search in rotated sorted array04:32
  • Coding Exercise – Python: Search in rotated sorted array1 question
  • Coding Exercise – JS: Search in rotated sorted array1 question
  • Method and Big O analysis16:13
  • Code13:26
  • PYTHON Code05:23

Day 9: Searching Algorithms11 lectures • 1hr 49min

  • Day 9 Goals00:33
  • Coding Interview Q1: Search for range02:46
  • Coding Exercise – Python: Search for range1 question
  • Coding Exercise – JS: Search for range1 question
  • Method and Big O analysis13:31
  • Code Recursive19:22
  • PYTHON Code – Recursive12:20
  • Code Iterative13:14
  • PYTHON Code – Iterative06:35
  • Coding Interview Q2: Search in Matrix02:48
  • Coding Exercise – Python: Search in Matrix1 question
  • Coding Exercise – JS: Search in Matrix1 question
  • method and Big O analysis09:01
  • code15:34
  • PYTHON code12:54

Day 10: Sorting Algorithms10 lectures • 1hr 6min

  • Day 10 Goals00:17
  • Coding Interview Q1: Bubble Sort Algorithm01:55
  • Coding Exercise – Python: Bubble Sort Algorithm1 question
  • Coding Exercise – JS: Bubble Sort Algorithm1 question
  • Method and Big O analysis09:03
  • Code07:26
  • Code Walkthrough06:20
  • Python Code06:34
  • Coding Interview Q2: Insertion Sort Algorithm, Big O analysis10:50
  • Coding Exercise – Python: Insertion Sort Algorithm1 question
  • Coding Exercise – JS: Insertion Sort Algorithm1 question
  • Code12:41
  • Python code09:22
  • Insertion sort is a stable sorting Algorithm01:29

Day 11: Sorting Algorithms9 lectures • 1hr 7min

  • Day 11 Goals00:17
  • Coding Interview Q1: Selection Sort Algorithm, Big O analysis09:58
  • Coding Exercise – Python: Selection Sort Algorithm1 question
  • Coding Exercise – JS: Selection Sort Algorithm1 question
  • JS Code08:49
  • Python Code01:03
  • Coding Interview Q2: Merge Sort Algorithm11:39
  • Coding Exercise – Python: Merge Sort Algorithm1 question
  • Coding Exercise – JS: Merge Sort Algorithm1 question
  • Method and Big O analysis15:43
  • JS Code09:09
  • JS Code Walkthrough08:33
  • Python Code02:06

Day 12: Sorting Algorithms11 lectures • 2hr 32min

  • Day 12 Goals00:17
  • Coding Interview Q1: Quick Sort Algorithm14:22
  • Coding Exercise – Python: Quick Sort Algorithm1 question
  • Coding Exercise – JS: Quick Sort Algorithm1 question
  • Optimise Time Complexity13:57
  • Optimise Space Complexity21:43
  • JS Code17:22
  • Call stack walkthrough06:49
  • JS Code walkthrough07:07
  • Python Code01:34
  • Coding Interview Q2: Radix Sort Algorithm, Big O analysis33:47
  • Coding Exercise – Python: Radix Sort1 question
  • Coding Exercise – JS: Radix Sort1 question
  • JS Code33:02
  • Python Code01:31

Day 13 Singly Linked List Data Structures and Algorithms12 lectures • 1hr 53min

  • Day 13 Goals01:02
  • Class Syntax12:29
  • Data Structures Crash Course: Linked Lists11:11
  • Coding Interview Q1: Design a Singly Linked List04:07
  • Coding Exercise – Python : Design a Singly Linked List1 question
  • Coding Exercise – JS : Design a Singly Linked List1 question
  • Method and Big O analysis25:18
  • JS Code36:12
  • Python Code01:24
  • Coding Interview Q2: Remove Duplicates01:30
  • Coding Exercise – Python: Remove Duplicates1 question
  • Coding Exercise – JS: Remove Duplicates1 question
  • Method and Big O analysis07:01
  • Javascript Code07:57
  • Javascript Code walkthrough04:05
  • Python Code01:02

Day 14 Singly Linked List Data Structures and Algorithms11 lectures • 51min

  • Day 14 Goals00:30
  • Coding Interview Q1: Reverse02:07
  • Coding Exercise – Python: Reverse SLL1 question
  • Coding Exercise – JS: Reverse SLL1 question
  • Method and Big O analysis08:18
  • Javascript Code08:50
  • Javascript Code walkthrough03:56
  • Python Code00:52
  • Coding Interview Q2 : Cycle Detection01:39
  • Coding Exercise – Python: Cycle Detection1 question
  • Coding Exercise – JS: Cycle Detection1 question
  • Method and Big O analysis08:39
  • Javascript Code10:43
  • Python Code01:09
  • proof04:16

Day 15 : Singly Linked List Data Structures and Algorithms9 lectures • 43min

  • Day 15 Goals00:31
  • Coding Interview Q1: Find duplicate number02:47
  • Coding Exercise – Python: Find duplicate number1 question
  • Coding Exercise – JS: Find duplicate number1 question
  • method and Big O analysis08:01
  • Javascript code05:35
  • Python code00:39
  • Coding Interview Q2: Add 2 numbers03:31
  • Coding Exercise – Python: Add 2 numbers1 question
  • Coding Exercise – JS: Add 2 numbers1 question
  • method and Big O analysis07:27
  • Javascript code12:46
  • Python code01:28

Day 16 Doubly Linked List Data Structures and Algorithms20 lectures • 1hr 36min

  • Day 16 Goals00:46
  • Coding Interview Q1: Remove Node, Insert Node03:03
  • Coding Exercise – Python: Remove Node1 question
  • Coding Exercise – JS: Remove Node1 question
  • Method remove06:43
  • Javascript Code: remove11:19
  • walkthrough remove05:59
  • Python code: Remove01:05
  • Insert Intro05:08
  • Method Insert08:29
  • Coding Exercise- Python: Insert Node1 question
  • Coding Exercise- JS: Insert Node1 question
  • Javascript Code: Insert12:25
  • Python code: Insert01:40
  • Coding Interview Q2: Remove Value, Insert at Position in Doubly Linked List02:06
  • Coding Exercise – Python: Remove Value in Doubly Linked List1 question
  • Coding Exercise – JS: Remove Value in Doubly Linked List1 question
  • Remove Val Method04:16
  • Javascript Code02:55
  • Code walkthrough03:28
  • Python Code02:02
  • Insert at Position03:33
  • method04:59
  • Coding Exercise – Python: Insert at Position in Doubly Linked List1 question
  • Coding Exercise – JS: Insert at Position in Doubly Linked List1 question
  • Javascript Code10:47
  • Walkthrough Insert03:09
  • Python Code01:52

Day 17: Stacks Data Structures and Algorithms9 lectures • 47min

  • Day 17 Goals00:33
  • Data Structures Crash Course: Stacks and Queues06:08
  • Coding Interview Q1: Design a Stack07:09
  • Coding Exercise – Python: Design a Stack (with Linked List)1 question
  • Coding Exercise – JS: Design a Stack (with Linked List)1 question
  • Javascript Code11:47
  • Python Code01:23
  • Coding Interview Q2: Reverse Polish Notation03:34
  • Coding Exercise – Python: Reverse Polish Notation1 question
  • Coding Exercise – JS: Reverse Polish Notation1 question
  • method and Big O analysis05:12
  • Javascript code10:42
  • Python Code00:53

Day 18: Queue Data Structures and Algorithms8 lectures • 48min

  • Day 18 Goals00:54
  • Coding Interview Q1: Design a Queue05:57
  • Coding Exercise – Python: Design a Queue using a Linked list1 question
  • Coding Exercise – JS: Design a Queue (with a Linked List)1 question
  • Javascript Code13:05
  • Python Code00:54
  • Coding Interview Q2 : Queue with Stack02:49
  • Coding Exercise – Python: Queue with Stack1 question
  • Coding Exercise – JS: Queue with Stack1 question
  • method and Big O analysis08:27
  • Javascript code14:42
  • Python Code00:55

Day 19: Binary Tree / Binary Search Tree Data Structures and Algorithms14 lectures • 3hr 18min

  • Day 19 Goals00:43
  • Data Structures Crash Course: Trees Introduction05:00
  • Theory: Binary Trees 124:07
  • Proof : height of Balanced Binary tree is floor(log N)10:41
  • Theory: Binary Tree Terminaologies10:05
  • What is a BST – Binary Search Tree05:49
  • Coding Interview Q1: Construct Binary Search Tree,Big O analysis21:31
  • Coding Exercise – Python: Construct Binary Search Tree1 question
  • Coding Exercise – JS: Construct Binary Search Tree1 question
  • Javascript Code38:31
  • Javascript Code Walkthrough20:28
  • Python Code01:01
  • Coding Interview Q2 : Traverse – BFS and DFS,Big O analysis29:07
  • Coding Exercise – Python: Traverse – BFS and DFS1 question
  • Coding Exercise – JS: Traverse Binary Search Tree – BFS, DFS1 question
  • Javascript Code17:26
  • Javascript Walkthrough13:02
  • Python Code00:35

Day 20: Binary Tree / Binary Search Tree Data Structures and Algorithms12 lectures • 1hr 28min

  • Day 20 Goals00:43
  • Coding Interview Q1: Level Order traversal04:49
  • Coding Exercise – Python: Instance method, Level Order Traversal1 question
  • Coding Exercise – JS: Level Order traversal1 question
  • Insert method09:07
  • Javascript code : Insert12:51
  • Python code00:43
  • Level Order Traversal Method and Big O analysis14:55
  • Javascript Code – Level order traversal15:39
  • Python code – Level order traversal01:25
  • Coding Interview Q2: Left / Right view02:33
  • Coding Exercise – Python: Left/Right view1 question
  • Coding Exercise – JS: Left/Right view1 question
  • Method and Big O analysis11:42
  • Javascript Code09:32
  • Python code03:38


Day 21: Binary Tree Data Structures and Algorithms12 lectures • 1hr 12min

  • Day 21 Goals00:30
  • Coding Interview Q1 : Invert Binary Tree01:20
  • Iterative method and Big O analysis05:12
  • Javascript: Iterative Code08:45
  • Python Code: Iterative02:17
  • Recursive method and Big O analysis05:06
  • Javascript: Recursive code11:42
  • Python Code: Recursive01:39
  • Coding Interview Q2 : Diameter of Binary Tree03:36
  • Method and Big O analysis16:55
  • Javascript Code12:21
  • Python Code02:20

Day 22: Binary Search Trees Data Structures and Algorithms9 lectures • 1hr 20min

  • Day 22 Goals00:35
  • Coding Interview Q1: sorted array to BST03:39
  • method and Big O analysis18:21
  • Javascript code17:36
  • Python code01:08
  • Coding Interview Q2 : Valid BST04:18
  • Method and Big O analysis13:46
  • Javascript Code18:34
  • Python Code02:22

Day 23: Heaps and Priority Queue Data Structures and Algorithms12 lectures • 2hr 13min

  • Day 23 Goals00:26
  • Binary Heap: Data Structure Crash Course15:17
  • Coding Interview Q1: Construct Max Binary Heap, Big O analysis18:44
  • Proof of Build Binary Heap Time Complexity15:48
  • Javascript Code24:31
  • Javascript Code walkthrough22:25
  • Python Code01:40
  • Introduction to Priority Queue02:39
  • Coding Interview Q2: Construct Priority Queue,Big O analysis06:33
  • Javascript Code22:56
  • Javascript Code Walkthrough01:10
  • Python Code00:59

Day 24: Graphs Data Structures and Algorithms13 lectures • 1hr 59min

  • Day 24 Goals00:28
  • Coding Interview Q1: BFS, Adjacency List,Big O analysis17:45
  • Javascript Code16:13
  • Python Code00:36
  • BFS, Adjacency Matrix13:22
  • Javascript Code21:10
  • Python Code00:49
  • Coding Interview Q2: DFS, Recursive, Big O analysis14:43
  • Javascript Code12:00
  • Python Code00:51
  • DFS Iterative07:47
  • Javascript Code11:55
  • Python Code00:55

Day 25: Graphs Data Structures and Algorithms13 lectures • 2hr 13min

  • Day 25 Goals00:46
  • Coding Interview Q1: Number of Components, Big O analysis14:44
  • Javascript Code26:13
  • Python Code01:09
  • Coding Interview Q2: Course Scheduler06:25
  • Brute Force Method and Big O analysis11:40
  • Javascript Code – Brute Force Method17:23
  • Big O – Brute Force Method05:07
  • Python Code – Brute Force Method01:40
  • Topological Sort based method and Big O analysis27:13
  • Javascript Code09:55
  • Javascript Code Walkthrough09:40
  • Python Code01:13

Study techniques1 lecture • 1min

  • Develop your Focus!00:09

Requirements

  • Basic knowledge of Javascript or Python or any other Programming language ( things like write a loop, function etc)

Description

Student Testimonials:

  • “The teacher excels in explaining complex concepts clearly.” – Liam Bailes
  • “I have just started but the quality of explanation is superb . I had seen many videos on time complexity but he explained very well.”-Deepak Reddy
  • “So far, I am finding this course really helpful, and the trainer is really sorted about what he needs to teach and is completely prepared with his plan and material. I feel this is one of the best courses available in Udemy and outside to learn DSA because it is well structured and is delivering what we are looking for.”-Ankur Saxena
  • “Great course. Lecturer is full of in depth knowledge and able to pass it on. Its not easy to find this out there. Thank you.”-Mark Corrigan
  • “Because of this course I understand how to find complexity of the program. Teacher has explained concept in very easy manners, so that any body can understand it properly.”-Amritesh Kumar Singh
  • “I really love the way you have explained it, and thanks for such a great course.”- Soeng Kanel
  • “The course is a rare find for in-depth knowledge.” – Mark Corrigan
  • “Well-structured and thorough preparation for DSA.” – Ankur Saxena
  • “Easy to grasp concepts in a single go.” – Shaik Asrar
  • “Effortless concept assimilation.” – Elisha Benjamin
  • “A great foundation in DSA.” – Prince Roy Sharma
  • “Simplifies understanding DSA.” – Rahul
  • “Clarifies program complexity.” – Amritesh Kumar Singh
  • “Clarified Big O notation for me.” – Aaron Engelmann
  • “Excellent for problem-solving and reasoning.” – Parth
  • “Comprehensive overview of Data Structures.” – Newton
  • “Highly recommended for Tier 1 company preparation.” – Dennis Paul

About the Course:

Welcome to the Coding Interview Bootcamp with a focus on Python and JavaScript!

The primary goal of this course is to prepare you for coding interviews at top tech companies. By tackling one problem at a time and understanding its solution, you’ll accumulate a variety of tools and techniques for conquering any coding interview.

Daily Coding Challenges:

The course is structured around daily coding challenges. Consistent practice will equip you with the skills required for coding interviews and allow you to practice on Leetcode.

Topics Covered:

We start from the basics with Big O analysis, cover common data structures, and discuss real-life problems asked in interviews at tech giants like Google, Meta, Amazon, Netflix, Apple, and Microsoft.

For each question, we will:

  1. Discuss the optimal approach
  2. Explain time and space complexity
  3. Code the solution in JavaScript (you can follow along in your preferred language)


Additional Resources:

The course includes downloadable resources, motivational trackers, and cheat sheets.

Course Outline:

  • Day 1: Arrays, Big O, Sorted Squared Array, Monotonic Array
  • Day 2: Arrays, Rotate Array, Container with Most Water
  • Day 3: Hash Tables, Two Sum, Isomorphic Strings
  • Day 4: Recursion, Fibonacci, Power Sum
  • Day 5: Recursion, Permutations, Power Set
  • Day 6: Strings, Non-Repeating Character, Palindrome
  • Day 7: Strings, Longest Unique Substring, Group Anagrams
  • Day 8: Searching, Binary Search, Search in Rotated Sorted Array
  • Day 9: Searching, Find First and Last Position, Search in 2D Array
  • Day 10: Sorting, Bubble Sort, Insertion Sort
  • Day 11: Sorting, Selection Sort, Merge Sort
  • Day 12: Sorting, Quick Sort, Radix Sort
  • Day 13: Singly Linked Lists, Construct SLL, Delete Duplicates
  • Day 14: Singly Linked Lists, Reverse SLL, Cycle Detection
  • Day 15: Singly Linked Lists, Find Duplicate, Add 2 Numbers
  • Day 16: Doubly Linked Lists, DLL Remove Insert, DLL Remove All
  • Day 17: Stacks, Construct Stack, Reverse Polish Notation
  • Day 18: Queues, Construct Queue, Implement Queue with Stack
  • Day 19: Binary Trees, Construct BST, Traversal Techniques
  • Day 20: Binary Trees, Level Order Traversal, Left/Right View
  • Day 21: Binary Trees, Invert Tree, Diameter of Tree
  • Day 22: Binary Trees, Convert Sorted Array to BST, Validate BST
  • Day 23: Heaps, Max Heap, Min Priority Queue
  • Day 24: Graphs, BFS, DFS
  • Day 25: Graphs, Number of Connected Components, Topological Sort

We offer a full money-back guarantee for 30 days. Enroll today!

  • Jackson

Who this course is for:

  • Students who are about to graduate and trying to get into top Tech companies as software engineers
  • Self taught programmers looking for their first job
  • Experienced developers wanting to get into MAANG companies ( top tech firms)



Latest Free Coupons

Leave a Reply

Your email address will not be published. Required fields are marked *

Check Today's 30+ Free Courses

Close Welcome Bar