LeetCode 391 - Perfect Rectangle
LeetCode Problem 391 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Geometry, Sweep Line Solution Problem Understanding This problem asks whether a collection of smaller axis-aligned rectangles perfectly forms one larger rectangle, with no gaps and no overlaps. Each rectangle is represented as: [xi, yi, ai, bi] where: (xi, yi) is the bottom-left corner (ai, bi) is the top-right corner Because the rectangles are axis-aligned, their sides are parallel to...