The stock trading series is one of the most classic pro […]
Category： LeetCode
LeetCode 215. Kth Largest Element in an Array: QuickSelect vs Heap Sort
The Kth largest element is a high-frequency interview q […]
LeetCode 42. Trapping Rain Water: From Brute Force to Two Pointers
Trapping Rain Water is a classic Hard problem, but once […]
LeetCode 3. Longest Substring Without Repeating Characters: Sliding Window Template
The longest substring without repeating characters is t […]
LeetCode 200. Number of Islands: A Template for DFS/BFS Traversal of 2D Grids
Number of Islands is a classic application of DFS/BFS i […]
LeetCode 560. Subarray Sum Equals K: The Clever Combination of Prefix Sum + HashMap
Subarray Sum Equals K is an excellent Medium problem th […]
LeetCode 53. Maximum Subarray: The First Dynamic Programming Problem
Maximum Subarray is a classic introductory problem for […]
LeetCode 25. Reverse Nodes in k-Group: The Elegance of a Recursive Solution
Reverse Nodes in k-Group is a Hard-level linked list pr […]
LeetCode 206. Reverse Linked List: Iterative and Recursive Solutions, a Must-Know for Interviews
Reversing a linked list is a fundamental operation. An […]
LeetCode 239. Sliding Window Maximum: A Classic Application of Monotonic Queue
Sliding Window Maximum is a classic Hard problem, but s […]
LeetCode 15. 3Sum: The Classic Two-Pointer Template
3Sum is a high-frequency interview question. The core a […]
LeetCode 146. LRU Cache: The Interviewer's Favorite Design Problem — Hand-Writing a Doubly Linked List + Hash Map
The LRU Cache is one of the most frequently asked desig […]