Python Data Structures & Algorithms + LEETCODE Exercises
-
—> Start Here
-
Big O
-
Classes & Pointers
-
Linked Lists
-
LL: Coding Exercises
-
LL: Interview / LeetCode ExercisesIntroduction to Interview Questions (DO NOT SKIP)LL: Find Middle Node ( ** Interview Question)LL: Has Loop ( ** Interview Question)LL: Find Kth Node From End ( ** Interview Question)LL: Remove Duplicates ( ** Interview Question)LL: Binary to Decimal ( ** Interview Question)LL: Partition List ( ** Interview Question)LL: Reverse Between ( ** Interview Question)
-
Doubly Linked Lists
-
DLL: Coding Exercises
-
DLL: Interview / LeetCode Exercises
-
Stacks & Queues
-
S&Q: Coding Exercises
-
S&Q: Interview / LeetCode ExercisesStack: 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: Parentheses Balanced ( ** Interview Question)Stack: Reverse String ( ** Interview Question)Stack: Sort Stack ( ** Interview Question)Queue Using Stacks: Enqueue ( ** Interview Question)Queue Using Stacks: Dequeue ( ** Interview Question)
-
Trees
-
BST: Coding Exercises
-
BST: Interview / LeetCode Exercises
-
Hash Tables
-
HT: Coding Exercises
-
HT: Interview / LeetCode ExercisesHT: 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 SetsSet: Remove Duplicates ( ** Interview Question)Set: Has Unique Chars ( ** Interview Question)Set: Find Pairs ( ** Interview Question)Set: Longest Consecutive Sequence ( ** Interview Question)
-
Graphs
-
Graph: Coding Exercises
-
Heaps
-
Heap: Coding Exercises
-
Heap: Interview / LeetCode Exercises
-
Recursion
-
Recursive Binary Search Trees
-
rBST: Coding Exercises
-
rBST: Interview / LeetCode Exercises
-
Tree Traversal
-
BST Traversal: Coding Exercises
-
BST Traversal: Interview / LeetCode Exercises
-
Basic Sorts
-
Basic Sorts: Coding Exercises
-
Basic Sorts: Interview / LeetCode Exercises
-
Merge Sort
-
Merge Sort: Coding Exercises
-
Merge: Interview / LeetCode Exercises
-
Quick Sort
-
Quick Sort: Coding Exercises
-
Dynamic Programming
-
Other: Interview / LeetCode ExercisesList: 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!
-
Coding Exercises
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 Amezcua5-Star Review:
“The best course on DSA on Udemy” – Enlai Li5-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 Sarkar5-Star Review:
“Amazing Course. My words cannot describe how much animations helped me to understand the concepts. 100% Recommended.” – Simarjeet Singh5-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 SN5-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 Moghaddam5-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 Posada5-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 Fabro5-Star Review:
“I can follow as a beginner, amazing.” – Sabrina Fung5-Star Review:
“This is the best course I have ever seen” – Luong Viet Tri
What's included
- 10 hours on-demand video
- 108 coding exercises
- 5 articles
- 125 downloadable resources
- Access on mobile and TV
- Certificate of completion