Python Data Structures & Algorithms + LEETCODE Exercises
DSA + LEETCODE for Coding Interviews — Clear, Step-by-Step Animated Walkthroughs!
Lo que serás capaz de hacer
Welcome to Data Structures & Algorithms in Python 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 Lists Linked Lists Doubly Linked Lists Stacks & Queues Binary Trees Hash Tables Heaps 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 Python Data Structures & Algorithms course on Udemy. I look forward to seeing you in the course. Now let's get started! :-)
- Solve 100+ 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.
Temario
UNIDAD 1 - --> Start Here · 2 leccionesUNIDAD 1 - --> Start Here
UNIDAD 1 - --> Start Here
- Overview (Please Watch)
- Code Editor
UNIDAD 2 - Big O · 15 leccionesUNIDAD 2 - Big O
UNIDAD 2 - Big O
- Big O: Intro
- Big O: Worst Case
- Big O: O(n)
- <> Big O: O(n)
- Big O: Drop Constants
- Big O: O(n^2)
- Understanding and Comparing Algorithmic Efficiencies (O(n) vs O(n²))
- <> Big O: O(n^2)
- Big O: Drop Non-Dominants
- Big O: O(1)
- Big O: O(log n)
- Big O: Different Terms for Inputs
- Big O: Lists
- Big O: Wrap Up
- Big O
UNIDAD 3 - Classes & Pointers · 2 leccionesUNIDAD 3 - Classes & Pointers
UNIDAD 3 - Classes & Pointers
- Classes
- Pointers
UNIDAD 4 - Linked Lists · 17 leccionesUNIDAD 4 - Linked Lists
UNIDAD 4 - Linked Lists
- Linked List: Intro
- LL: Big O
- LL: Under the Hood
- LL: Constructor
- Coding Exercises (Important)
- LL: Print List
- LL: Append
- LL: Pop Intro
- LL: Pop Code
- LL: Prepend
- LL: Pop First
- LL: Get
- LL: Set
- LL: Insert
- LL: Remove
- LL: Reverse
- Linked List Big O
UNIDAD 5 - <> LL: Coding Exercises · 11 leccionesUNIDAD 5 - <> LL: Coding Exercises
UNIDAD 5 - <> LL: Coding Exercises
- LL: Constructor
- LL: Print List
- LL: Append
- LL: Pop
- LL: Prepend
- LL: Pop First
- LL: Get
- LL: Set
- LL: Insert
- LL: Remove
- LL: Reverse
UNIDAD 6 - <> LL: Interview / LeetCode Exercises · 16 leccionesUNIDAD 6 - <> LL: Interview / LeetCode Exercises
UNIDAD 6 - <> LL: Interview / LeetCode Exercises
- LL: Find Middle Node
- LL: Find Middle Node ( ** Interview Question)
- LL: Has Loop
- LL: Has Loop ( ** Interview Question)
- LL: Find Kth Node from End
- LL: Find Kth Node From End ( ** Interview Question)
- LL: Remove Duplicates
- LL: Remove Duplicates ( ** Interview Question)
- LL: Binary to Decimal
- LL: Binary to Decimal ( ** Interview Question)
- LL: Partition List
- LL: Partition List ( ** Interview Question)
- LL: Reverse Between
- LL: Reverse Between ( ** Interview Question)
- LL: Swap Nodes in Pairs
- LL: Swap Nodes in Pairs ( ** Interview Question)
UNIDAD 7 - Doubly Linked Lists · 9 leccionesUNIDAD 7 - Doubly Linked Lists
UNIDAD 7 - Doubly Linked Lists
- DLL: Constructor
- DLL: Append
- DLL: Pop
- DLL: Prepend
- DLL: Pop First
- DLL: Get
- DLL: Set
- DLL: Insert
- DLL: Remove
UNIDAD 8 - <> DLL: Coding Exercises · 9 leccionesUNIDAD 8 - <> DLL: Coding Exercises
UNIDAD 8 - <> DLL: Coding Exercises
- DLL: Constructor
- DLL: Append
- DLL: Pop
- DLL: Prepend
- DLL: Pop First
- DLL: Get
- DLL: Set
- DLL: Insert
- DLL: Remove
UNIDAD 9 - <> DLL: Interview / LeetCode Exercises · 8 leccionesUNIDAD 9 - <> DLL: Interview / LeetCode Exercises
UNIDAD 9 - <> DLL: Interview / LeetCode Exercises
- DLL: Palindrome Checker
- DLL: Palindrome Checker ( ** Interview Question)
- DLL: Reverse
- DLL: Reverse ( ** Interview Question)
- DLL: Partition List
- DLL: Partition List ( ** Interview Question)
- DLL: Reverse Between ( ** Interview Question)
- DLL: Swap Nodes in Pairs ( ** Interview Question)
UNIDAD 10 - Stacks & Queues · 9 leccionesUNIDAD 10 - Stacks & Queues
UNIDAD 10 - Stacks & Queues
- Stack: Intro
- Stack: Constructor
- Stack: Push
- Stack: Pop
- Queue: Intro
- Queue: Constructor
- Queue: Enqueue
- Queue: Dequeue
- Stacks & Queues Big O
UNIDAD 11 - <> S&Q: Coding Exercises · 6 leccionesUNIDAD 11 - <> S&Q: Coding Exercises
UNIDAD 11 - <> S&Q: Coding Exercises
- Stack: Constructor
- Stack:Push
- Stack:Pop
- Queue: Constructor
- Queue:Enqueue
- Queue: Dequeue
UNIDAD 12 - <> S&Q: Interview / LeetCode Exercises · 12 leccionesUNIDAD 12 - <> S&Q: Interview / LeetCode Exercises
UNIDAD 12 - <> S&Q: Interview / LeetCode Exercises
- Stack: Implement Stack Using a List ( ** Interview Question)
- Stack: Push for Stack That Uses List ( ** Interview Question)
- Stack: Pop for Stack That Uses List ( ** Interview Question)
- Stack: Reverse String
- Stack: Reverse String ( ** Interview Question)
- Stack: Parentheses Balanced
- Stack: Parentheses Balanced ( ** Interview Question)
- Stack: Sort Stack
- Stack: Sort Stack ( ** Interview Question)
- Queue Using Stacks
- Queue Using Stacks: Enqueue ( ** Interview Question)
- Queue Using Stacks: Dequeue ( ** Interview Question)
UNIDAD 13 - Trees · 8 leccionesUNIDAD 13 - Trees
UNIDAD 13 - Trees
- Trees: Intro & Terminology
- Binary Search Trees: Example
- BST: Big O
- BST: Constructor
- BST: Insert - Intro
- BST: Insert - Code
- BST: Contains
- BST Big O
UNIDAD 14 - <> BST: Coding Exercises · 3 leccionesUNIDAD 14 - <> BST: Coding Exercises
UNIDAD 14 - <> BST: Coding Exercises
- BST: Constructor
- BST: Insert
- BST: Contains
UNIDAD 15 - <> BST: Interview / LeetCode Exercises · 1 leccionesUNIDAD 15 - <> BST: Interview / LeetCode Exercises
UNIDAD 15 - <> BST: Interview / LeetCode Exercises
- BST: Interview / LeetCode Exercises Location
UNIDAD 16 - Hash Tables · 9 leccionesUNIDAD 16 - Hash Tables
UNIDAD 16 - Hash Tables
- Hash Table: Intro
- HT: Collisions
- HT: Constructor
- HT: Set
- HT: Get
- HT: Keys
- HT: Big O
- HT: Interview Question
- Hash Table Big O
UNIDAD 17 - <> HT: Coding Exercises · 4 leccionesUNIDAD 17 - <> HT: Coding Exercises
UNIDAD 17 - <> HT: Coding Exercises
- HT: Constructor
- HT: Set
- HT: Get
- HT: Keys
UNIDAD 18 - <> HT: Interview / LeetCode Exercises · 11 leccionesUNIDAD 18 - <> HT: Interview / LeetCode Exercises
UNIDAD 18 - <> HT: Interview / LeetCode Exercises
- HT: Item In Common ( ** Interview Question)
- 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 ( ** Interview Question)
- Set: Has Unique Chars ( ** Interview Question)
- Set: Find Pairs ( ** Interview Question)
- Set: Longest Consecutive Sequence ( ** Interview Question)
UNIDAD 19 - Graphs · 9 leccionesUNIDAD 19 - Graphs
UNIDAD 19 - Graphs
- Graph: Intro
- Graph: Adjacency Matrix
- Graph: Adjacency List
- Graph: Big O
- Graph: Add Vertex
- Graph: Add Edge
- Graph: Remove Edge
- Graph: Remove Vertex
- Graphs
UNIDAD 20 - <> Graph: Coding Exercises · 4 leccionesUNIDAD 20 - <> Graph: Coding Exercises
UNIDAD 20 - <> Graph: Coding Exercises
- Graph: Add Vertex
- Graph: Add Edge
- Graph: Remove Edge
- Graph: Remove Vertex
UNIDAD 21 - Heaps · 7 leccionesUNIDAD 21 - Heaps
UNIDAD 21 - Heaps
- Heap: Intro
- Heap: Insert (Intro)
- Heap: Helper Methods
- Heap: Insert (Code)
- Heap: Remove
- Heap: Sink Down
- Heap: Priority Queues & Big O
UNIDAD 22 - <> Heap: Coding Exercises · 6 leccionesUNIDAD 22 - <> Heap: Coding Exercises
UNIDAD 22 - <> Heap: Coding Exercises
- Heap: Insert
- Heap: Remove
- Heap: Sink Down
- MinHeap: Insert
- MinHeap: Remove
- MinHeap: Sink Down
UNIDAD 23 - <> Heap: Interview / LeetCode Exercises · 2 leccionesUNIDAD 23 - <> Heap: Interview / LeetCode Exercises
UNIDAD 23 - <> Heap: Interview / LeetCode Exercises
- Heap: Kth Smallest Element in an Array
- Heap: Maximum Element in a Stream
UNIDAD 24 - Recursion · 3 leccionesUNIDAD 24 - Recursion
UNIDAD 24 - Recursion
- Recursion: Intro
- Call Stack
- Factorial
UNIDAD 25 - Recursive Binary Search Trees · 7 leccionesUNIDAD 25 - Recursive Binary Search Trees
UNIDAD 25 - Recursive Binary Search Trees
- rBST: Contains
- rBST: Insert
- rBST: Delete Intro
- rBST: Delete Code (1 of 3)
- rBST: Delete Code (2 of 3)
- rBST: Minimum Value
- rBST: Delete Code (3 of 3)
UNIDAD 26 - <> rBST: Coding Exercises · 4 leccionesUNIDAD 26 - <> rBST: Coding Exercises
UNIDAD 26 - <> rBST: Coding Exercises
- rBST: Contains
- rBST: Insert
- BST: Minimum Value
- rBST: Delete
UNIDAD 27 - <> rBST: Interview / LeetCode Exercises · 2 leccionesUNIDAD 27 - <> rBST: Interview / LeetCode Exercises
UNIDAD 27 - <> rBST: Interview / LeetCode Exercises
- BST: Convert Sorted List to Balanced BST ( ** Interview Question)
- BST: Invert Binary Tree ( ** Interview Question)
UNIDAD 28 - Tree Traversal · 9 leccionesUNIDAD 28 - Tree Traversal
UNIDAD 28 - Tree Traversal
- Tree Traversal: Intro
- BFS (Breadth First Search): Intro
- BFS: Code
- DFS (Depth First Search): PreOrder - Intro
- DFS: PreOrder - Code
- DFS: PostOrder - Intro
- DFS: PostOrder - Code
- DFS: InOrder - Intro
- DFS: InOrder - Code
UNIDAD 29 - <> BST Traversal: Coding Exercises · 4 leccionesUNIDAD 29 - <> BST Traversal: Coding Exercises
UNIDAD 29 - <> BST Traversal: Coding Exercises
- BFS (Breadth First Search)
- DFS PreOrder
- DFS PostOrder
- DFS InOrder
UNIDAD 30 - <> BST Traversal: Interview / LeetCode Exercises · 2 leccionesUNIDAD 30 - <> BST Traversal: Interview / LeetCode Exercises
UNIDAD 30 - <> BST Traversal: Interview / LeetCode Exercises
- BST: Validate BST ( ** Interview Question)
- BST: Kth Smallest Node ( ** Interview Question)
UNIDAD 31 - Basic Sorts · 8 leccionesUNIDAD 31 - Basic Sorts
UNIDAD 31 - Basic Sorts
- Bubble Sort: Intro
- Bubble Sort: Code
- Selection Sort: Intro
- Selection Sort: Code
- Insertion Sort: Intro
- Insertion Sort: Code
- Insertion Sort: Big O
- Basic Sorts
UNIDAD 32 - <> Basic Sorts: Coding Exercises · 3 leccionesUNIDAD 32 - <> Basic Sorts: Coding Exercises
UNIDAD 32 - <> Basic Sorts: Coding Exercises
- Bubble Sort
- Selection Sort
- Insertion Sort
UNIDAD 33 - <> Basic Sorts: Interview / LeetCode Exercises · 3 leccionesUNIDAD 33 - <> Basic Sorts: Interview / LeetCode Exercises
UNIDAD 33 - <> Basic Sorts: Interview / LeetCode Exercises
- Bubble Sort of LL ( ** Interview Question)
- Selection Sort of LL ( ** Interview Question)
- Insertion Sort of LL ( ** Interview Question)
UNIDAD 34 - Merge Sort · 6 leccionesUNIDAD 34 - Merge Sort
UNIDAD 34 - Merge Sort
- Merge Sort: Overview
- Merge: Intro
- Merge: Code
- Merge Sort: Intro
- Merge Sort: Code
- Merge Sort: Big O
UNIDAD 35 - <> Merge Sort: Coding Exercises · 2 leccionesUNIDAD 35 - <> Merge Sort: Coding Exercises
UNIDAD 35 - <> Merge Sort: Coding Exercises
- Merge
- Merge Sort
UNIDAD 36 - <> Merge: Interview / LeetCode Exercise · 1 leccionesUNIDAD 36 - <> Merge: Interview / LeetCode Exercise
UNIDAD 36 - <> Merge: Interview / LeetCode Exercise
- Merge Two Sorted LL ( ** Interview Question)
UNIDAD 37 - Quick Sort · 5 leccionesUNIDAD 37 - Quick Sort
UNIDAD 37 - Quick Sort
- Quick Sort: Intro
- Pivot: Intro
- Pivot: Code
- Quick Sort: Code
- Quick Sort: Big O
UNIDAD 38 - <> Quick Sort: Coding Exercises · 2 leccionesUNIDAD 38 - <> Quick Sort: Coding Exercises
UNIDAD 38 - <> Quick Sort: Coding Exercises
- Pivot
- Quick Sort
UNIDAD 39 - Dynamic Programming · 5 leccionesUNIDAD 39 - Dynamic Programming
UNIDAD 39 - Dynamic Programming
- Overlapping Subproblems
- Optimized Substructure
- Fibonacci Sequence
- Memoization
- Bottom Up
UNIDAD 40 - <> Other: Interview / LeetCode Exercises · 8 leccionesUNIDAD 40 - <> Other: Interview / LeetCode Exercises
UNIDAD 40 - <> Other: Interview / LeetCode Exercises
- List: Remove Element ( ** Interview Question)
- List: Find Max Min ( ** Interview Question)
- List: Find Longest String ( ** Interview Question)
- List: Remove Duplicates ( ** Interview Question)
- List: Max Profit ( ** Interview Question)
- List: Rotate ( ** Interview Question)
- List: Max Sub Array ( ** Interview Question)
- Thank You!
UNIDAD 41 - <> Coding Exercises · 1 leccionesUNIDAD 41 - <> Coding Exercises
UNIDAD 41 - <> Coding Exercises
- Coding Exercises Are Now After Each Section - (CLICK HERE FOR MORE INFO)
Tu certificado lo emite la SEP, no solo una plataforma
Al demostrar la competencia recibes un certificado emitido por la Secretaría de Educación Pública a través del Gobierno del Estado de México: un documento oficial que puedes presentar con confianza ante cualquier empleador o institución.
Tu certificado con INEC
- Lo emite la Secretaría de Educación Pública (SEP), a través del Gobierno del Estado de México
- Documento oficial con folio verificable en línea
- Lo otorga la Universidad Tecnológica Fidel Velázquez
Otras plataformas en línea
- Constancia privada emitida por la misma plataforma
- Solo acredita horas cursadas o asistencia
- Sin respaldo de una autoridad educativa
Tu itinerario, de la inscripción al certificado
- 1
Inscripción con pago único
Pagas $2,800 MXN una sola vez y entras de inmediato al curso.
- 2
Estudias a tu ritmo
41 unidades con videos, lecturas y actividades, disponibles 24/7 durante 12 meses.
- 3
Cuestionarios por unidad
7 cuestionarios para comprobar lo aprendido.
- 4
Certificado
Emitido por la SEP a través del Gobierno del Estado de México, con folio verificable.
Un certificado oficial de la SEP
- Emitido por la Secretaría de Educación Pública (SEP), a través del Gobierno del Estado de México. No es una constancia privada: es un documento oficial, y ese respaldo marca la diferencia frente a otras plataformas en línea.
- Contenido impartido por Scott Barrett.
- Folio y QR verificables para compartirlo con quien te contrate.
Empieza hoy, a tu ritmo
Un solo pago y acceso inmediato al curso completo durante 12 meses.
- 41 unidades · 255 lecciones · 60 h
- 12 meses de acceso
- 7 cuestionarios de evaluación
- Certificado emitido por la SEP (Gob. del Estado de México) con folio verificable
Sobre tu inscripción
¿Cómo es el pago?
Un solo pago de $2,800 MXN. No hay mensualidades ni cargos recurrentes.
¿Cuánto tiempo tengo acceso?
12 meses desde tu inscripción, 24/7, para avanzar a tu ritmo.
¿Quién imparte el contenido?
El curso es impartido por Scott Barrett; INEC gestiona tu inscripción, evaluación y certificado.
¿Qué pasa cuando vence mi acceso?
Puedes renovar tu cuenta tú mismo desde la plataforma, sin trámites ni esperas.


