AF
Progress
#2523Medium~35 min

Closest Prime Numbers in Range

Time precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN)) · Space O(MAXN) · Official statement on LeetCode

mathsegment tree
cpppython

Solutions

// Time:  precompute:  O(MAX_N * log(MAX_N))
//        runtime:     O(log(MAX_N))
// Space: O(MAX_N)

// Template:
// https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/booking-concert-tickets-in-groups.cpp
template <typename T>
class SegmentTree {
    public:
    explicit SegmentTree(
        int N,
        const function<T(const int&)>& build_fn,
        const function<T(const T&, const T&)>& query_fn)
        : tree(N > 1 ? 1 << (__lg(N - 1) + 2) : 2),
        base(N > 1 ? 1 << (__lg(N - 1) + 1) : 1),
        build_fn_(build_fn),
        query_fn_(query_fn) {

        for (int i = base; i < base + N; ++i) {
            tree[i] = build_fn_(i - base);
        }
        for (int i = base - 1; i >= 1; --i) {
            tree[i] = query_fn_(tree[2 * i], tree[2 * i + 1]);
        }
    }

    T query(int L, int R) const {
        L += base;
        R += base;
        T left, right;
        for (; L <= R; L /= 2, R /= 2) {
            if (L & 1) {
                left = query_fn_(left, tree[L]);
                ++L;
            }
            if ((R & 1) == 0) {
                right = query_fn_(tree[R], right);
                --R;
            }
        }
        return query_fn_(left, right);
    }

    vector<T> tree;
    int base;

private:
    const function<T(const int&)> build_fn_;
    const function<T(const T&, const T&)> query_fn_;
};

// number theory, segment tree
vector<int> linear_sieve_of_eratosthenes(int n) {  // Time: O(n), Space: O(n)
    vector<int> spf(n + 1, -1);
    vector<int> primes;
    for (int i = 2; i <= n; ++i) {
        if (spf[i] == -1) {
            spf[i] = i;
            primes.emplace_back(i);
        }
        for (const auto& p : primes) {
            if (i * p > n || p > spf[i]) {
                break;
            }
            spf[i * p] = p;
        }
    }
    return primes;  // len(primes) = O(n/(logn-1)), reference: https://math.stackexchange.com/questions/264544/how-to-find-number-of-prime-numbers-up-to-to-n
}

const int MAX_N = 1e6;
const auto& PRIMES = linear_sieve_of_eratosthenes(MAX_N);
const auto& build_fn = [](int i) {
    return vector<int>{PRIMES[i + 1] - PRIMES[i], PRIMES[i], PRIMES[i + 1]};
};
const auto& query_fn = [](const vector<int>& x, const vector<int>& y) {
    if (empty(x)) {
        return y;
    }
    if (empty(y)) {
        return x;
    }
    return min(x, y);
};

const auto& ST = SegmentTree<vector<int>>(size(PRIMES) - 1, build_fn, query_fn);
class Solution {
public:
    vector<int> closestPrimes(int left, int right) {
        int i = distance(cbegin(PRIMES), lower_bound(cbegin(PRIMES), cend(PRIMES), left));
        int j = distance(cbegin(PRIMES), upper_bound(cbegin(PRIMES), cend(PRIMES), right)) - 1;
        if (i > j - 1) {
            return {-1, -1};
        }
        const auto& result = ST.query(i, j - 1);
        return {result[1], result[2]};
    }
};

Beginner Explanation

What is Closest Prime Numbers in Range?

Closest Prime Numbers in Range (LeetCode #2523) is a Medium problem that primarily trains math.

How to think about it

  1. Restate the goal in your own words before coding.
  2. Work a tiny example by hand so the invariant becomes obvious.
  3. Identify the pattern — this problem aligns with segment tree.
  4. 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: Number Theory, Linear Sieve of Eratosthenes, Segment Tree.

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

Interview Walkthrough

Interview approach for Closest Prime Numbers in Range

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 segment tree.

Core solution narrative

  1. Define the state you track (pointers, DP cell, set membership, stack top, etc.).
  2. Explain the transition when you process the next element.
  3. Call out time (precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN))) and space (O(MAXN)) before coding.
  4. 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 precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN)) time and O(MAXN) space.

Pattern focus: segment tree

Use the pattern as a checklist:

  • segment 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 precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN))
Space O(MAXN)

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 Closest Prime Numbers in Range

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

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

  1. Primary optimized path — best complexity for typical interviews.
  2. 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 segment 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: math.

Follow-up Interview Questions

Follow-ups

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

Practice Recommendations

What to practice next

  1. Re-solve Closest Prime Numbers in Range in a second language (cpp, python).
  2. Drill 3–5 more problems tagged math.
  3. Teach the solution out loud in under 5 minutes.
  4. Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Closest Prime Numbers in Range: show input structure (math), highlight the moving parts of the segment 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 segment 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

Closest Prime Numbers in Range (#2523) — Medium. Pattern: segment tree. Complexity: precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN)) time / O(MAXN) space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Closest Prime Numbers in Range?+

The reference solutions aim for precompute: O(MAXN * log(MAXN)) runtime: O(log(MAXN)) time and O(MAXN) space. Always re-derive complexity from the code you write in the interview.

What pattern does Closest Prime Numbers in Range use?+

It primarily maps to segment tree, within the broader topic of math.

Is Closest Prime Numbers in Range 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/closest-prime-numbers-in-range/