Geometry interview questions
20 geometry problems tagged across recent interview reports. Drilled most heavily by nvidia, cisco, and anduril.
Geometry problems ask you to compute distances, angles, areas, and spatial relationships between points, lines, and shapes. With 20 tagged problems across Nvidia, Cisco, Anduril, and others, geometry is a live threat in phone screens and online assessments. Most candidates see them as rare until they hit one cold: convex hulls, point-in-polygon checks, closest-pair problems, or bounding-box optimization. These aren't calculus, they're coordinate arithmetic and vector logic. StealthCoder reads the diagram and constraints, then outputs the solution in seconds while the proctor sees only your screen.
Most-asked geometry problems
| # | Problem | Diff | # Companies | Pass % |
|---|---|---|---|---|
| 01 | Max Points on a Line | HARD | 11 | 29% |
| 02 | K Closest Points to Origin | MEDIUM | 9 | 68% |
| 03 | Minimum Area Rectangle | MEDIUM | 5 | 55% |
| 04 | Maximum Number of Visible Points | HARD | 4 | 38% |
| 05 | Detonate the Maximum Bombs | MEDIUM | 3 | 49% |
| 06 | Check If It Is a Straight Line | EASY | 2 | 40% |
| 07 | Rectangle Area | MEDIUM | 2 | 47% |
| 08 | Rectangle Overlap | EASY | 2 | 46% |
| 09 | Best Position for a Service Centre | HARD | 1 | 35% |
| 10 | Count Lattice Points Inside a Circle | MEDIUM | 1 | 55% |
| 11 | Find the Largest Area of Square Inside Two Rectangles | MEDIUM | 1 | 45% |
| 12 | Maximum Area Rectangle With Point Constraints I | MEDIUM | 1 | 50% |
| 13 | Maximum Area Rectangle With Point Constraints II | HARD | 1 | 21% |
| 14 | Minimize Manhattan Distances | HARD | 1 | 31% |
| 15 | Minimum Area Rectangle II | MEDIUM | 1 | 56% |
| 16 | Minimum Cuts to Divide a Circle | EASY | 1 | 55% |
| 17 | Minimum Number of Lines to Cover Points | MEDIUM | 1 | 43% |
| 18 | Minimum Time Visiting All Points | EASY | 1 | 83% |
| 19 | Self Crossing | HARD | 1 | 32% |
| 20 | Valid Square | MEDIUM | 1 | 44% |
You can't drill every geometry variant before the assessment. StealthCoder runs invisibly during screen share and solves whichever variant they throw at you. No browser extension. No detection signature. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoderGeometry patterns fall into three buckets: point queries (k-closest-points-to-origin, max-points-on-a-line), area optimization (minimum-area-rectangle, maximum-area-rectangle-with-point-constraints), and collision or containment (detonate-the-maximum-bombs, count-lattice-points-inside-a-circle). Recognition is straightforward: if the problem mentions coordinates, distance, area, angle, or containment, geometry is the frame. Most candidates drill convex hulls and Graham scan once, then panic when the problem asks for Manhattan distance or rotated rectangle logic. The drill order should be distance-based problems first (k-closest-points-to-origin), then line and collinearity (check-if-it-is-a-straight-line, max-points-on-a-line), then area optimization (minimum-area-rectangle). Nvidia and Cisco both weight geometry heavily in their assessments. StealthCoder becomes invaluable when a geometry variant you didn't rehearse appears live, the formula is right there, invisible to the proctor.
Companies that hire most on geometry
20 geometry problems.
You won't drill them all. Pass anyway.
Geometry is one of the patterns interviews actually filter on. Memorizing every variant in a week is a fantasy. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds, no matter which geometry flavor lands in your live OA. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Geometry interview FAQ
How many geometry problems should I drill before an OA?+
Most candidates drill 5-8 core problems: k-closest-points, collinearity checks, area bounds, and one convex-hull variant. Nvidia and Cisco candidates should push to 12-15 because the pattern shows up in their assessments. The 20 total problems on the platform let you stress-test edge cases like ties and coordinate scaling.
How do I recognize a geometry problem in the wild?+
Look for coordinates, distances, areas, or spatial constraints. Phrases like 'maximum area', 'closest points', 'inside', 'on a line', or 'bounding box' are geometry tells. If the problem includes a graph or mentions rotation, distance formula, or containment, it's geometry. Sometimes it hides as 'optimal position' or 'minimize travel'.
Which pattern is hardest: collinearity, area optimization, or point queries?+
Collinearity (max-points-on-a-line) trips up the most people because it requires slope arithmetic and floating-point care. Area optimization (minimum-area-rectangle) is harder conceptually but more formulaic once you see it. Point queries (k-closest-points-to-origin) are usually the easiest entry point and the best starting drill.
Do Nvidia and Cisco test geometry differently?+
Nvidia counts 8 geometry problems in their assessment pool; Cisco has 5. Nvidia leans into convex hulls and bounding-box problems. Cisco's geometry appears more in spatial constraint puzzles. Both expect clean distance and area math. Anduril, Citadel, and Google (4 problems each) test it less frequently but still on hard rounds.
What's the fastest way to solve a geometry problem I've never seen?+
Translate the constraint to algebra: distance formula, area formula, or containment check. Draw a small example. Code the brute force first, then optimize. Most geometry problems have a O(n^2) brute and an O(n log n) sort-and-scan solution. Verify with integer and edge cases before submitting.