Data Structures and Algorithms Python: The Complete Bootcamp

Welcome to Data Structures and Algorithms – Coding Interview Bootcamp, One single course to start your DSA journey as a beginner step–by–step. 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, to understand each and every concept from scratch with proper knowledge of their complexities and implementations in Python.

Throughout the course, we will explore the most important Data Structures and Algorithms topics step–by–step:

1. Essential Concepts
– Big O Notation
– Memory
– Logarithms
– Recursion

2. 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

3. 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)

4. 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