#307Medium~35 min

Range Sum Query - Mutable

Time ctor: O(n), update: O(logn), query: O(logn) · Space O(n) · Official statement on LeetCode

tree dfs backtracking segment tree fenwick tree

Solutions

// Time:  ctor:   O(n),
//        update: O(logn),
//        query:  O(logn)
// Space: O(n)

// Binary Indexed Tree (BIT) solution.
class NumArray {
public:
    NumArray(vector<int> &nums) : nums_(nums) {
        bit_ = vector<int>(nums_.size() + 1);
        for (int i = 1; i < bit_.size(); ++i) {
            bit_[i] = nums[i - 1] + bit_[i - 1];
        }
        for (int i = bit_.size() - 1; i >= 1; --i) {
            int last_i = i - lower_bit(i);
            bit_[i] -= bit_[last_i];
        }
    }

    void update(int i, int val) {
        if (val - nums_[i]) {
            add(i, val - nums_[i]);
            nums_[i] = val;
        }
    }

    int sumRange(int i, int j) {
        return sum(j) - sum(i - 1);
    }

private:
    vector<int> &nums_;
    vector<int> bit_;

    int sum(int i) {
        ++i;
        int sum = 0;
        for (; i > 0; i -= lower_bit(i)) {
            sum += bit_[i];
        }
        return sum;
    }

    void add(int i, int val) {
        ++i;
        for (; i <= nums_.size(); i += lower_bit(i)) {
            bit_[i] += val;
        }
    }

    inline int lower_bit(int i) {
        return i & -i;
    }
};

// Time:  ctor:   O(n),
//        update: O(logn),
//        query:  O(logn)
// Space: O(n)
// Segment Tree solution.
class NumArray2 {
public:
    NumArray(vector<int> &nums) : nums_(nums) {
        root_ = buildHelper(nums, 0, nums.size() - 1);
    }
    
    void update(int i, int val) {
        if (nums_[i] != val) {
            nums_[i] = val;
            updateHelper(root_, i, val);
        }
    }

    int sumRange(int i, int j) {
        return sumRangeHelper(root_, i, j);
    }

private:
    vector<int>& nums_;

    class SegmentTreeNode {
    public:
        int start, end;
        int sum;
        SegmentTreeNode *left, *right;
        SegmentTreeNode(int i, int j, int s) : 
            start(i), end(j), sum(s),
            left(nullptr), right(nullptr) {
        }
    };

    SegmentTreeNode *root_;

    // Build segment tree.
    SegmentTreeNode *buildHelper(const vector<int>& nums, int start, int end) {
        if (start > end) {
            return nullptr;
        }

        // The root's start and end is given by build method.
        SegmentTreeNode *root = new SegmentTreeNode(start, end, 0);

        // If start equals to end, there will be no children for this node.
        if (start == end) {
            root->sum = nums[start];
            return root;
        }

        // Left child: start=numsleft, end=(numsleft + numsright) / 2.
        root->left = buildHelper(nums, start, (start + end) / 2);

        // Right child: start=(numsleft + numsright) / 2 + 1, end=numsright.
        root->right = buildHelper(nums, (start + end) / 2 + 1, end);

        // Update sum.
        root->sum = (root->left != nullptr ? root->left->sum : 0) +
                    (root->right != nullptr ? root->right->sum : 0);
        return root;
    }

    void updateHelper(SegmentTreeNode *root, int i, int val) {
        // Out of range.
        if (root == nullptr || root->start > i || root->end < i) {
            return;
        }

        // Change the node's value with [i] to the new given value.
        if (root->start == i && root->end == i) {
            root->sum = val;
            return;
        }

        updateHelper(root->left, i, val);
        updateHelper(root->right, i, val);

        // Update sum.
        root->sum =  (root->left != nullptr ? root->left->sum : 0) +
                     (root->right != nullptr ? root->right->sum : 0);
    }
    
    int sumRangeHelper(SegmentTreeNode *root, int start, int end) {
        // Out of range.
        if (root == nullptr || root->start > end || root->end < start) {
            return 0;
        }

        // Current segment is totally within range [start, end]
        if (root->start >= start && root->end <= end) {
            return root->sum;
        }

        return sumRangeHelper(root->left, start, end) +
               sumRangeHelper(root->right, start, end);
    }
};

// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.update(1, 10);
// numArray.sumRange(1, 2);

Beginner Explanation

What is Range Sum Query - Mutable?

