Welcome to my dedicated space for algorithmic development and critical thinking. This repository serves as a personal laboratory where I break down, implement, and optimize solutions to various LeetCode problems.
This repository isn't just about collecting solved badges or rushing through an arbitrary checklist. The overarching goal behind every file here is deep, incremental engineering growth:
- Problem-Solving Mechanics: Training my mind to isolate structural core problems within ambiguous or complex problem descriptions.
- Logical Architecture: Designing structured, edge-case proof logic before laying down a single line of actual code.
-
Optimization Frameworks: Actively analyzing and reducing computational complexity—working to transition brute-force methods into streamlined implementations optimized for Time (
$O$ ) and Space ($\Omega$ ).
The scripts contained in this repository explore fundamental paradigms across backend engineering and data structures, including:
- Array Manipulation & Matrix Traversals: Managing structures dynamically with high operational efficiency.
- Two-Pointer Techniques & Sliding Windows: Maximizing sub-array or string parsing speeds while keeping computational overhead low.
- Hash Maps & Math Parsing: Trading minor space footprint adjustments for lightning-fast lookup mechanics.
- String Tokenization: Engineering clean data isolation rules to securely process irregular user input formats.
Each file is isolated, self-contained, and can be executed directly via any terminal or Python environment.
- Clone this repository:
git clone [https://github.com/Imhs14/Leetcode-problems.git](https://github.com/Imhs14/Leetcode-problems.git)
Navigate into the directory: cd Leetcode-problems Execute any solution script: python3 .py “Great programmers don't just write code that computers understand, they write solutions that humans appreciate.” 🚀