Welcome to my LeetCode solutions repository. This space serves as a technical diary where I document efficient problem-solving strategies, optimized patterns, and rigorous complexity analysis.
| Category | Completed | Primary Focus |
|---|---|---|
| Arrays & Hashing | 4 | Frequency maps, Prefix sums |
| Two Pointers | 1 | Convergence, Multi-pointer logic |
| Dynamic Programming | 3 | Memoization & Tabulation |
| Bit Manipulation | 5 | Bitmasking & Binary properties |
| Backtracking | 1 | State Space Trees & Pruning |
The Pattern/ directory contains solutions organized by algorithmic strategy—the most effective way to prepare for technical interviews.
| Category | Problem | Difficulty | Complexity |
|---|---|---|---|
| Arrays | Two Sum (#1) | 🟢 Easy | |
| DP | Climbing Stairs (#70) | 🟢 Easy | |
| Sliding Window | Longest Substring (#3) | 🟡 Medium | |
| Two Pointers | Container With Most Water (#11) | 🟡 Medium | |
| Greedy | Best Time to Buy Stock (#121) | 🟢 Easy |
In DataStructure/, I dive deep into "under the hood" implementations of core data structures.
- Bit Manipulation: Advanced operations and binary property analysis.
- Discrete Math: Combinations and permutations (essential for Backtracking problems).
- Tries: Prefix Tree implementations for efficient string searching and autocomplete logic.
The Python_syntax/ folder serves as a quick-reference for language-specific features (e.g., slicing, list comprehensions, itertools) that enable writing clean, "Pythonic," and high-performance code during timed challenges.
Each solution is self-contained. You can execute them locally to verify the logic:
# Example: Running the Two Sum solution
python Pattern/Arrays_Hashing/two_sum.py