Welcome to the Advanced DSA in Python repository!
This is your complete guide to learning and mastering Data Structures and Algorithms (DSA) using Python — from fundamentals to advanced problem-solving.
- Arrays and Strings
- Time & Space Complexity
- Recursion
- Sorting Algorithms
- Searching Algorithms
- Lists
- Stacks (LIFO)
- Queues (FIFO)
- Linked Lists (Singly, Doubly, Circular)
- Trees (Binary Tree, BST, AVL)
- Graphs (BFS, DFS, Dijkstra, etc.)
- Heaps (Min-Heap, Max-Heap)
- Hashing and Hash Tables
- Dynamic Programming (DP)
- Backtracking
- Greedy Algorithms
- Divide and Conquer
- Sliding Window & Two Pointers
- Binary Search on Answer
- 100+ LeetCode Challenges (Easy to Hard)
- Problem-by-problem walkthroughs
- Coding patterns & strategies
- Interview prep solutions
This repository is part of my personal mission to become a top Machine Learning / AI Engineer, with strong roots in DSA and Python.
- 🔁 Daily Problem Solving
- 🧠 Logic Building
- 💻 LeetCode Practice
- 📈 Consistent GitHub Progress
This repo is ideal for:
- Students preparing for technical interviews
- Self-learners mastering DSA
- Python developers enhancing their algorithmic skills
👉 Browse by folder, understand the concepts, and run code examples.
Feel free to:
- ⭐ Star this repository
- 🛠 Open issues for doubts or suggestions
- 📥 Submit pull requests to contribute
Let’s grow together, one problem at a time!
Made with ❤️ by Mirza Yasir Abdullah Baig
Connect on LinkedIn