Udemy-TheCompleteDataStructuresandAlgorithmsCourseinPython10802025-7

Course content

Sections: 44

•

Activities: 1

•

Resources: 397

Announcements
1 Getting the Most Out of This Course
2 Curriculum Walkthrough
3 What is a Data Structure
4 What is an algorithm
5 Why are Data Structures and Algorithms important
6 Types of Data Structures
7 Types of Algorithms
8 Python Programming For Everyone
12 Code Editor

1 What is Big O
2 Big O Notations Theta Omega and Big O
3 Big O O1
4 Big O ON
5 Drop Constants
6 Big O On2
7 Drop Non Dominant Terms
8 Big O OlogN
9 Space Complexity
10 Different Terms for Input Add vs Multiply
11 How to measure the codes using Big O

1 What is an Array
2 Types of Array
3 Arrays in Memory
4 Create an Array
5 Insertion to Array
6 Traversal Operation
7 Accessing an element of Array
8 Searching for an element in Array
9 Deleting an element from Array
10 Time and Space Complexity of One Dimensional Array
11 One Dimensional Array Practice
12 Create Two Dimensional Array
13 Insertion Two Dimensional Array
14 Accessing an element of Two Dimensional Array
15 Traversal Two Dimensional Array
16 Searching for an element in Two Dimensional Array
17 Deletion Two Dimensional Array
18 Time and Space Complexity of 2D Array
19 When to useavoid array

1 What is a List How to create it
2 AccessingTraversing a list
3 UpdateInsert a List
4 SliceDelete from a List
5 Searching for an element in a List
6 List OperationsFunctions
7 Lists and strings
8 Common List pitfalls and ways to avoid them
9 Lists vs Arrays
10 Time and Space Complexity of List
11 List Comprehension
12 Conditional List Comprehension

1 Goals what you will make by the end of this section
2 Calculate Average Temperature
3 Find the Days Above Average Temperature

3 Missing Number Explanation
4 Pairs Two Sum LeetCode 1
6 Finding a number in an Array
21 Permutation

1 Question 1 Product and Sum
2 Question 2 Print Pairs
3 Question 3 Print Unordered Pairs
4 Question 4 Print Unordered Pairs 2 Arrays
5 Question 5 Print Unordered Pairs 2 Arrays 100000 Units
6 Question 6 Reverse
7 Question 7 ON Equivalents

1 What is a Dictionary
2 Create a Dictionary
3 Dictionaries in memory
4 Insert Update an element in a Dictionary
5 Traverse through a Dictionary
6 Search for an element in a Dictionary
7 Delete Remove an element from a Dictionary
8 Dictionary Methods
9 Dictionary Operations Builtin Functions
10 Dictionary vs List
11 Time and Space Complexity of a Dictionary
12 Dictionary Comprehension

1 What is a Tuple How to create it
2 Tuples in Memory Accessing an element of Tuple
3 Traversing a Tuple
4 Search for an element in Tuple
5 Tuple OperationsFunctions
6 Tuple vs List
7 Time and Space complexity of Tuples

1 What is OOP Why we need it in this course
2 OOP Concepts
3 Create Objects and Access Attributes and Methods
4 Classes
5 Class Attributes
6 Class Methods

1 What is a Linked List
2 Linked List vs ListsArrays
3 Types of Linked List
4 Linked List in the Memory
6 Node Class Constructor
7 Linked List Constructor Creation of Singly Linked List
8 Insertion in Singly Linked List in Memory
9 Insert an Element at the end of Singly Linked List Append method
10 Print Linked List __str__
11 Insert an Element at the beginning of Singly Linked List Prepend method
12 Insert Method in Singly Linked List
13 Traversal of Singly Linked List
14 Search Method in Singly Linked List
15 Get Method in Singly Linked List
16 Set Method in Singly Linked List
17 Pop First Method in Singly Linked List
18 Pop Method in Singly Linked List
19 Remove Method in Singly Linked List
20 Delete All Nodes of Singly Linked List
21 Time and Space Complexity of Singly Linked List

