yasinshaw
f138f9649d
feat: add LeetCode Hot 100 Medium problems collection
Added 22 high-frequency LeetCode Hot 100 Medium problems with detailed solutions:
**Core Problems:**
- 两数相加 (LeetCode 2) - Linked list manipulation
- 无重复字符的最长子串 (LeetCode 3) - Sliding window
- 三数之和 (LeetCode 15) - Sorting + two pointers
**Array & String:**
- 盛最多水的容器 (LeetCode 11) - Two pointers
- 最长回文子串 (LeetCode 5) - DP / expand around center
- 除自身以外数组的乘积 (LeetCode 238) - Prefix/suffix product
- 最长连续序列 (LeetCode 128) - HashSet
**Backtracking:**
- 电话号码的字母组合 (LeetCode 17) - Backtracking
- 括号生成 (LeetCode 22) - DFS
- 子集 (LeetCode 78) - Backtracking
**Linked List:**
- 删除链表的倒数第N个结点 (LeetCode 19) - Fast/slow pointers
**Binary Tree:**
- 二叉树的中序遍历 (LeetCode 94) - Recursive/iterative
- 二叉树的最大深度 (LeetCode 104) - DFS/BFS
- 翻转二叉树 (LeetCode 226) - Recursive
- 对称二叉树 (LeetCode 101) - Recursive
- 路径总和 (LeetCode 112) - DFS
- 从前序与中序遍历序列构造二叉树 (LeetCode 105) - Recursive
**Dynamic Programming:**
- 柱状图中最大的矩形 (LeetCode 84) - Monotonic stack
- 最大正方形 (LeetCode 221) - DP
- 完全平方数 (LeetCode 279) - DP
**Stack:**
- 最小栈 (LeetCode 155) - Stack design
**DFS/BFS:**
- 单词搜索 (LeetCode 79) - DFS backtracking
Each problem includes:
- Detailed problem description with examples
- Multiple solution approaches
- Go and Java implementations
- Time & space complexity analysis
- Advanced follow-up questions
- P7-level bonus points (deep understanding, real-world applications)
Total: 22 problems, 2500+ lines of content
Suitable for P7 backend interview preparation
Generated with [Claude Code](https://claude.ai/code)
via [Happy](https://happy.engineering)
Co-Authored-By: Claude <noreply@anthropic.com>
Co-Authored-By: Happy <yesreply@happy.engineering>
2026-03-05 12:26:28 +08:00
..
2026-03-02 18:46:34 +08:00
2026-03-02 18:14:26 +08:00
2026-03-01 00:33:32 +08:00
2026-03-02 18:14:26 +08:00
2026-03-01 00:33:32 +08:00
2026-03-01 00:33:32 +08:00
2026-03-05 12:26:28 +08:00