Data Structures and Algorithms in Python

This repository contains Python implementations of fundamental data structures and algorithms. Each file demonstrates the usage and functionality of a specific data structure or algorithm, with example code included.

Contents

• Arrays_or_List.py: Dynamic array implementation with common operations.
• LinkedList.py: Singly linked list supporting insertion, deletion, and search.
• Stack.py: Stack implementation using linked nodes.
• Queue.py: Queue implementation using linked nodes.
• Non_Weighted_Graph.py: Unweighted graph with traversal algorithms.
• Weighted_Graph.py: Weighted graph with shortest path algorithms.
• Searching_Algorithms.py: Linear and binary search algorithms.
• Sorting_Algorithms.py: Bubble, selection, insertion, and merge sort.
• Sliding_Window_Problems.py: Solutions to classic sliding window problems.

Note: This repository is actively maintained. New data structures, algorithms, and problem solutions will be added in the future. Stay tuned for updates!

Usage

Each file can be run directly to see example usage and output. For example:

python Arrays_or_List.py
python LinkedList.py
python Stack.py
python Queue.py

Requirements

• Python 3.x

No external dependencies are required except for the standard library.

License

This project is for educational purposes.