↓Skip to main content

Hard

LeetCode 30: Substring with Concatenation of All Words (Brute Force → Counting → Sliding Window)
·3 mins
LeetCode Daily Hard String Sliding Window Two Pointers Hash Map Frequency-Counter Brute-Force
Three approaches: brute force, counting optimization, and sliding window over word-length offsets.
LeetCode 76: Minimum Window Substring
·3 mins
LeetCode Daily Hard Sliding Window String Hash Map Two Pointers Variable Window
LeetCode Problem Solving - Variable Size Sliding Window with Character Counting
LeetCode 239: Sliding Window Maximum
·3 mins
LeetCode Daily Hard Monotonic Queue
LeetCode Problem Solving
LeetCode 2999: Count the Number of Powerful Integers
·2 mins
LeetCode Daily Hard Digit DP
LeetCode Problem Solving