Add a Complete DSA Series in Python (Explanations + Implementations)

[Him-an-shi]

I would like to contribute a structured series that covers all major DSA topics and algorithms in Python, with step-by-step explanation, dry-run walkthrough, clean code, complexity analysis, and organized folder structure.

Each topic will be added as a separate PR in a standard format:

• ✅ Concept Explanation (README or inline documentation)
• ✅ Python Code (clean & well-commented)
• ✅ LeetCode Example
• ✅ Time & Space Complexity
• ✅ Real-world Use Case (if applicable)

Topics Planned:

1. Searching Algorithms

• Linear Search
• Binary Search (Iterative + Recursive)
• Two Pointer Technique

2. Sorting Algorithms

• Bubble, Selection, Insertion Sort
• Merge Sort, Quick Sort, Heap Sort

3. Recursion

• Recursion Foundation
• Factorial, Fibonacci

4. Data Structures Implementation in Python

• Stack, Queue (Array + Linked List versions)
• Linked List (Singly, Doubly,etc)
• HashMap (Python dict vs. custom)

5. Graph Algorithms

• BFS / DFS
• Union-Find (Disjoint Set)
• Dijkstra / Topological Sort

6. Trees & BST

• Minimum Spanning Trees
• Prims and Kruskal Algorithms
• Binary Tree Traversals (Inorder, Preorder, Postorder)
• BST Insert / Search / Delete

7. Advanced DSA (Optional Extensions)

• Dynamic Programming Basics (LIS, Knapsack, Coin Change)
• Trie (Prefix Search)
• Segment Tree

[Him-an-shi]

Hey! 👋
I'd love to take this up — please assign me this issue.
I’m planning to start a complete DSA series in Python and will contribute one topic within every 3 days.
I would be starting with Searching algorithms and then move forward according to the flow mentioned.

[Aneesh-0108]

Hello there @Him-an-shi ,I would like to contibute to this issue under Hacktoberfest 2025,please assign me this issue.