LeetCode

LeetCode 135 note: one pass left to right for the left neighbor, one right to left for the right neighbor, and give each child the larger of the two

LeetCode 3639 note: each new star adds (left distance) × (right distance) new substrings; or binary search on time

LeetCode 3638 note: greedily cut a segment as soon as a value below its maximum appears; until then the segment is non-decreasing, so its maximum is the previous value

LeetCode 3637 note: walk one index through uphill, downhill and uphill; all three runs must be non-empty and reach the end exactly

LeetCode Problem Solving - Reverse Thinking with Sliding Window

LeetCode Problem Solving - Fixed Size Sliding Window with Vowel Counting

LeetCode Problem Solving - Fixed Window with Customer Satisfaction Optimization

LeetCode Problem Solving - Variable Size Sliding Window with Zero Counting

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving - Sliding Window with Character Frequency

LeetCode Problem Solving - Sliding Window with Character Frequency