The Basic Prefix Sum pattern is the foundation of all Prefix Sum variations. Start with this pattern to understand how prefix sums work before learning more advanced Prefix Sum patterns for coding interviews.
Read moreThe Prefix Sum pattern is one of the most useful array techniques for solving LeetCode problems involving subarray sums, range queries, cumulative values, and counting subarrays. This section covers common variations, recognition rules, and practical examples from LeetCode.
Read moreWe're used to evaluating an algorithm's Time complexity, but we often overlook its Space complexity. However, often the best solution for Time complexity is a brute-force solution for Space complexity and vice versa.
Read moreThe Sliding Window pattern is one of the most common techniques for solving array and string problems involving contiguous ranges. This section covers fixed-size and variable-size windows, common variations, recognition rules, and practical examples from LeetCode.
Read moreThe Two Pointers pattern one of the most common and famous patterns. It uses two indices or pointers to process data efficiently, with different variations for arrays, strings, and linked lists.
Read more
