This repository contains my personal implementations of core Data Structures and Algorithms (DSA) from scratch using Python.
The purpose of this project is to build a solid foundation in computer science fundamentals, focusing on object-oriented design, memory management, and algorithm optimization (Time & Space Complexity).
The implementations and concepts in this repository are based on the following excellent educational resources:
-
Data Structures in Python - Full Crash Course by NeuralNine
- Focuses on building fundamental data structures (Linked Lists, Stacks, Queues, Trees, Graphs, Hashmaps) from scratch using pure Python classes.
-
The Ultimate DSA Course for 2025 by Boot.dev
- Focuses on Big-O analysis, sorting algorithms, tree/graph traversals (BFS/DFS), and algorithmic problem-solving strategies.
- Linked Lists (Singly, Doubly)
- Stacks & Queues
- Hashmaps (Dictionaries)
- Trees (Binary Search Trees, Tries)
- Graphs (Adjacency Matrix & List)
- Sorting: Bubble Sort, Insertion Sort, Merge Sort, Quick Sort
- Searching: Binary Search
- Graph/Tree Traversal: BFS (Breadth-First Search), DFS (Depth-First Search)
- Advanced: Recursion vs Iteration, Time Complexity (Big-O) Analysis
All code is written for educational purposes and personal skill development.