2 What is Circular Singly Linked List CSLL Class
3 Append Method Circular Singly Linked List
4 Print Circular Singly Linked List
5 Prepend Method Circular Singly Linked List
6 Insert Method Circular Singly Linked List
7 Traversal of Circular Singly Linked List
8 Search Method Circular Singly Linked List
9 Get Method Circular Singly Linked List
10 Set Method Circular Singly Linked List
11 Pop First Method Circular Singly Linked List
12 Pop Method Circular Singly Linked List
13 Remove Method Circular Singly Linked List
14 Delete All Nodes Circular Singly Linked List
15 Time and Space Complexity of Circular Singly Linked List

2 What is Doubly Linked List Node Class Constructor
3 Append Method in Doubly Linked List
4 __str__ Method DLL
5 Prepend Method Doubly Linked List
6 Traverse Method Doubly Linked List
7 Reverse Traverse Method Doubly Linked List
8 Search Method Doubly Linked List
9 Get Method Doubly Linked List
10 Set Method Doubly Linked List
11 Insert Method Doubly Linked List
12 Pop First Method Doubly Linked List
13 Pop Method Doubly Linked List
14 Remove Method Doubly Linked List
15 Time and Space Complexity of Doubly Linked List

2 Circular Doubly Linked List Constructor
3 Append Method Circular Doubly Linked List
4 __str__ method Circular Doubly Linked List
5 Prepend Method Circular Doubly Linked List
6 Traverse Method Circular Doubly Linked List
7 Reverse Traverse Method Circular Doubly Linked List
8 Search Method Circular Doubly Linked List
9 Get Method Circular Doubly Linked List
10 Set Method Circular Doubly Linked List
11 Insert Method Circular Doubly Linked List
12 Pop First Method Circular Doubly Linked List
13 Pop Method Circular Doubly Linked List
14 Remove Method Circular Doubly Linked List
15 Delete All Method Circular Doubly Linked List
16 Time and Space Complexity of Circular Doubly Linked List

1 Linked List Class
4 Question 2 Return Kth to Last
5 Question 3 Partition
6 Question 4 Sum Linked Lists
7 Question 5 Intersection

2 What is Stack
3 Stack Operations
4 Stack Implementation using List
5 Push Method using Python List
6 Print Stack __str__ method
7 Pop Method using Python List
8 Peek Method using Python List
9 Time and Space Complexity of Stack using Python List
10 Stack Implementation using Linked List
11 Push Method using Linked List
12 Pop Method using Linked List
13 Peek Method using Linked List
14 isEmpty and Clear Methods using Linked List
15 Time and Space Complexity of Stack using Linked List

1 What is Queue
2 Queue using Python List no size limit
3 Queue using Python List no size limit operations enqueue dequeue peek
4 Circular Queue Python List
5 Circular Queue Python List Operations enqueue dequeue peek delete
6 Queue Linked List
7 Queue Linked List Operations Create Enqueue
8 Queue Linked List Operations Dequeue isEmpty Peek
9 Time and Space complexity of Queue using Linked List
10 List vs Linked List Implementation
11 Collections Module
12 Queue Module
13 Multiprocessing module

1 Question 1 Three in One
2 Question 2 Stack Minimum
3 Question 3 Stack of Plates
4 Question 4 Queue via Stacks
5 Question 5 Animal Shelter

1 What is Recursion
2 Why do we need recursion
3 How Recursion works
4 Recursive vs Iterative Solutions
5 When to useavoid Recursion
6 How to write Recursion in 3 steps
7 How to find Fibonacci numbers using Recursion
8 How to find time complexity for Recursive calls
9 How to measure Recursive Algorithms that make multiple calls

1 Question 1 Sum of Digits
2 Question 2 Power
3 Question 3 Greatest Common Divisor
4 Question 4 Decimal To Binary

