This repository documents my daily progress, logic refactoring, and problem-solving strategies as I prepare for 2026 SDE Internship recruiting.
Moving from a background in English Linguistics to Computer Science, I don't just aim for "Acceptance." I aim for a deep understanding of Computational Thinking. Every solution here is analyzed through the lens of time/space complexity and hardware-level logic.
I categorize my "weaknesses" into a Logic Ledger (εΌ±ι’ζ¬). For every complex problem, I follow a 3-step execution model:
- State Preservation: Store the necessary values before modification.
- Hooking (Re-linking): Update pointers/indices to reflect the new structure.
- Requirement Generation: Establish the necessary conditions for the next iteration.
Focusing on binary logic gates to implement arithmetic operations without standard operators.
- Key Implementation: Sum of Two Integers - Mastering Carry Propagation via
(a & b) << 1.
Handling memory pointer manipulation and edge-case management (Dummy Nodes, Fast/Slow Pointers).
- Key Implementation: Reorder List - Implementing $O(1)$ space complexity by combining middle-finding, reversing, and merging.
Optimizing search and modification tasks from
- Month 1: Foundations - Basic Data Structures (Arrays, Lists, Bitwise).
- Month 2: Traversal & Recursion - Trees, Graphs, DFS/BFS.
- Month 3: Optimization - Dynamic Programming & Greedy Algorithms.
- Month 4: System Design & OOD - Moving from functions to systems.
- Month 5: Mock Interviews - Refining communication and English technical delivery.
- Language: Java 17+
- Environment: IntelliJ IDEA / JUnit 5
- Style Guide: Google Java Style Guide
βPrudent, evidence-based research into every line of code.β
