Pure Storage·Software Engineer·Technical Phone Screen
- Given a grid, count the number of squares (of any size) it contains. Optimize your solution.
“Started brute force, which was obviously slow.”
Large Enterprises
Screna has 10 Pure Storage interview write-ups. The most reported round is the technical phone screen (6).
10 interview notes · updated Jun 2026
“Started brute force, which was obviously slow.”
“I started with the min-heap pretty quickly, keyed by absolute fire time, which they seemed fine with.”
“Started okay with the basic uniqueness guarantees, talked through a bitmap vs a heap of free ranges.”
“The base problem itself is fine, it's the follow-ups that get you.”
“My first instinct was to sort the points and check distances, which works until you hit weird cases like three points on the same line or duplicate coordinates.”
“I started with the obvious answer, put a mutex around the heap, and they nodded but immediately asked what happens when a new event gets scheduled with an earlier fire time than whatever the worker is sleeping on.”
“My first instinct was to do something with slopes and distances and I immediately started second-guessing myself on floating point precision.”
“My first instinct was to brute-force all combinations of four points and check each one, which is obviously way too slow.”
“The core idea clicked pretty fast for me: pair a hash map with a dynamic array so you get constant-time lookups and O(1) random access.”
“Started with the O(n^4) brute force which was fine, they nodded and said 'okay now make it faster.' Fixed two diagonal points and checked if the other two exist, that got me to O(n^3).”