Pure Storage·Software Engineer·Technical Phone Screen
Apr 2026
Pure Storage asked a geometry problem about counting squares from a set of 2D points, and the whole conversation was basically a walkthrough of three different algorithmic approaches back to back. Pretty focused technical screen, no fluff.
- Given n 2D coordinates, count how many distinct squares can be formed using four of those points as corners. Walk through a brute-force solution, then optimize it step by step.
“Started with the O(n^4) brute-force which they expected, no issues there.” The rest of the author's notes on Software Engineer interview at Pure Storage, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post