A Python-based handbook for competitive programming and coding interviews.
This repository contains implementations of common algorithms, data structures, and problem-solving patterns in Python, along with LaTeX notes covering theoretical foundations and mathematical references.
- Arrays, Strings & Sorting
- Nested Loops & Brute Force Algorithms
- Recursion
- Backtracking
- Stacks
- Two Pointers & Sliding Window
- Partial Sums
- Graphs
- Hash Maps
- Greedy
- Linked Lists
- Algorithmic Fundamentals
- Essential Math Tables & Constants
- Graphs & Dynamic Programming
- Advanced Combinatorics & Number Theory
- String Algorithms, FFT-NTT, Factorization
- Computational Geometry & Miscellaneous
- 📑 Well-structured notes in LaTeX/PDF for quick reference
- 🐍 Clean Python implementations of algorithms and patterns
- 🎯 Focused on competitive programming & interview prep
- 🧮 Covers both practical coding and theoretical math foundations
Feel free to fork this repo, open issues, or submit pull requests.
Sharing more problems, optimizations, or notes is always welcome!
This project is licensed under the MIT License.
✨ Happy Coding & Problem Solving!