Range Sum Query - Mutable (LeetCode #307) is a Medium problem that primarily trains tree.

How to think about it

Restate the goal in your own words before coding.
Work a tiny example by hand so the invariant becomes obvious.
Identify the pattern — this problem aligns with dfs backtracking, segment tree, and fenwick tree.
Only then translate the idea into code.

Why this problem matters

It sits in the sweet spot of interview difficulty: multiple valid approaches, clear trade-offs. Official solution notes mention: DFS, Segment Tree, BIT, Fenwick Tree.

AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.

Interview Walkthrough

Interview approach for Range Sum Query - Mutable

Opening (30–60 seconds)

Clarify inputs/outputs and edge cases (empty input, single element, duplicates, overflow).
State a brute force so the interviewer knows you can solve it naively.
Propose the optimal direction tied to dfs backtracking, segment tree, and fenwick tree.

Core solution narrative

Define the state you track (pointers, DP cell, set membership, stack top, etc.).
Explain the transition when you process the next element.
Call out time (ctor: O(n), update: O(logn), query: O(logn)) and space (O(n)) before coding.
Code cleanly; narrate variable names.

What interviewers listen for

Correctness on edge cases
Complexity honesty
Ability to discuss trade-offs (e.g., hash map space vs. sort + two pointers)

Follow-up questions they may ask

Can you solve it with less memory?
What if the input stream is infinite / doesn't fit in RAM?
How would tests look for adversarial inputs?

Optimized Approach

Optimized solution notes

The reference solutions on AlgoForge target ctor: O(n), update: O(logn), query: O(logn) time and O(n) space.

Pattern focus: dfs backtracking, segment tree, and fenwick tree

Use the pattern as a checklist:

dfs backtracking — confirm the invariant holds after each step
segment tree — confirm the invariant holds after each step
fenwick tree — confirm the invariant holds after each step

Multiple methods appear in the source solutions — compare them and explain when each is preferable.

Implementation tips

Prefer readable names over micro-optimizations in interviews.
Extract helpers only when they clarify (e.g., expand-around-center, DFS visit).
After AC-level logic, re-scan for off-by-one and null checks.

Complexity Analysis

Complexity

Measure	Bound
Time	ctor: O(n), update: O(logn), query: O(logn)
Space	O(n)

How to justify this in an interview

Time: count loops, map/set operations, and recursive branching; state average vs worst case if relevant.
Space: include hash maps, recursion stack, and output allocation when the problem asks for it.

If your implementation differs from the reference, re-derive big-O from your code — never memorize a complexity you cannot defend.

Common Mistakes

Common mistakes on Range Sum Query - Mutable

Skipping edge cases — empty collections, single-element inputs, max constraints.
Wrong invariant for dfs backtracking, segment tree, and fenwick tree — updating state too early or too late.
Mutating input unexpectedly when the problem forbids it.
Off-by-one in windows, ranges, or binary search bounds.
Ignoring overflow / precision for integer arithmetic problems.
Overengineering — jumping to an advanced structure when a simpler approach works.

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

Primary optimized path — best complexity for typical interviews.
Secondary approach — often brute force, sorting-based, or space-optimized variant.

Practice articulating when you would pick each (constraints, readability, follow-ups).

Edge Cases

Edge cases checklist

Minimum input size
Maximum input size / time limits
Duplicates and already-sorted input
Negative numbers / zeros (if applicable)
Disconnected structures (graphs/trees)
Single path vs branching recursion depth

Pattern Recognition

Spotting this pattern

Signal phrases that point to dfs backtracking, segment tree, and fenwick tree:

Sorted input or ability to sort without changing the answer class
Need for contiguous subarray / substring → consider sliding window
Need for O(1) membership → hash set/map
Optimal substructure + overlapping subproblems → DP
Connectivity / components → graph DFS/BFS or Union-Find

Primary topics: tree.

Follow-up Interview Questions

Follow-ups

How does the solution change if the input is a stream?
Can you solve it in-place?
What if duplicates must be handled differently?
How would you parallelize the approach?
Design tests that would break a buggy implementation.

Practice Recommendations

What to practice next

Re-solve Range Sum Query - Mutable in a second language (cpp, python).
Drill 3–5 more problems tagged tree.
Teach the solution out loud in under 5 minutes.
Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Range Sum Query - Mutable: show input structure (tree), highlight the moving parts of the dfs backtracking, segment tree, and fenwick tree approach, and annotate each step with the maintained invariant and complexity.

Study checklist

Read the official problem statement on LeetCode
Solve on paper / whiteboard first
Implement the dfs backtracking, segment tree, and fenwick tree approach
Verify edge cases from the checklist
State time and space complexity aloud
Compare with the AlgoForge reference solution
Schedule a revision session

Revision notes

Range Sum Query - Mutable (#307) — Medium. Pattern: dfs backtracking, segment tree, and fenwick tree. Complexity: ctor: O(n), update: O(logn), query: O(logn) time / O(n) space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Range Sum Query - Mutable?+

The reference solutions aim for ctor: O(n), update: O(logn), query: O(logn) time and O(n) space. Always re-derive complexity from the code you write in the interview.

What pattern does Range Sum Query - Mutable use?+

It primarily maps to dfs backtracking, segment tree, and fenwick tree, within the broader topic of tree.

Is Range Sum Query - Mutable good for interviews?+

Yes — as a Medium problem it is a solid practice target. Pair it with related problems in the same pattern family for spaced repetition.

Where can I read the official statement?+

Open the official LeetCode page for constraints and examples: https://leetcode.com/problems/range-sum-query-mutable/

#	Title	Difficulty	Topics
3515	Shortest Path in a Weighted Tree	Hard	tree
3841	Palindromic Path Queries in a Tree	Hard	tree
652	Find Duplicate Subtrees	Medium	tree
662	Maximum Width of Binary Tree	Medium	tree
814	Binary Tree Pruning	Medium	tree
865	Smallest Subtree with all the Deepest Nodes	Medium	tree
938	Range Sum of BST	Medium	tree
951	Flip Equivalent Binary Trees	Medium	tree