MEDIUM Math & Geometry
223. Rectangle Area
📖 Problem
Given the coordinates of two axis-aligned rectangles (rec1 and rec2), return the total area covered by the two rectangles.
🧠 Visual Learning Aid
1 Model the input into the right structure
2 Choose the core technique and invariant
3 Execute step-by-step with a sample
4 Validate complexity and edge cases
JS/TS Refreshers
- •Array methods (`push`, `pop`, `shift`, `slice`)
- •Object/Map/Set usage patterns
- •Function parameter and return typing
Logical Thinking Concepts
- •Define invariants before coding
- •Check edge cases first (`[]`, single element, duplicates)
- •Estimate time/space before implementation
💡 Approach
- → Total area = area1 + area2 - overlap
- → Overlap only if rectangles intersect on both axes
- → X overlap = min(right1, right2) - max(left1, left2) (if positive)
- → Y overlap = min(top1, top2) - max(bottom1, bottom2) (if positive)
- → Overlap area = xOverlap * yOverlap (if both positive)
- → Time: O(1), Space: O(1)
🧭 Prerequisites
🛠️ Hints & Pitfalls
Hints
- •Total area = area1 + area2 - overlap
- •Overlap only if rectangles intersect on both axes
- •X overlap = min(right1, right2) - max(left1, left2) (if positive)
Common Pitfalls
- •Y overlap = min(top1, top2) - max(bottom1, bottom2) (if positive)
- •Overlap area = xOverlap * yOverlap (if both positive)
- •Time: O(1), Space: O(1)
🧪 Test Cases
Hidden tests on submit: 1
Test Case 1
Not run Input:
computeArea(-3, 0, 3, 4, 0, -1, 9, 2); Expected:
45 Test Case 2
Not run Input:
computeArea(-2, -2, 2, 2, -2, -2, 2, 2); Expected:
16 Test Case 3
Not run Input:
computeArea(0, 0, 0, 0, -1, -1, 1, 1); Expected:
4 📝 Code Editor
📤 Output