Line Reflection
Time O(n) · Space O(n) · Official statement on LeetCode
Solutions
// Time: O(n)
// Space: O(n)
// Hash solution.
class Solution {
public:
bool isReflected(vector<pair<int, int>>& points) {
if (points.empty()) {
return true;
}
unordered_map<int, unordered_set<int>> groups_by_y;
int left = numeric_limits<int>::max();
int right = numeric_limits<int>::min();
for (const auto& p : points) {
groups_by_y[p.second].emplace(p.first);
left = min(left, p.first);
right = max(right, p.first);
}
const auto mid = left + right;
for (const auto& kvp : groups_by_y) {
for (const auto& x : kvp.second) {
if (kvp.second.count(mid - x) == 0) {
return false;
}
}
}
return true;
}
};
// Time: O(nlogn)
// Space: O(1)
// Two pointers solution.
class Solution2 {
public:
bool isReflected(vector<pair<int, int>>& points) {
if (points.empty()) {
return true;
}
sort(points.begin(), points.end());
sort(points.begin(), points.begin() + distance(points.begin(), points.end()) / 2,
[](const pair<int, int>& a, const pair<int, int>& b) {
if (a.first == b.first) {
return a.second > b.second;
}
return a.first < b.first;
});
const auto mid = points.front().first + points.back().first;
for (int left = 0, right = points.size() - 1; left <= right; ++left, --right) {
if ((mid != points[left].first + points[right].first) ||
(points[left].first != points[right].first &&
points[left].second != points[right].second)) {
return false;
}
}
return true;
}
};
Beginner Explanation
What is Line Reflection?
Line Reflection (LeetCode #356) is a Medium problem that primarily trains hash table.
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 two pointers.
- 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: Hash, Two Pointers.
AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.
Interview Walkthrough
Interview approach for Line Reflection
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 two pointers.
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 (O(n)) 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 O(n) time and O(n) space.
Pattern focus: two pointers
Use the pattern as a checklist:
- two pointers — 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 | O(n) |
| 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 Line Reflection
- Skipping edge cases — empty collections, single-element inputs, max constraints.
- Wrong invariant for two pointers — 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 two pointers:
- 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: hash table.
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 Line Reflection in a second language (cpp, python).
- Drill 3–5 more problems tagged hash table.
- Teach the solution out loud in under 5 minutes.
- Add this problem to your revision calendar in 3 days and 14 days.
Visualization
Study checklist
- Read the official problem statement on LeetCode
- Solve on paper / whiteboard first
- Implement the two pointers 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
Line Reflection (#356) — Medium. Pattern: two pointers. Complexity: O(n) time / O(n) space. Re-derive the invariant before coding.
FAQs
What is the time complexity of Line Reflection?+
The reference solutions aim for O(n) time and O(n) space. Always re-derive complexity from the code you write in the interview.
What pattern does Line Reflection use?+
It primarily maps to two pointers, within the broader topic of hash table.
Is Line Reflection 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/line-reflection/