1 What is a Tree
2 Why Tree
3 Tree Terminology
4 How to create basic tree in Python
6 Binary Tree
7 Types of Binary Tree
8 Binary Tree Representation
9 Create Binary Tree Linked List
10 PreOrder Traversal Binary Tree Linked List
11 InOrder Traversal Binary Tree Linked List
12 PostOrder Traversal Binary Tree Linked List
13 LevelOrder Traversal Binary Tree Linked List
14 Searching for a node in Binary Tree Linked List
15 Inserting a node in Binary Tree Linked List
16 Delete a node from Binary Tree Linked List
17 Delete entire Binary Tree Linked List
18 Create Binary Tree Python List
19 Insert a value Binary Tree Python List
20 Search for a node in Binary Tree Python List
21 PreOrder Traversal Binary Tree Python List
22 InOrder Traversal Binary Tree Python List
23 PostOrder Traversal Binary Tree Python List
24 Level Order Traversal Binary Tree Python List
25 Delete a node from Binary Tree Python List
26 Delete Entire Binary Tree Python List
27 Linked List vs Python List Binary Tree

1 What is a Binary Search Tree Why do we need it
2 Create a Binary Search Tree
3 Insert a node to BST
4 Traverse BST
5 Search in BST
6 Delete a node from BST
7 Delete entire BST
8 Time and Space complexity of BST

1 What is an AVL Tree
2 Why AVL Tree
3 Common Operations on AVL Trees
4 Insert a node in AVL Left Left Condition
5 Insert a node in AVL Left Right Condition
6 Insert a node in AVL Right Right Condition
7 Insert a node in AVL Right Left Condition
8 Insert a node in AVL all together
9 Insert a node in AVL method
10 Delete a node from AVL LL LR RR RL
11 Delete a node from AVL all together
12 Delete a node from AVL method
13 Delete entire AVL
14 Time and Space complexity of AVL Tree

1 What is Binary Heap Why do we need it
2 Common operations Creation Peek sizeofheap on Binary Heap
3 Insert a node in Binary Heap
4 Extract a node from Binary Heap
5 Delete entire Binary Heap
6 Time and space complexity of Binary Heap

1 What is a Trie Why we need it
2 Common Operations on Trie Creation
3 Insert a string in Trie
4 Search for a string in Trie
5 Delete a string from Trie
6 Practical use of Trie

1 What is Hashing Why we need it
2 Hashing Terminology
3 Hash Functions
4 Types of Collision Resolution Techniques
5 Hash Table is Full
6 Pros and Cons of Resolution Techniques
7 Practical Use of Hashing
8 Hashing vs Other DS

1 What is Sorting
2 Types of Sorting
3 Sorting Terminologies
4 Bubble Sort
5 Selection Sort
6 Insertion Sort
7 Bucket Sort
9 Merge Sort
10 QuickSort Overview
11 Pivot Function Overview
12 Pivot Function Implementation
13 QuickSort Algorithm Implementation
14 Heap Sort
15 Comparison of Sorting Algorithms

1 Introduction to Searching Algorithms
2 Linear Search
3 Linear Search in Python
4 Binary Search
5 Binary Search in Python
6 Time Complexity of Binary Search

1 What is a Graph Why Graph
2 Graph Terminology
3 Types of Graph
4 Graph Representation
5 Create a graph using Python
6 Create Graph using Python Add Vertex
7 Add Edge
8 Remove Edge
9 Remove Vertex

1 Graph Traversal Breadth First Search BFS
2 Breadth First Search BFS in Python
3 Graph Traversal Depth First Search DFS
4 DFS Traversal in Python
5 BFS Traversal vs DFS Traversal

1 Topological Sort
2 Topological Sort Algorithm
3 Topological Sort in Python

1 Single Source Shortest Path Problem SSSPP
2 BFS for SSSPP
3 BFS for SSSPP in Python
4 Why does BFS not work with weighted Graph
5 Why does DFS not work for SSSP

