|
1 | | -# LeetCode 75 Solutions |
| 1 | +# Algorithmic Patterns |
2 | 2 |
|
3 | | -This repository contains my solutions to the problems from the |
4 | | -[LeetCode 75 Study Plan](https://leetcode.com/studyplan/leetcode-75/). The study plan covers essential algorithmic |
5 | | -topics and is a great way to improve coding interview skills. |
| 3 | +This repository contains curated solutions to a subset of common algorithmic problems, primarily based on the LeetCode 75 study plan. |
6 | 4 |
|
7 | | -## 📌 About LeetCode 75 |
| 5 | +The purpose of this repository is **to maintain algorithmic fluency and document common problem-solving patterns** that frequently appear in technical interviews and real-world engineering tasks. |
8 | 6 |
|
9 | | -The LeetCode 75 Study Plan is a curated list of 75 problems covering: |
10 | | -- Array & String manipulation |
11 | | -- Two Pointers |
12 | | -- Sliding Window |
13 | | -- Prefix Sum |
14 | | -- Hash Map/Set |
15 | | -- Stack |
16 | | -- Queue |
17 | | -- And other important DSA concepts |
| 7 | +This is not intended as a competitive programming showcase, but rather as a structured reference for fundamental data structures and algorithms. |
| 8 | + |
| 9 | +--- |
| 10 | + |
| 11 | +## 📌 Scope |
| 12 | + |
| 13 | +The problems cover a range of foundational algorithmic topics, including: |
| 14 | +- Arrays and strings |
| 15 | +- Two pointers |
| 16 | +- Sliding window |
| 17 | +- Prefix sums |
| 18 | +- Hash-based data structures |
| 19 | +- Stack and queue |
| 20 | +- Basic graph and traversal patterns |
| 21 | + |
| 22 | +Each solution focuses on: |
| 23 | +- clarity and readability |
| 24 | +- explicit time and space complexity |
| 25 | +- well-known algorithmic patterns rather than clever tricks |
| 26 | + |
| 27 | +--- |
18 | 28 |
|
19 | 29 | ## 🗂 Repository Structure |
20 | 30 |
|
21 | 31 | ``` |
22 | | -leetcode75/ |
23 | | -├── array-string/ # Array & String problems |
24 | | -├── two-pointers/ # Two Pointers problems |
25 | | -├── sliding-window/ # Sliding Window problems |
26 | | -├── prefix-sum/ # Prefix Sum problems |
27 | | -└── ... # Other categories |
| 32 | +. |
| 33 | +├── pyproject.toml # Project configuration |
| 34 | +├── src/ |
| 35 | +│ ├── array_string/ # Array and string manipulation patterns |
| 36 | +│ ├── hashmap_set/ # Hash map and set based problems |
| 37 | +│ ├── prefix_sum/ # Prefix sum techniques |
| 38 | +│ ├── sliding_window/ # Sliding window pattern |
| 39 | +│ ├── two_pointers/ # Two pointers pattern |
| 40 | +│ ├── stack/ # Stack-based problems |
| 41 | +│ └── queue/ # Queue-based problems |
| 42 | +│ |
| 43 | +│ # Each submodule follows a consistent structure: |
| 44 | +│ # <problem_name>/ |
| 45 | +│ # ├── __init__.py |
| 46 | +│ # └── solution.py |
| 47 | +│ |
| 48 | +└── tests/ # Tests for all problems |
28 | 49 | ``` |
29 | 50 |
|
30 | | -## 🚀 How to Use |
| 51 | +--- |
| 52 | + |
| 53 | +## 🧠 Design principles |
| 54 | + |
| 55 | +- Clean, readable Python code |
| 56 | +- Emphasis on algorithmic patterns |
| 57 | +- Avoidance of overly compact or non-obvious solutions |
| 58 | +- Explicit handling of edge cases |
| 59 | + |
| 60 | +--- |
| 61 | + |
| 62 | +## 🛠 Language |
| 63 | + |
| 64 | +- Python |
| 65 | + |
| 66 | +--- |
| 67 | + |
| 68 | +## 🔎 Notes |
| 69 | + |
| 70 | +This repository complements my primary work in **machine learning and LLM-based systems**, where a solid understanding of algorithms and data structures remains essential for building reliable and scalable production systems. |
31 | 71 |
|
32 | | -1. Clone the repository: |
33 | | - ```bash |
34 | | - git clone https://github.com/onixlas/leetcode75.git |
35 | | - ``` |
36 | | -2. Navigate to the specific problem category and solution file. |
37 | | -3. Solutions are written in Python |
|
0 commit comments