Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/4bhimxnyu/data-structure-algorithm.py
Data Structure and algorithm complete guide from python
https://github.com/4bhimxnyu/data-structure-algorithm.py
algorithms code dsa python version-control
Last synced: 24 days ago
JSON representation
Data Structure and algorithm complete guide from python
- Host: GitHub
- URL: https://github.com/4bhimxnyu/data-structure-algorithm.py
- Owner: 4bhimxnyu
- Created: 2024-10-04T16:10:37.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2024-12-14T15:46:37.000Z (27 days ago)
- Last Synced: 2024-12-14T16:37:11.782Z (27 days ago)
- Topics: algorithms, code, dsa, python, version-control
- Language: Python
- Homepage:
- Size: 27.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structures and Algorithms in Python
Welcome to the **Data Structures and Algorithms in Python** repository! This course provides an in-depth understanding of essential data structures and algorithms, focusing on practical implementations using Python. Whether you're a beginner or brushing up your skills, this repository serves as a resource to master DSA concepts and coding techniques.
---
## 📘 Course Overview
### Topics Covered:
1. **Linked Lists**
- Singly Linked List
- Doubly Linked List
- Circular Linked List
2. **Hashmaps**
- Key-Value Pair Implementation
- Collision Handling (Chaining, Open Addressing)
- Applications (e.g., Anagram Check, Frequency Count)
3. **Stacks and Queues**
- Stack Implementation (Array & Linked List)
- Queue Implementation (Array & Linked List)
- Circular Queue
- Applications (e.g., Balancing Parentheses, Reverse a String)
4. **Binary Trees**
- Binary Tree Basics
- Binary Search Tree (BST)
- Tree Traversals (Inorder, Preorder, Postorder)
- Applications (e.g., Lowest Common Ancestor, Path Sum)
5. **Array Algorithms**
- Sorting Algorithms (Bubble Sort, Quick Sort, Merge Sort)
- Searching Algorithms (Binary Search)
- Sliding Window Technique
- Two-Pointer Technique
---
## 🛠️ Features
- Clear and concise explanations.
- Python code implementations for every concept.
- Real-world examples to enhance understanding.
- Interactive exercises and problems.
---
## 🚀 Getting Started
### Prerequisites:
- Basic knowledge of Python programming.
- Python installed on your machine ([Download here](https://www.python.org/downloads/)).
### Clone the Repository:
```bash
git clone https://github.com/4bhimxnyu/Data-Structure-Algorithm.py
cd dsa-python-course
```
---
## 📂 Folder Structure
```
📁 dsa-python-course
├── LinkedLists
│ ├── singly_linked_list.py
│ ├── doubly_linked_list.py
│ └── circular_linked_list.py
├── Hashmaps
│ ├── basic_hashmap.py
│ ├── collision_chaining.py
│ └── open_addressing.py
├── Stacks_Queues
│ ├── stack.py
│ ├── queue.py
│ └── circular_queue.py
├── BinaryTrees
│ ├── binary_tree_basics.py
│ ├── binary_search_tree.py
│ └── tree_traversals.py
├── ArrayAlgorithms
│ ├── sorting_algorithms.py
│ ├── searching_algorithms.py
│ └── sliding_window.py
└── README.md
```
---
## 📚 How to Use
1. Navigate to the folder of your desired topic.
2. Open the corresponding Python file to explore code and concepts.
3. Run the code in your favorite IDE or terminal to test the examples.
4. Tackle the provided exercises for hands-on learning.
---
## 🤝 Contributing
Contributions are welcome! If you have improvements, bug fixes, or additional examples, feel free to:
1. Fork the repository.
2. Create a new branch (`git checkout -b feature-name`).
3. Commit your changes (`git commit -m "Added feature-name"`).
4. Push to the branch (`git push origin feature-name`).
5. Create a pull request.
---
## 🙌 Acknowledgements
- Python documentation for in-depth guidance.
- Open-source contributors for inspiration.
---
## 🧑💻 About the Author
Hi! I'm ([Abhimanyu Pratap Singh](https://github.com/4bhimxnyu)), a passionate developer and educator committed to helping others learn coding and problem-solving. Feel free to connect with me for any questions or feedback!
---
Happy Coding! 🎉