1 Dijkstras Algorithm for SSSP
2 Dijkstras Algorithm Visualization
3 Dijkstra Implementation Part 1
4 Dijkstra Implementation Part 2
5 Dijkstra Algorithm Testing
6 Dijkstra Algorithm with negative cycle

1 Bellman Ford Algorithm
2 Bellman Ford Algorithm with negative cycle
3 Why Bellman Ford runs V 1 times
4 Bellman Ford in Python
5 BFS vs Dijkstra vs Bellman Ford

1 All pairs shortest path problem
2 Dry run for All pair shortest path

1 Floyd Warshall Algorithm
2 Why Floyd Warshall
3 Floyd Warshall with negative cycle
4 Floyd Warshall in Python
5 BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall

1 Minimum Spanning Tree
2 Disjoint Set
3 Disjoint Set in Python

1 Kruskal Algorithm
2 Kruskal Algorithm in Python
3 Prims Algorithm
4 Prims Algorithm in Python
5 Prims vs Kruskal

1 Introduction
3 Solution to Route Between Nodes
5 Solution to Minimal Tree
7 Solution to List of Depths
9 Solution to Check Balanced
11 Solution to Validate BST LeetCode 98
13 Solution to Successor
15 Solution to Build Order
17 Solution to First Common Ancestor

1 What is Greedy Algorithm
2 Greedy Algorithms Insertion Sort Selection Sort Prim Kruskal Topological
3 Activity Selection Problem
4 Activity Selection Problem in Python
5 Coin Change Problem
6 Coin Change Problem in Python
7 Fractional Knapsack Problem
8 Fractional Knapsack Problem in Python

1 What is a Divide and Conquer Algorithm
2 Common Divide and Conquer algorithms
3 How to solve Fibonacci series using Divide and Conquer approach
4 Number Factor
5 Number Factor in Python
6 House Robber
7 House Robber Problem in Python
8 Convert one string to another
9 Convert One String to another in Python
10 Zero One Knapsack problem
11 Zero One Knapsack problem in Python
12 Longest Common Sequence Problem
13 Longest Common Subsequence in Python
14 Longest Palindromic Subsequence Problem
15 Longest Palindromic Subsequence in Python
16 Minimum cost to reach the Last cell problem
17 Minimum Cost to reach the Last Cell in 2D array using Python
18 Number of Ways to reach the Last Cell with given Cost
19 Number of Ways to reach the Last Cell with given Cost in Python

1 What is Dynamic Programming Overlapping property
2 Where does the name of DP come from
3 Top Down with Memoization
4 Bottom Up with Tabulation
5 Top Down vs Bottom Up
6 Is Merge Sort Dynamic Programming
7 Number Factor Problem using Dynamic Programming
8 Number Factor Top Down and Bottom Up
9 House Robber Problem using Dynamic Programming
10 House Robber Top Down and Bottom Up
11 Convert one string to another using Dynamic Programming
14 Zero One Knapsack using Dynamic Programming

1 Introduction
2 Step 1 Understand the problem
3 Step 2 Examples
4 Step 3 Break it Down
5 Step 4 Solve or Simplify
6 Step 5 Look Back and Refactor

1 What is Backtracking
2 Backtracking vs Brute Force Approach
4 N Queens Problem
5 N Queens Problem in Python

Enrolment options

Udemy - The Complete Data Structures and Algorithms Course in Python 1080 2025-7

Course modified date: 31 Aug 2025

Udemy - The Complete Data Structures and Algorithms Course in Python 1080 2025-7

Enrolled students: There are no students enrolled in this course.

Guests cannot access this course. Please log in.

Udemy - The Complete Data Structures and Algorithms Course in Python 1080 2025-7

About the course

Course content

Instructors

Enrolment options

Udemy - The Complete Data Structures and Algorithms Course in Python 1080 2025-7

This course includes

Share this course