A 10-Line Template for Substring Problems
A classic LeetCode solution post that turns Minimum Window Substring into a reusable sliding window template using a character count map, a counter and two pointers, then shows how the same shape solves other substring problems such as longest substring without repeating characters. It is short and dense, so read it after you understand the basic idea of a sliding window. Code is in C++.
Guide
Interview Prep
zjh08177 (LeetCode)
Intermediate
Free
A classic LeetCode solution post that turns Minimum Window Substring into a reusable sliding window template using a character count map, a counter and two pointers, then shows how the same shape solves other substring problems such as longest substring without repeating characters. It is short and dense, so read it after you understand the basic idea of a sliding window. Code is in C++.
Ready to start?
Opens on zjh08177 (LeetCode) in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Sessions are free for approved Sefism members, and a few slots open each week.
Follow along
New writing, resources and project ideas land here first.