LeetCode Log

My LeetCode solutions and learning notes.

Summary of Solutions

Strategy: Two-pointer / Sliding Window.
Logic: The window size represents the smallest answer found during the search.
Note: Core logic is handwritten; main function and test cases were generated by AI (Gemini).

Strategy: Hash Set / Set Difference.
Languages Implemented:
- C++: Used std::unordered_set (C++20 contains).
- Python: Used set operators (-).
- Go: Used map[int]bool to simulate a set.
- Rust: Used HashSet and difference() method.
Key Concept: Leveraged each language's native set operations to achieve $O(N + M)$ time complexity.
Note: main functions for each language were generated by AI (Gemini).

Name		Name	Last commit message	Last commit date
Latest commit History 39 Commits
102.binary-tree-level-order-traversal		102.binary-tree-level-order-traversal
108.Convert-Sorted-Array-to-Binary-Search-Tree		108.Convert-Sorted-Array-to-Binary-Search-Tree
111.Minimum-Depth-of-Binary-Tree		111.Minimum-Depth-of-Binary-Tree
112.path-sum		112.path-sum
127.word-ladder		127.word-ladder
373.find-k-pairs-with-smallest-sums		373.find-k-pairs-with-smallest-sums
695.max-area-of-island		695.max-area-of-island
FindTheDifferenceOfTwoArrays		FindTheDifferenceOfTwoArrays
.clang-format		.clang-format
4.median-of-two-sorted-arrays.cpp		4.median-of-two-sorted-arrays.cpp
MinimumWindowSubstring.cpp		MinimumWindowSubstring.cpp
README.md		README.md