A comprehensive collection of Data Structures and Algorithms implemented in Python. This repository serves as a personal log of problem-solving techniques, ranging from fundamental concepts to advanced LeetCode challenges.
This repository is designed to document my journey through algorithmic challenges and technical interview preparation. The focus is on writing clean, efficient, and well-commented Python code while building a strong intuition for various problem-solving patterns.
The project is organized into two primary categories:
- /Basics: Fundamental implementations of data structures (like Linked Lists, Stacks, Queues) and core algorithms (Sorting, Searching).
- /LeetCode: Solutions to various LeetCode problems categorized by difficulty or topic (e.g., Sliding Window, Dynamic Programming, Two Pointers).
- Arrays & Strings: Manipulations, Two Pointers, Sliding Window.
- Linked Lists: Traversal, Reversal, and Pointer-based logic.
- Mathematical Algorithms: Logic-heavy problems focusing on efficiency.
- Optimization: Improving time and space complexity from brute-force to optimal solutions.
- Clone the repository:
git clone [https://github.com/PriyanshuSaxena2612/Python-DSA.git](https://github.com/PriyanshuSaxena2612/Python-DSA.git)
- Navigate to the desired folder:
cd Python-DSA/LeetCode - Run any script:
python script_name.py
- Implement daily coding challenges.
- Build logical intuition for complex patterns like Dynamic Programming.
- Document optimal solutions for a wide range of competitive programming problems.
- GitHub: @PriyanshuSaxena2612
Feel free to star the repo if you find these solutions helpful!