Welcome to Python Data Structures and Algorithms: The Complete Bootcamp. This course will start your DSA journey as a beginner. This course touches on each and every important topic through concept, visualization, and implementation. The entire course is designed for beginners with one goal in mind, for you to to understand each and every concept from scratch.
Throughout the course, we will explore the most important Data Structures and Algorithms topics step-by-step:
- Essential Concepts
- Big O Notation
- Memory
- Logarithms
- Recursion
- Data structures:
- Arrays
- Linked Lists (Singly Linked List, Doubly Linked List, Circular Linked List)
- Stacks
- Queues
- Hash Tables
- Trees (Binary Tree, Binary Search Tree, AVL Trees, Red-Black Trees)
- Heaps (Binary Heaps)
- Tries
- Graphs
- Algorithms:
- Elementary Sorting Algorithms
(Bubble Sort, Insertion Sort, Selection Sort)
- Advance Searching Algorithms
(Quick Sort, Merge Sort)
- Tree Traversal
Breadth-First Search: Level Order Traversal,
Depth First Search: PreOrder, InOrder, PostOrder
- Graph Traversal
(Breadth-First Search, Depth First Search)
- Interview Questions
- Two Sum
- MinMax Stack
- Design Linked List
- Reverse Linked List
- Construct Binary Tree
- Invert Binary Tree
- Construct Binary Search Tree
- Detect Capital
- Reverse String
- Longest Palindromic Substring
Why this course?
- This course is focused on the concept learning approach; you’ll learn every concept through a logical and visual learning approach.
- Learn all important concepts in the simplest possible way with tons of examples and quizzes.
- You just need basic Python knowledge, we will cover everything step-by-step from scratch.
Resources are here in this link.