This repository demonstrates hands-on mastery of fundamental computer science concepts through clean, well-documented Python implementations. Unlike library-dependent code, every data structure and algorithm here is built from scratch to showcase deep understanding of how things work under the hood.
Category
Count
Data Structures
10+
Algorithms
9+
Interactive Notebooks
15+
Practice Exercises
20+
Lines of Code
2,500+
✅ No External Dependencies — Pure Python implementations
✅ Interview-Ready — Covers FAANG-style questions
✅ Well-Documented — Clear explanations & comments
✅ Interactive — Jupyter notebooks for step-by-step learning
✅ Practical Examples — Real-world use cases
📦 Linear Structures
Structure
Implementation
Key Operations
Notebook
Singly Linked List LinkedList.py Insert, Delete, Traverse, Search
—
Doubly Linked List DoublyLinkedList.py Bidirectional traversal, Insert at any position
—
Stack Stack.ipynb Push, Pop, Peek, IsEmpty
📓
Queue Queue.ipynb Enqueue, Dequeue, Producer-Consumer pattern
📓
🗂️ Hash-Based Structures
Structure
Implementation
Collision Strategy
Notebook
Hash Table (Chaining) HashTableChaining.py Separate Chaining with Linked Lists
📓
Hash Table (Probing) HashTableProbing.py Linear Probing (Open Addressing)
📓
🌳 Tree Structures
Structure
Implementation
Key Operations
Notebook
General Tree Tree.py Add child, Get level, Print hierarchy
📓
Binary Search Tree BinarySearchTree.py Insert, Delete, Search, Min/Max, Traversals
📓
🔗 Graph Structures
Structure
Implementation
Key Operations
Notebook
Directed Graph Graph.py Adjacency List, Find all paths, Shortest path
📓
Algorithm
Time Complexity
Implementation
Description
Binary Search O(log n)
BinarySearch.py Iterative & Recursive implementations
Binary Search (Find All) O(log n + k)
BinarySearch-excercise.py Find all occurrences of duplicates
Algorithm
Best
Average
Worst
Space
Stable
Bubble Sort O(n)
O(n²)
O(n²)
O(1)
✅
Quick Sort O(n log n)
O(n log n)
O(n²)
O(log n)
❌
Merge Sort O(n log n)
O(n log n)
O(n log n)
O(n)
✅
Insertion Sort O(n)
O(n²)
O(n²)
O(1)
✅
Selection Sort O(n²)
O(n²)
O(n²)
O(1)
❌
Shell Sort O(n log n)
O(n^1.25)
O(n²)
O(1)
❌
Algorithm
Implementation
Use Case
Depth-First Search (DFS) dfs.py Path finding, Cycle detection, Topological sort
Breadth-First Search (BFS) bfs.py Shortest path (unweighted), Level-order traversal
📊 Complexity Analysis Cheat Sheet
Data Structure
Access
Search
Insert
Delete
Space
Array O(1)
O(n)
O(n)
O(n)
O(n)
Linked List O(n)
O(n)
O(1)*
O(1)*
O(n)
Stack O(n)
O(n)
O(1)
O(1)
O(n)
Queue O(n)
O(n)
O(1)
O(1)
O(n)
Hash Table —
O(1)†
O(1)†
O(1)†
O(n)
Binary Search Tree O(log n)†
O(log n)†
O(log n)†
O(log n)†
O(n)
Graph (Adj. List) O(V)
O(V)
O(1)
O(E)
O(V+E)
*At known position †Average case
Each topic includes hands-on exercises with solutions:
🔷 Arrays — Manipulation, searching, sorting
Finding max/min elements
Marvel heroes data processing
Odd/even number separation
Expense tracking system
🔷 Linked Lists — Pointer manipulation mastery
Implement singly linked list from scratch
Add doubly linked list functionality
Insert/delete at any position
Reverse a linked list
🔷 Hash Tables — Collision handling strategies
Weather data analysis with hash tables
Word occurrence counter (poem analysis)
Stock price lookup system
Custom hash function design
🔷 Stacks — LIFO applications
String reversal
Balanced parentheses checker ()[]{}
Expression evaluation
🔷 Queues — FIFO applications
Binary number generator
Food ordering system (with threading!)
Producer-consumer pattern
🔷 Trees — Hierarchical data mastery
Management hierarchy visualization
Location hierarchy system
BST operations (CRUD)
Tree traversals (Inorder, Preorder, Postorder)
🔷 Graphs — Network algorithms
Flight route planning system
Find all paths between nodes
Shortest path (by hops)
DFS/BFS implementations
Python 3.10+
Jupyter Notebook (optional, for interactive notebooks)
# Clone the repositorycd python-algorithms
# (Optional) Create virtual environmentsource venv/bin/activate # On Windows: venv\Scripts\activate# Install Jupyter for interactive notebooks# Launch Jupyter# Run standalone Python implementations# Or explore interactivelypython-algorithms/
│
├── 📂 data_structures/ # Main implementations
│ ├── 📄 LinkedList.py # Singly linked list
│ ├── 📄 DoublyLinkedList.py # Doubly linked list
│ ├── 📄 HashTableChaining.py # Hash table (chaining)
│ ├── 📄 HashTableProbing.py # Hash table (linear probing)
│ ├── 📄 BinarySearchTree.py # BST with traversals
│ ├── 📄 Tree.py # General tree
│ ├── 📄 Graph.py # Directed graph
│ └── 📓 *.ipynb # Interactive notebooks
│
├── 📂 search_algorithms/ # Search & sort algorithms
│ ├── 📄 BinarySearch.py # Iterative binary search
│ ├── 📓 BubbleSort.ipynb # Sorting notebook
│ └── 📓 *.ipynb # More notebooks
│
├── 📂 _resources/ # Learning materials
│ ├── 📂 algorithms/ # Algorithm exercises & solutions
│ │ ├── BinarySearch/
│ │ ├── BubbleSort/
│ │ ├── QuickSort/
│ │ ├── MergeSort/
│ │ ├── InsertionSort/
│ │ ├── SelectionSort/
│ │ ├── ShellSort/
│ │ ├── DepthFirstSearch/
│ │ └── BreadthFirstSearch/
│ │
│ └── 📂 data_structures/ # Data structure exercises
│ ├── Arrays/
│ ├── LinkedList/
│ ├── HashTable/
│ ├── Stack/
│ ├── Queue/
│ ├── Tree/
│ └── Graph/
│
├── 📄 TECHNICAL_OVERVIEW.md # Detailed technical documentation
└── 📄 README.md # You are here!
💼 Technical Skills Demonstrated
Type hints & annotations
Magic methods (__setitem__, __getitem__)
Collections module (deque)
Multi-threading
Big O complexity analysis
Recursion & iteration
Pointer manipulation
Algorithm design patterns
Clean, readable code
Modular architecture
Interactive documentation
Test-driven exercises
📚 Recommended order for studying this repository:
1. Arrays → Foundation of sequential data
↓
2. Linked Lists → Understanding pointers/references
↓
3. Hash Tables → Key-value storage & collision handling
↓
4. Stacks & Queues → LIFO/FIFO abstract data types
↓
5. Trees & BST → Hierarchical data organization
↓
6. Graphs → Network modeling with DFS/BFS
↓
7. Sorting → Comparison-based algorithms
↓
8. Searching → Efficient data retrieval
Contributions, issues, and feature requests are welcome! Feel free to check the issues page .
Built with 💙 by libe.dev
⭐ Star this repository if you found it helpful!
